Combinations: Count Groups Fast Without Getting Trapped by Order

You’re looking at a problem that asks how many ways you can select 4 team members from a group of 9 candidates.

Your brain immediately starts listing possibilities. Alex, Beth, Carlos, Dana. Then Alex, Beth, Carlos, Emma. Then you realize you just wrote the same group twice because the order doesn’t matter—selecting Alex first or Dana first gives you the same team.

Three minutes in and you’re stuck in a mental loop, trying to track which groups you’ve already counted while the clock runs and your confidence drains.

The FE doesn’t care if you can manually list every possible group. It cares if you can recognize when order doesn’t matter, apply the combinations formula correctly, and calculate the answer before you waste time on approaches that don’t scale.

Freeze and you burn minutes trying to list groups by hand. Rush and you grab the permutations formula instead, which counts the same group multiple times because it treats different orders as different outcomes.

This isn’t a memory problem. It’s a recognition problem.

You need a clear decision rule that tells you when to use combinations, how to set up n and r without second-guessing, and how to calculate the result cleanly using the formula the FE expects.

This guide walks you through a systematic approach that works on any combinations problem the FE throws at you—from basic selection scenarios to problems that layer conditions or ask about complementary cases. You’ll learn exactly when order doesn’t matter, how to identify n and r from the problem statement, how to apply the formula without sign errors, and how to verify your setup handles the question being asked.

Before we walk through it step by step, watch this short video. It shows you the full process from identifying selection language to setting up n and r to applying the formula cleanly. You’ll see exactly where students typically lose time second-guessing whether order matters and how to avoid that trap completely.

What Is Combinations?

A combination counts the number of ways to select r objects from a set of n distinct objects when the order of selection does not matter.

This matters because many real decisions involve selecting groups where internal arrangement is irrelevant. Choosing 3 people for a committee from 8 candidates. Selecting 5 components to test from a batch of 20. Picking 4 elective courses from a catalog of 12 options. In each case, you care about which items are selected, not the sequence in which you select them.

Think of it like grabbing a handful of marbles from a bag. Whether you grab the red marble first or third doesn’t create a different handful—you end up with the same group either way. Combinations eliminates the duplicates created by reordering the same items.

That’s the fundamental difference from permutations. Permutations count arrangements where ABC and BAC are different outcomes. Combinations count selections where ABC and BAC are the same group counted once.

On the FE Exam, combinations shows up when the problem asks you to count groups, teams, selections, or subsets without caring about internal order. The wording usually involves “choose,” “select,” or “how many different groups.”

Combinations tells you exactly how many distinct groups exist. Nothing more, nothing less.

Breaking Down Combinations Step by Step

You know a problem needs combinations when it asks you to count selections or groups and the order those items are chosen doesn’t create different outcomes. But recognizing the scenario is only the first move. You still need to extract n and r cleanly, apply the formula without sign errors, and verify the result makes sense before comparing to answer choices. Here’s the process that handles it.

Step 1: Read the problem and identify what you’re counting

The first thing you need to do is read through the problem statement and identify whether you’re counting groups (combinations) or arrangements (permutations).

Look for selection language: “choose,” “select,” “pick,” “form a committee,” “how many different groups.” These signal combinations because order doesn’t matter.

Avoid arrangement language: “arrange,” “order,” “sequence,” “rank,” “permute.” These signal permutations because order creates different outcomes.

Once you confirm you’re counting groups, identify the total number of objects you’re selecting from and the number you’re selecting at one time. Write these down as n (total objects) and r (objects selected).

Step 2: Apply the combinations formula

Now that you’ve identified n and r, apply the formula directly: C(n,r) = n! / [(n-r)! × r!]

Write the formula in symbol form first, then substitute your known values for n and r. Don’t skip writing the symbolic form—it catches setup errors before you start calculating.

For example, if n = 8 and r = 3, write C(8,3) = 8! / [(8-3)! × 3!] = 8! / (5! × 3!)

Notice the structure: the denominator contains two factorials. The (n-r)! term simplifies the numerator by canceling out lower factorial terms. The r! term eliminates the duplicates created by reordering the r selected items.

Step 3: Simplify and calculate

With the formula set up correctly, simplify the factorials before calculating the final number.

Expand the numerator factorial only as far as needed to cancel with the denominator. For C(8,3) = 8! / (5! × 3!), recognize that 8! = 8 × 7 × 6 × 5!. The 5! cancels with the 5! in the denominator, leaving 8 × 7 × 6 / 3!.

