Scribe logoScribeNotes & practice
Sign inStart free
  1. Notes
  2. ›IB Mathematics: Analysis and Approaches
  3. ›1 Number and algebra
  4. ›1.10 Counting principles

IB Mathematics: Analysis and Approaches · Topic 1 · Number and algebra

1.10 Counting principles

Count outcomes using the fundamental principle, factorials, permutations and combinations, and decide whether order matters.

  • 4 min read
  • 5 parts
  • 10 questions
  • Draft
  • HL only
Start a Quick 5 on this topic→Jump to the 10 questions
1/5Independent choices multiply to give the total count
  1. 1Independent choices multiply to give the total count
  2. 2Factorials count the ways to arrange distinct objects
  3. 3Permutations count ordered selections from a larger group
  4. 4Combinations ignore order, so they divide out repeats
  5. 5Problems combine the principles and may add restrictions
  6. Check your recall
  7. Practice: 10 questions
1

Part 1 of 5: Independent choices multiply to give the total count

A café offers 3 sandwiches and 4 drinks. A lunch is one of each. Every sandwich pairs with any of the 4 drinks, so there are 3×4=123\times4=123×4=12 lunches.

This is the fundamental principle of counting. If one task has mmm ways and a second has nnn ways, together they have m×nm\times nm×n ways. The rule extends to any number of tasks. A 3-digit code with repeats allowed has 10×10×10=100010\times10\times10=100010×10×10=1000 possibilities.

Sometimes the tasks are alternatives, not steps. If only one of two non-overlapping tasks happens, the addition principle applies and the ways add: m+nm+nm+n.

Common mistake

Multiply for “and”, when one task follows another. Add for “or”, when one task replaces the other.

Key terms · tap one for its definition

fundamental principle of counting

The fundamental principle of counting states that tasks done in sequence, with mmm and nnn ways, can be done in m×nm\times nm×n ways.

addition principle

The addition principle states that if two tasks cannot both happen, the ways to do one or the other number m+nm+nm+n.

Part 1 done

2

Part 2 of 5: Factorials count the ways to arrange distinct objects

Now suppose different objects must stand in a line. Five books go on a shelf. There are 5 choices for the first place, then 4 for the second, and so on. The total is 5×4×3×2×15\times4\times3\times2\times15×4×3×2×1.

This product is the factorial of 5, written 5!=1205!=1205!=120. In general, n!n!n! counts the arrangements of nnn distinct objects in a line. By definition 0!=10!=10!=1, because there is one way to arrange nothing.

Factorials grow quickly, so cancel before calculating. For example, 8!6!=8×7×6!6!=56\frac{8!}{6!}=\frac{8\times7\times6!}{6!}=566!8!​=6!8×7×6!​=56.

Common mistake

Factorials do not divide like ordinary numbers. The value of 8!6!\frac{8!}{6!}6!8!​ is 8×78\times78×7, not 86\frac{8}{6}68​ and not 2!2!2!.

Key term

factorial

The factorial n!n!n! is the product of all positive integers up to nnn, with 0!=10!=10!=1.

Part 2 done

Quick check

One question on the part you just read

Easy

Calculate 5!5!5!.
Show answer and explanation

Answer: B · Worked explanation

The factorial 5!5!5! is 5×4×3×2×1=1205\times4\times3\times2\times1=1205×4×3×2×1=120. The value 25 comes from squaring 5, and 15 comes from adding the integers from 1 to 5. The value 60 is 5!2\frac{5!}{2}25!​, which would only appear if a factor of 2 were removed. Each step multiplies by the next smaller integer until the product reaches 1.
3

Part 3 of 5: Permutations count ordered selections from a larger group

Usually only some of the objects are arranged. Eight runners race, and gold, silver and bronze go to three of them. There are 8 choices for gold, then 7 for silver, then 6 for bronze. That gives 8×7×6=3368\times7\times6=3368×7×6=336 outcomes.

Order matters here, because gold and silver are different prizes. A permutation is an ordered arrangement of rrr objects chosen from nnn distinct objects. Their number is nPr=n!(n−r)!^nP_r=\frac{n!}{(n-r)!}nPr​=(n−r)!n!​. Dividing by (n−r)!(n-r)!(n−r)! removes the places that are not used.

Worked example

Count ordered codes

A code uses 4 different letters taken from A, B, C, D, E and F. Calculate the number of possible codes.
  1. 1
    Order matters, so use nPr=n!(n−r)!^nP_r=\frac{n!}{(n-r)!}nPr​=(n−r)!n!​ with n=6n=6n=6 and r=4r=4r=4.
  2. 2
    Substitute: 6P4=6!2!^6P_4=\frac{6!}{2!}6P4​=2!6!​.
  3. 3
    Cancel: 6!2!=6×5×4×3=360\frac{6!}{2!}=6\times5\times4\times3=3602!6!​=6×5×4×3=360.

