Probability and counting questions on the GMAT Focus Edition come down to a handful of rules: multiply for "and," add for "or," use the complement for "at least one," and decide whether order matters before you count. This guide covers each rule, the traps the answer choices are built around, six fully worked Problem Solving examples, and four practice questions.
GMAC lists "probability rules and combinatorics" among the topics in Quantitative Reasoning, and the Official Guide's math review has a section on statistics, sets, counting, probability, estimation, and series. On the Focus Edition these topics appear only in the Quant section, which has 21 Problem Solving questions in 45 minutes, five answer choices each, and no calculator. Focus Quant has no geometry and no Data Sufficiency (Data Sufficiency now sits in Data Insights). The GMAT Quantitative Reasoning overview covers the rest of the section.
GMAC doesn't publish how many questions come from each topic, so treat probability and counting as one topic among many: worth learning well, not worth months on its own. The good news is that the tested material is narrow. Nearly every question uses the ideas in this table.
| Idea | How the question signals it | Core tool |
|---|---|---|
| Basic probability | "chosen at random," equally likely outcomes | favorable outcomes ÷ total outcomes |
| Independent events (AND) | coins, dice, "with replacement," separate machines | multiply the probabilities |
| Dependent events (AND) | "without replacement," drawing people or items one after another | multiply, updating each fraction |
| Either/or (OR) | "A or B" | add, then subtract the overlap if both can happen |
| At least one | "at least one," "one or more" | 1 − P(none) |
| Counting principle | codes, outfits, routes, stages of a choice | multiply the options at each stage |
| Permutations | order matters: rankings, seats, codes, officer roles | nPk = n! ÷ (n − k)! |
| Combinations | order doesn't matter: committees, teams, handshakes | nCk = n! ÷ (k!(n − k)!) |
| Restrictions | "must sit together," "can't be first," "at least one analyst" | glue items into a block, fill the restricted spot first, or count the complement |
Probability is a number from 0 (impossible) to 1 (certain). When every outcome is equally likely, P(event) = favorable outcomes ÷ total outcomes. Everything else is a way of combining events.
| Rule | Formula | Use it when |
|---|---|---|
| Complement (NOT) | P(not A) = 1 − P(A) | The question says "at least one," or "not" is easier to count |
| AND, independent | P(A and B) = P(A) × P(B) | One event doesn't change the other (coin flips, dice, with replacement) |
| AND, dependent | P(A and B) = P(A) × P(B given A) | The first draw changes what's left (without replacement) |
| OR, can't both happen | P(A or B) = P(A) + P(B) | A and B are mutually exclusive (one die roll can't be both 2 and 5) |
| OR, can both happen | P(A or B) = P(A) + P(B) − P(A and B) | Outcomes can belong to both groups (multiples of 3 or 5) |
For a question such as "two marbles are drawn without replacement; what is the probability both are red?" you can multiply step by step (4/10 × 3/9) or count groups (red pairs ÷ all pairs, using combinations). Both give the same answer. Step-by-step multiplication is usually faster when the question names an order or a small number of draws; counting with combinations is cleaner when the question asks for "exactly 2 of 3" or mixes groups.
If you multiply probabilities for "exactly two women out of three," the product 4/10 × 3/9 × 6/8 covers only one order (woman, woman, man). There are three orders, so multiply by 3. Forgetting that factor is one of the most common wrong answers. Worked Example 6 shows both methods.
Counting questions ask "how many ways?" Start with the counting principle: if a choice happens in stages, multiply the number of options at each stage. A code with 3 letters followed by 2 digits has 26 × 26 × 26 × 10 × 10 possibilities. Permutations and combinations are shortcuts for the special case of choosing k items from n distinct items without repeats.
| Situation | Formula | Example |
|---|---|---|
| Arrange all n distinct items | n! | 5 books on a shelf: 5! = 120 |
| Choose k of n, order matters | nPk = n! ÷ (n − k)! | President and VP from 8 people: 8 × 7 = 56 |
| Choose k of n, order doesn't matter | nCk = n! ÷ (k!(n − k)!) | 3-person team from 7 people: 7C3 = 35 |
| Arrange items with repeats | n! ÷ (a! × b! × …) | Letters of LEVEL: 5! ÷ (2! × 2!) = 30 |
| Choose from two groups | multiply the separate counts | 2 of 4 analysts and 1 of 5 managers: 6 × 5 = 30 |
Pick two items in a possible selection and swap them. If the swap produces a different outcome (Ana as president and Ben as VP is different from the reverse), order matters, so use a permutation. If the swap produces the same outcome (a committee of Ana and Ben is the same committee either way), use a combination. Notice that 8P3 = 336 and 8C3 = 56: the permutation count is 3! = 6 times larger because each group of three can be ordered six ways.
Quant has no calculator, so cancel before you multiply (8C3 = (8 × 7 × 6) ÷ (3 × 2 × 1) = 56) and know the small values: 4! = 24, 5! = 120, 6! = 720, 7! = 5,040; 5C2 = 10, 6C2 = 15, 6C3 = 20, 7C3 = 35, 8C3 = 56, 9C3 = 84, 10C3 = 120. Also remember nCk = nC(n − k), so 10C7 = 10C3. The GMAT math formulas cheat sheet has these alongside the other Quant formulas.
Wrong answer choices are usually the result of a specific, predictable mistake. These are the ones to check for before you click.
| Trap | What it looks like | Fix |
|---|---|---|
| Treating a draw as independent | Using 4/10 × 4/10 when marbles aren't replaced | Reduce the numerator and denominator after each draw |
| Ordering a group | Counting a 3-person committee as 9 × 8 × 7 | Divide by 3! or use 9C3 |
| Adding instead of using the complement | "At least one fails" = 0.1 + 0.1 + 0.1 | 1 − P(none fail) |
| Double-counting an overlap | Multiples of 3 or 5: 10 + 6 = 16 out of 30 | Subtract the numbers counted twice (multiples of 15) |
| Missing the orders in "exactly" | Exactly 2 of 3 = one product with no multiplier | Multiply by the number of orders, or count with combinations |
| Answering a different question | Finding "exactly one" when asked "at least one" | Reread the question stem before choosing |
The overlap trap is the same idea that drives two-group Venn questions; the GMAT overlapping sets guide covers that format in depth.
Each example is in the Focus Quant format: a Problem Solving question with five answer choices. Try it before you read the solution.
Worked Example 1 — Without replacement
A jar contains 4 red marbles and 6 blue marbles. Two marbles are drawn at random without replacement. What is the probability that both marbles are red?
Solution
Worked Example 2 — At least one (complement)
Each part made by a machine passes inspection with probability 0.9, independently of every other part. If 3 parts are inspected, what is the probability that at least one of them fails?
Solution
Worked Example 3 — Or, with overlap
An integer is chosen at random from the integers 1 through 30, inclusive. What is the probability that it is a multiple of 3 or a multiple of 5?
Solution
Worked Example 4 — Combinations with "at least one"
A 3-person committee is to be chosen from 5 managers and 4 analysts. How many different committees include at least 1 analyst?
Solution
Worked Example 5 — Arrangement with a "together" restriction
Five people, including Ana and Ben, are to be seated in a row of 5 chairs. In how many different arrangements are Ana and Ben seated next to each other?
Solution
Worked Example 6 — Probability by counting ("exactly")
A group consists of 6 men and 4 women. If 3 people are selected at random from the group, what is the probability that exactly 2 of the people selected are women?
Solution
Choose an answer, then check it. Each explanation names the trap behind the most tempting wrong choice. For full timed sets across every Quant topic, use the GMAT quantitative practice questions.
Yes. GMAC lists probability rules and combinatorics among the Quantitative Reasoning topics, and the Official Guide's math review covers counting and probability. On the Focus Edition these appear only as Problem Solving questions in the Quant section (21 questions, 45 minutes, no calculator). GMAC does not publish how many questions come from each topic.
Ask whether order matters. Swap two of the chosen items: if the swap creates a different outcome (a different ranking, seating, or code), use a permutation, nPk = n!/(n − k)!. If it is the same outcome (the same committee or group), use a combination, nCk = n!/(k!(n − k)!).
Use the complement: P(at least one) = 1 − P(none). Working out "exactly one," "exactly two," and so on separately is slower and easier to get wrong.
The counting principle (multiply the choices at each stage), nPk = n!/(n − k)!, nCk = n!/(k!(n − k)!), n!/(a!b!...) for arrangements with repeated items, and the probability rules: multiply for AND (adjusting for dependence), add for OR (subtracting any overlap), and 1 − P(A) for NOT. Because Quant has no calculator, also know small factorials such as 5! = 120 and 6! = 720.