Now calculate 3! = 6, so the expression becomes (8 × 7 × 6) / 6 = 8 × 7 = 56.

Once you have the numerical result, verify it makes logical sense. For small values of n and r, you can sanity-check by considering whether the count feels reasonable. For C(8,3), 56 combinations means there are 56 distinct ways to select 3 items from 8, which passes a reasonableness test.

Example Problem: Combinations

The workflow handles any combinations problem the FE gives you. Now let’s put these steps into practice on a realistic problem so you can see exactly where to slow down and where to move fast.

Right now, focus on clean structure. Speed comes after a few reps.

This problem states:

Solution: Combinations

When you see a problem asking how many different groups can be selected, the question isn’t whether you can apply a formula—it’s whether the formula you grab accounts for order or not. The uncertainty hits when you’re holding C(n,r) and P(n,r) side by side and you’re not sure if selecting 3 engineers means the r! term stays in the denominator or if it should cancel out because sequence matters.

That’s the fork that burns time. Pick combinations when you need permutations, and your answer is r! times too small. Pick permutations when you need combinations, and you’re counting the same group six different ways.

This is exactly why we use a workflow. It removes the guessing. The structure tells you what to check, what to set up, and what to calculate so you don’t rely on instinct under pressure.

The workflow turns uncertainty into clean execution. Let’s walk through it step by step.

So the final answer to this problem is A) 120.

This tells us there are 120 different groups of 3 engineers that can be selected from the team of 10. Notice that answer choice B (720) is what you’d get if you incorrectly used permutations, which counts each group multiple times based on selection order. Answer choice C is the result of calculating 10! without dividing by anything, which doesn’t apply here. The combinations formula correctly accounts for the fact that order doesn’t matter.

Common Mistakes to Avoid on Combinations Problems

Combinations problems break at the exact moment you see “select 3 from 10” and reach for the permutations formula because your brain defaults to arrangements. You calculate 10! / 7! = 720 instead of 10! / (7! × 3!) = 120, and you’re off by exactly r! because you forgot that reordering ABC doesn’t create a new group. Here’s what actually goes wrong and how to fix it.

Mistake 1: Using permutations formula when order doesn’t matter

This happens when you see selection language but your brain defaults to permutations because you’re used to arrangement problems. You calculate n! / (n-r)! instead of n! / [(n-r)! × r!], which gives you an answer that’s r! times too large.

On the FE, this shows up when the problem says “select 3 from 10” but you calculate 10! / 7! = 720 instead of 10! / (7! × 3!) = 120. The missing r! term means you’re counting ABC, ACB, BAC, BCA, CAB, and CBA as six different outcomes when they’re all the same group.

The result breaks because permutations count arrangements. Combinations count groups. If the problem asks for groups, teams, committees, or selections without caring about order, the answer needs the r! divisor to eliminate reordering duplicates.

Mistake 2: Swapping n and r in the formula

This happens when you misread which number represents the total pool and which represents the selection size. You write C(3,10) instead of C(10,3), which either gives you a nonsensical factorial setup or triggers an error because r > n.

On the FE, this shows up when the problem says “select 3 engineers from a team of 10” but you set n = 3 and r = 10, leading to 3! / [(3-10)! × 10!]. Factorials of negative numbers are undefined, so your calculation breaks immediately.

The result breaks because n must always be greater than or equal to r. You can’t select 10 items from a pool of only 3.

Mistake 3: Forgetting to simplify factorials before calculating

This happens when you try to calculate large factorials directly instead of canceling terms first. You compute 10! = 3,628,800 and 7! = 5,040 separately, then divide, which wastes time and increases the chance of calculator errors.

On the FE, this shows up when you calculate C(10,3) by computing 10! fully instead of recognizing that 10! / 7! = 10 × 9 × 8 after the 7! terms cancel. You’re doing extra arithmetic that doesn’t change the answer but burns seconds and creates more opportunities to miskey.

The result breaks because unnecessary calculation steps slow you down and make errors more likely. Even if you get the right answer, you’ve spent 90 seconds on a problem that should take 30.

Mistake 4: Not verifying the result makes logical sense

This happens when you finish the calculation, see a number, and immediately pick the matching answer choice without checking if it’s reasonable. You get C(8,5) = 56 but don’t notice that selecting 5 from 8 should give the same count as selecting 3 from 8, because choosing 5 to include is the same as choosing 3 to exclude.

