Home / Learn / Exam prep / GMAT prep / Lesson 5.3
All lessons

Module 5: Statistics, counting and probability · Lesson 5.3 · about 16 min

Counting: arrangements and choices

The multiplication principle, arrangements (permutations) when order matters, choices (combinations) when it does not, repeated items, and restrictions such as people who must sit together, with a branching tree figure.

Key points, meanings and formulas on one page: choose "Save as PDF" in the print box.

Module 5 · about 16 minutes. By the end you will decide in seconds whether order matters and count any arrangement or choice.

Count by filling places one at a time and multiplying the choices. If order does not matter, divide out the orders you counted more than once.

1. The multiplication principle

Each choice branches. The number of leaves is the product of the choices at each step.

If one decision has a options and another has b, together there are a × b outcomes. “And” multiplies; “or” (one route or another, with no overlap) adds.

2. Arrangements: order matters

Arranging n different things in a row: n! = n × (n − 1) × … × 1. 5 people in 5 chairs: 120 ways.

Choosing and arranging k of n (president, then vice-president): n × (n − 1) × … (k numbers), written P(n, k) = n! ÷ (n − k)!.

3. Choices: order does not matter

A team, a committee or a hand of cards has no order. Count as if order mattered, then divide by the k! orders of each group:

C(n, k) = n! ÷ (k!(n − k)!)

Ordered: 7 × 6 × 5 = 210.
Each team of 3 was counted 3! = 6 times (ABC, ACB, BAC, …).
Teams: 210 ÷ 6 = 35.

How to tell: swap two people. If it is a different outcome (different jobs, different seats), order matters. If it is the same team, it does not.

“Choosing 2 from 6 is 6 × 5 = 30.” That counts “Ana then Ben” and “Ben then Ana” as different. For a team they are the same, so divide by 2: 15.

4. Repeated items

Arrangements of a word with repeated letters: divide by the factorial of each repeat count. BANANA: 6! ÷ (3! × 2!) = 60.

5. Restrictions

  • Must be together: glue them into one block, arrange the blocks, then multiply by the arrangements inside the block.
  • Must not be together: total arrangements minus the “together” ones.
  • A fixed position or a banned digit: fill the restricted place first.
  • “And” multiplies; separate cases add.
  • n things in a row: n!. Ordered choice of k from n: n(n − 1)…, k numbers.
  • Unordered choice: C(n, k) = n!/(k!(n − k)!).
  • Swap test: if swapping two picks changes the outcome, order matters.
  • Repeats: divide by the factorial of each repeat. Together: glue into a block. Not together: total − together.

Practise: GMAT-style questions on this lesson

Each set is new every time: the numbers change, so you can practise as often as you like. They start easy and get harder. Answer, check, then read the full solution and the trap note.

Check yourself

1How many ways can 4 books be arranged on a shelf?
2How many ways can you choose 2 people from 6 for a team?
3How many arrangements of the letters in ADD?

Sources

Your ticks stay in this browser. Save them as a file on the course home.

Updated 2026-11-22. Independent free course, not part of or endorsed by GMAC. GMAT is a trademark of the Graduate Management Admission Council. Every question here is original. Test rules change: check mba.com before you book.