Answer: There are 360 possible codes.

Exam tip

Words such as “ranked”, “in order” or “different roles” signal a permutation. Say so in your working.

Key term

permutation

A permutation is an ordered arrangement of rrr objects chosen from nnn distinct objects, and there are n!(n−r)!\frac{n!}{(n-r)!}(n−r)!n!​ of them.

Part 3 done

4

Part 4 of 5: Combinations ignore order, so they divide out repeats

Now suppose the three runners are picked for a relay team with no ranking. Each team appears in 3!=63!=63!=6 different orders in the permutation count. So divide: 3366=56\frac{336}{6}=566336​=56 teams. A smaller case shows the same effect. Choosing 2 of 3 letters gives 6 ordered pairs but only 3 unordered pairs.

A combination is a selection of rrr objects from nnn distinct objects in which order does not matter. Their number is (nr)=n!r! (n−r)!\binom{n}{r}=\frac{n!}{r!\,(n-r)!}(rn​)=r!(n−r)!n!​, the same coefficient that appears in binomial expansions.

Choosing the rrr objects to take is the same as choosing the n−rn-rn−r to leave. So (nr)=(nn−r)\binom{n}{r}=\binom{n}{n-r}(rn​)=(n−rn​), which can shorten a calculation.

Worked example

Count unordered groups

A teacher picks 3 volunteers from 12 pupils. Calculate the number of possible groups.
  1. 1
    Order does not matter, so use (nr)=n!r! (n−r)!\binom{n}{r}=\frac{n!}{r!\,(n-r)!}(rn​)=r!(n−r)!n!​ with n=12n=12n=12 and r=3r=3r=3.
  2. 2
    Substitute: (123)=12!3! 9!\binom{12}{3}=\frac{12!}{3!\,9!}(312​)=3!9!12!​.
  3. 3
    Cancel: 12×11×103×2×1=13206=220\frac{12\times11\times10}{3\times2\times1}=\frac{1320}{6}=2203×2×112×11×10​=61320​=220.

Answer: There are 220 possible groups.

Permutations compared with combinations

FeaturePermutationCombination
OrderMattersDoes not matter
Formulan!(n−r)!\frac{n!}{(n-r)!}(n−r)!n!​n!r! (n−r)!\frac{n!}{r!\,(n-r)!}r!(n−r)!n!​
Typical wordingranked, in order, roleschosen, group, team
Eight runners, three places33656
Feature
Order
Permutation
Matters
Combination
Does not matter
Feature
Formula
Permutation
n!(n−r)!\frac{n!}{(n-r)!}(n−r)!n!​
Combination
n!r! (n−r)!\frac{n!}{r!\,(n-r)!}r!(n−r)!n!​
Feature
Typical wording
Permutation
ranked, in order, roles
Combination
chosen, group, team
Feature
Eight runners, three places
Permutation
336
Combination
56

Key term

combination

A combination is a selection of rrr objects from nnn distinct objects in which order does not matter, counted by (nr)\binom{n}{r}(rn​).

Part 4 done

Quick check

One question on the part you just read

Easy

A shop sells 4 shirts and 3 hats. Calculate the number of ways to choose one shirt and one hat.
Show answer and explanation

Answer: A · Worked explanation

Choosing a shirt and then a hat are two tasks done together, so the ways multiply: 4×3=124\times3=124×3=12. The value 7 comes from adding, which applies only when one task replaces the other. The value 24 is 4!4!4!, which counts arrangements, not choices.
5

Part 5 of 5: Problems combine the principles and may add restrictions

Real problems mix these ideas, so plan the steps before calculating. To choose 2 men from 5 and 2 women from 4, treat the two choices as steps. Multiply the combinations: (52)×(42)=10×6=60\binom{5}{2}\times\binom{4}{2}=10\times6=60(25​)×(24​)=10×6=60.

Some objects may have to stay together. Glue them into one block. Arrange the blocks, then arrange the objects inside the block. Five people in a row with two particular people together give 4!×2!=484!\times2!=484!×2!=48 arrangements.

Other rules are easier to handle by subtraction. Count all the arrangements, then remove those that break the rule.

Exam tip

For “not together” or “at least one”, find the total and subtract the opposite case. This is usually shorter than listing every allowed case.

Note read

Check your recall[15 marks]