On the FE, this shows up when answer choices include both the correct result and common calculation errors. If you miscalculate but don’t verify, you’ll confidently select a trap answer that matches your mistake.

The result breaks because you miss the chance to catch errors before locking in your choice. A quick sanity check—does this count feel too large? Too small? Does it match a symmetry I expect?—would flag the problem.

Rules of Thumb for Combinations Problems on the FE

You know how to identify selection language and set up C(n,r) correctly now. These rules are what keep (10-3)! from becoming 7 in your head and what stop you from forgetting the r! term when you’re moving fast and the answer choices include both 120 and 720.

• “Select” means combinations, “arrange” means permutations: When the problem uses selection language like “choose,” “select,” “pick,” or “form a committee,” that’s your signal order doesn’t matter and you need combinations. When you see arrangement language like “arrange,” “order,” “sequence,” or “rank,” order matters and you need permutations. The word choice in the problem statement tells you which formula to use before you start calculating.
• n is always the total pool, r is always the selection size: Before substituting into C(n,r), write down which number represents how many objects exist total and which represents how many you’re selecting. If the problem says “select 3 from 10,” n = 10 and r = 3. If you ever set up r > n, you’ve swapped them. This catches setup errors before they turn into calculation errors.
• Cancel factorials before calculating: When you write n! / [(n-r)! × r!], don’t compute n! fully. Recognize that n! / (n-r)! simplifies to n × (n-1) × (n-2) × … × (n-r+1). For C(10,3) = 10! / (7! × 3!), cancel the 7! immediately to get (10 × 9 × 8) / 3!. This keeps arithmetic manageable and reduces calculator errors.
• Use symmetry to verify: Remember that C(n,r) = C(n, n-r). Selecting 3 from 10 gives the same count as selecting 7 from 10, because choosing 3 to include is equivalent to choosing 7 to exclude. If your calculation for C(10,3) and C(10,7) gives different results, you’ve made an error. This symmetry gives you a built-in check for any problem.
• Verify r ≤ n before calculating: You can’t select more items than exist in the pool. If your problem setup gives you r > n, you’ve misread the problem or swapped n and r. Catch this before substituting into the formula. Factorials of negative numbers are undefined, so any setup leading to (n-r)! with n < r breaks immediately.
• Check if the answer makes logical sense: After calculating C(10,3) = 120, ask yourself if the count feels reasonable. You’re selecting 3 from 10, which should give a moderate number of groups. If your result seems wildly off for the size of n and r, recheck your arithmetic and formula setup before selecting an answer choice.

You know how to identify combinations scenarios, set up n and r correctly, and apply the formula without calculation errors. These rules keep you from second-guessing your setup or missing errors that turn easy problems into missed points.

Final Thoughts | Combinations

The counterintuitive thing about combinations is that the hardest part isn’t the math—it’s recognizing when the math applies at all.

Most students see “select 3 engineers from 10” and immediately start worrying about factorials, when the actual decision that determines whether they get the point happens in the first 5 seconds: does the order I select them create different outcomes?

Answer that wrong—grab permutations when you need combinations—and you’ll calculate 720, confidently circle B, and miss an easy point because you counted the same group six different ways.

That’s why the workflow starts with recognition, not calculation. It forces you to identify selection language before you touch a formula. “Choose,” “select,” “form a committee”—those words tell you order doesn’t matter before you’ve written a single factorial.

Once you’ve made that call, the rest is mechanical. Set up n and r. Cancel the factorials that simplify. Verify the result makes sense using symmetry. The formula does the counting—you just need to make sure you’re counting the right thing.

The students who nail combinations problems aren’t faster at arithmetic. They’re faster at recognizing that ABC and BAC are the same group. That recognition is what the workflow builds. After a few reps, you stop second-guessing whether order matters because the problem wording tells you directly.

Want more practice? Our full FE problem library is here.

You know what’s draining your prep time right now?

It’s not the hard problems. It’s the uncertainty—scrolling through practice sets wondering which topics actually show up, which problems are worth your time, and whether the hours you’re putting in are building confidence or just keeping you busy.

That uncertainty is what turns eight weeks of prep into eight weeks of hoping you’re studying the right things. Prepineer removes all that.

In Prepineer, you get a personalized roadmap that tells you exactly what to study and when, targeted practice on the topics that matter most, and real coaching when you’re stuck—so every hour you invest moves you closer to passing instead of just filling time. Start your free 7-day trial and see what focused prep feels like.