6 written questions. Answer each one in your head or on paper, then open the mark scheme.

  1. 1.State[2 marks]

    State the fundamental principle of counting.

    Show mark schemeHide mark scheme

    Model answer

    If one task can be done in mmm ways and a second task in nnn ways, the two tasks together can be done in m×nm\times nm×n ways.

    • 1 mark for stating that the tasks are done one after the other
    • 1 mark for stating that the number of ways is the product m×nm\times nm×n
  2. 2.Calculate[2 marks]

    Calculate 9!7!\frac{9!}{7!}7!9!​.

    Show mark schemeHide mark scheme

    Model answer

    9!7!=9×8×7!7!=9×8=72\frac{9!}{7!}=\frac{9\times8\times7!}{7!}=9\times8=727!9!​=7!9×8×7!​=9×8=72.

    • 1 mark for cancelling 7!7!7! from the numerator and denominator
    • 1 mark for obtaining 72
  3. 3.Distinguish[2 marks]

    Distinguish between a permutation and a combination.

    Show mark schemeHide mark scheme

    Model answer

    A permutation counts selections in which order matters. A combination counts selections in which order does not matter.

    • 1 mark for stating that order matters in a permutation
    • 1 mark for stating that order does not matter in a combination
  4. 4.Calculate[3 marks]

    Calculate the number of ways a club of 10 members can choose a president, a secretary and a treasurer, each a different member.

    Show mark schemeHide mark scheme

    Model answer

    The roles are different, so order matters. 10P3=10!7!=10×9×8=720^{10}P_3=\frac{10!}{7!}=10\times9\times8=72010P3​=7!10!​=10×9×8=720.

    • 1 mark for recognising that order matters, so using a permutation
    • 1 mark for substituting into n!(n−r)!\frac{n!}{(n-r)!}(n−r)!n!​ or writing 10×9×810\times9\times810×9×8
    • 1 mark for obtaining 720
  5. 5.Determine[3 marks]

    Determine the number of ways to choose a team of 4 students from 9 students.

    Show mark schemeHide mark scheme

    Model answer

    Order does not matter. (94)=9!4! 5!=9×8×7×64×3×2×1=126\binom{9}{4}=\frac{9!}{4!\,5!}=\frac{9\times8\times7\times6}{4\times3\times2\times1}=126(49​)=4!5!9!​=4×3×2×19×8×7×6​=126.

    • 1 mark for recognising that order does not matter, so using a combination
    • 1 mark for substituting into n!r! (n−r)!\frac{n!}{r!\,(n-r)!}r!(n−r)!n!​
    • 1 mark for obtaining 126
  6. 6.Deduce[3 marks]

    Deduce the number of ways to arrange 6 people in a row if two particular people must sit together.

    Show mark schemeHide mark scheme

    Model answer

    Treat the pair as one block, giving 5 objects to arrange in 5!=1205!=1205!=120 ways. The pair can swap places in 2!=22!=22!=2 ways. The total is 120×2=240120\times2=240120×2=240.

    • 1 mark for treating the two people as one block and arranging 5 objects
    • 1 mark for multiplying by 2!2!2! for the order within the block
    • 1 mark for obtaining 240

Practice this topic

10 quick-fire multiple-choice questions, easy to hard. Tap an answer to see if you're right and the worked explanation. (The written questions with mark schemes are under “Check your recall” above.)

0 right0 of 10 answered

Includes the 2 quick checks in the note above.

3.

Easy·Calculate[1 mark]

Calculate (72)\binom{7}{2}(27​).
Show answer and explanation

Answer: C · Worked explanation

Order does not matter, so (72)=7×62×1=21\binom{7}{2}=\frac{7\times6}{2\times1}=21(27​)=2×17×6​=21. The value 42 is 7×67\times67×6, the permutation count, which forgets to divide by 2!2!2!. The value 14 comes from multiplying 7 by 2, and 49 comes from squaring 7. Dividing by 2!2!2! removes the repeated orders of each chosen pair.
4.

Medium·Calculate[2 marks]

A PIN has 4 different digits chosen from 0 to 9. Calculate the number of possible PINs.
Show answer and explanation

Answer: D · Worked explanation

The digits cannot repeat, so there are 10×9×8×7=504010\times9\times8\times7=504010×9×8×7=5040 PINs. The value 10 000 allows repeated digits. The value 210 is (104)\binom{10}{4}(410​), which ignores order, although a PIN such as 1234 differs from 4321. The value 40 comes from multiplying 10 by 4 instead of multiplying the decreasing numbers of choices.
5.

Medium·Calculate[2 marks]

A coach chooses 3 players from 10 for a relay team, with no order. Calculate the number of possible teams.
Show answer and explanation

Answer: A · Worked explanation

Order does not matter, so (103)=10×9×83×2×1=120\binom{10}{3}=\frac{10\times9\times8}{3\times2\times1}=120(310​)=3×2×110×9×8​=120. The value 720 is the permutation count, which treats the same team in different orders as different. The value 30 comes from multiplying 10 by 3, and 1000 comes from allowing repeats. Ask whether swapping two chosen players gives a new outcome. For a team it does not.
6.

Medium·Determine[2 marks]

The letters P, R, I, S and M are all different. Determine how many arrangements of all five letters begin with P.
Show answer and explanation

Answer: C · Worked explanation

Fixing P in first place leaves 4 different letters for the remaining 4 places, so there are 4!=244!=244!=24 arrangements. The value 120 is 5!5!5!, which counts every arrangement without fixing the first letter. The value 20 is 5×45\times45×4, which stops the product too early.
7.

Medium[2 marks]

Simplify n!(n−2)!\frac{n!}{(n-2)!}(n−2)!n!​ for an integer n≥2n\ge2n≥2.
Show answer and explanation

Answer: B · Worked explanation

Write n!=n(n−1)(n−2)!n!=n(n-1)(n-2)!n!=n(n−1)(n−2)!, then cancel (n−2)!(n-2)!(n−2)! to leave n(n−1)n(n-1)n(n−1). The expression n(n−1)2\frac{n(n-1)}{2}2n(n−1)​ is (n2)\binom{n}{2}(2n​), which has an extra division by 2!2!2!. The expression n2n^2n2 comes from treating the cancellation as if every factor were nnn. Cancelling a shared factorial is quicker than writing out both products.
8.

Hard·Calculate[2 marks]

A panel has 3 boys chosen from 6 and 2 girls chosen from 5, with order ignored. Calculate the number of possible panels.
Show answer and explanation

Answer: D · Worked explanation

Choose the boys and the girls in two steps and multiply: (63)×(52)=20×10=200\binom{6}{3}\times\binom{5}{2}=20\times10=200(36​)×(25​)=20×10=200. The value 462 is (115)\binom{11}{5}(511​), which ignores the rule on boys and girls. The value 30 comes from adding 20 and 10, and 1200 uses permutations for the boys.
9.

Hard·Calculate[2 marks]

Seven people sit in a row. Calculate the number of arrangements in which two particular people are not next to each other.
Show answer and explanation

Answer: A · Worked explanation

All arrangements number 7!=50407!=50407!=5040. Arrangements with the pair together number 6!×2!=14406!\times2!=14406!×2!=1440. Subtracting gives 5040−1440=36005040-1440=36005040−1440=3600. The value 1440 is the count with the pair together, so it answers the opposite question. The value 5040 ignores the restriction. Subtracting is easier than listing every allowed seating.
10.

Hard·Determine[2 marks]

For some integer nnn, nP3=210^nP_3=210nP3​=210. Determine the value of (n3)\binom{n}{3}(3n​).
Show answer and explanation

Answer: C · Worked explanation

Each combination of 3 objects appears in 3!=63!=63!=6 orders in the permutation count, so (n3)=2106=35\binom{n}{3}=\frac{210}{6}=35(3n​)=6210​=35. The value 105 comes from dividing by 2, and 70 from dividing by 3, so neither removes all the orderings. The value 1260 multiplies by 6 instead of dividing.

Keep going

Next topic1.11 Partial fractionsPrevious topic1.9 The binomial theorem

More in Topic 1 · Number and algebra

  1. 1.6Simple deductive proofNotes · 10 questions
  2. 1.7Laws of exponents and logarithmsNotes · 10 questions
  3. 1.8Infinite geometric seriesNotes · 10 questions
  4. 1.9The binomial theoremNotes · 10 questions
  5. 1.10Counting principlesNotes · 10 questions· HL only
  6. 1.11Partial fractionsNotes · 10 questions· HL only
  7. 1.12Complex numbersNotes · 10 questions· HL only
  8. 1.13Polar and Euler formNotes · 10 questions· HL only
  9. 1.14Complex roots and De Moivre's theoremNotes · 10 questions· HL only

All IB Mathematics: Analysis and Approaches topics →

Draft: written by Scribe and checked automatically, not yet by a subject reviewer.

Practice questions are original, written by Scribe and checked automatically for correctness.

Topic codes follow the official numbering. Not endorsed by IB Diploma Programme or any exam board.

On this page

0/5 read

  1. 1Independent choices multiply to give the total count
  2. 2Factorials count the ways to arrange distinct objects
  3. 3Permutations count ordered selections from a larger group
  4. 4Combinations ignore order, so they divide out repeats
  5. 5Problems combine the principles and may add restrictions
  6. Check your recall
  7. Practice: 10 questions
All coursesScribeHow it worksPricingPrivacyTerms

Notes and questions are written by Scribe in our own words. Topic codes follow the official course numbering so you can find your place. Not produced or endorsed by the IB, College Board, AQA, OCR, Pearson Edexcel or any exam board.

© 2026 Scribe