Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14A

1.
a. The number of ways to form a queue with 8 people.
 Number of choices for the first place = 8
Number of choices for the second place = 7
Number of choices for the third place = 6
Similarly, number of choices for the nth place = (8 – n + 1)
Total number of possible choices = 8×7×6×5×4×3×2×1 = 8! (= 40320)

b. Number of ways to arrange 4 distinct books on a bookshelf.

 Number of choices for the 1st place = 4
Number of choices for the 2nd place = 3
Number of choices for the 3rd place = 2
Number of choices for the 4th place = 1
Total number of choices = 4×3×2×1 = 4! (= 24)

c. The number of ways 3 particular people can be placed first, second and third in a
competition, assuming that each is placed in one of these three positions.
 Choices for 1st position = 3
Choices for 2nd position = 2
Choices for 3rd position = 1
Total number of possible arrangements = 3×2×1 = 3! (= 6)

d.
 Given that all keys are interchangeable, any key can be placed at any position.
So, every nth key will have (101 – n + 1) options.
Hence, total number of possibilities = 101!

e.
 No ordering restrictions for the roll calls.
Total number of students = 20
So, every nth roll call will have (20 – n + 1) choices.
Hence, total number of ways = 20!
2.
i. 3! = 3×2×1 = 6

ii. 5! = 5×4×3×2×1 = 120

iii. 1! = 1
15! 15×14!
iv. = = 15
14! 14!

10! 10×9×8! 10×9

v. = = = 45
8!×2! 8!×2! 2×1

© Cambridge University Press 2019 1

Chapter 14 – Combinatorics – Worked solutions

15! 15×14×13! 15×14

vi. = = 3×2×1 = 35
13!×3! 13!×3!

12! 12×11×10×9! 12×11×10

vii. = = = 220
3!×9! 3!×9! 3×2×1

8! 8×7×6×5×4! 8×7×6×5
viii. = = 4×3×2×1 = 70
4!×4! 4!×4!

3.
i. 7! = 5040

ii. 10! = 3628800

iii. 0! = 1

9!
iv. = 15120
4!

8!
v. = 6720
3!

10!
vi. = 2520
5!×3!×2!

15!
vii. = 5005
3!×5!×9!

12!
viii. = 13860
2!×3!×4!×5!

4. 𝑓(𝑥) = 𝑥 6
i. 𝑓 ′ (𝑥) = 6𝑥 5

ii. 𝑓 ′′ (𝑥) = 6×5𝑥 4 = 30𝑥 4

iii. 𝑓 ′′′ (𝑥) = 6×5×4𝑥 3 = 120𝑥 3

iv. 𝑓 4 (𝑥) = 6×5×4×3𝑥 2 = 360𝑥 2

v. 𝑓 5 (𝑥) = 6×5×4×3×2𝑥 = 720𝑥

vi. 𝑓 6 (𝑥) = 6×5×4×3×2×1 = 6! = 720

vii. 𝑓 7 (𝑥) = 0

© Cambridge University Press 2019 2

Chapter 14 – Combinatorics – Worked solutions

5.
𝑛! 𝑛×(𝑛−1)!
i. (𝑛−1)!
= (𝑛−1)!
=𝑛

ii. 𝑛×(𝑛 − 1)! = 𝑛!

𝑛(𝑛−1)! 𝑛!
iii. = =1
𝑛! 𝑛!

(𝑛+1)! (𝑛+1)×𝑛×(𝑛−1)!
iv. (𝑛−1)!
= (𝑛−1)!
= (𝑛 + 1)𝑛 = 𝑛2 + 𝑛

(𝑛+2)! (𝑛+2)×(𝑛+1)×𝑛!
v. = = (𝑛 + 1)×(𝑛 + 2) = 𝑛2 + 3𝑛 + 2
𝑛! 𝑛!

(𝑛−2)! (𝑛−2)! 1 1
vi. = 𝑛×(𝑛−1)×(𝑛−2)! = 𝑛(𝑛−1) = 𝑛2 −𝑛
𝑛!

(𝑛−2)!×(𝑛−1)! (𝑛−2)×(𝑛−3)!×(𝑛−1)! 𝑛−2

vii. = =
𝑛!×(𝑛−3)! 𝑛×(𝑛−1)!×(𝑛−3)! 𝑛

𝑛!(𝑛−1)! 𝑛!(𝑛−1)! (𝑛−1)!

viii. (𝑛+1)!
= (𝑛+1)×𝑛! = 𝑛+1

6.
a. 8! − 7! = 8×7! − 7! = 7! (8 − 1) = 7×7! = 49×6!

b. (𝑛 + 1)! − 𝑛! = (𝑛 + 1)×𝑛! − 𝑛! = 𝑛! ((𝑛 + 1) − 1) = 𝑛×𝑛! = 𝑛2 (𝑛 − 1)!

c. 8! + 6! = 8×7×6! + 6! = 6! (56 + 1) = 57×6!

d. (𝑛 + 1)! + (𝑛 − 1)! = (𝑛 + 1)𝑛(𝑛 − 1)! + (𝑛 − 1)! = (𝑛 − 1)!×(𝑛2 + 𝑛 + 1)

e. 9! + 8! + 7! = 9×8×7! + 8×7! + 7! = 7! (72 + 8 + 1) = 81×7!

f. (𝑛 + 1)! + 𝑛! + (𝑛 − 1)! =
(𝑛 + 1)×𝑛×(𝑛 − 1)! + 𝑛×(𝑛 − 1)! + (𝑛 − 1)! = (𝑛 − 1)!×(𝑛2 + 𝑛 + 𝑛 + 1)
(𝑛2 + 2𝑛 + 1)×(𝑛 − 1)! = (𝑛 + 1)2 (𝑛 − 1)!

7.
1 1 1 1 𝑛+1
a. + (𝑛−1)! = (𝑛−1)! (𝑛 + 1) =
𝑛! 𝑛!

1 1 1 1 1 𝑛 𝑛
b. − (𝑛+1)! = 𝑛! (1 − 𝑛+1) = 𝑛! (𝑛+1) = (𝑛+1)!
𝑛!

© Cambridge University Press 2019 3

Chapter 14 – Combinatorics – Worked solutions

1 1 1 1 1 1−𝑛−𝑛2 1−𝑛−𝑛2
c. − (𝑛−1)! = (𝑛−1)! ((𝑛+1)×𝑛 − 1) = (𝑛−1)! ( ) = (𝑛2 +1)×(𝑛−1)!
(𝑛+1)! 𝑛2 +1

8.
a. 𝑓(𝑥) = 𝑥 𝑛
i. 𝑓 ′ (𝑥) = 𝑛×𝑥 𝑛−1
ii. 𝑓 ′′ (𝑥) = 𝑛×(𝑛 − 1)×𝑥 𝑛−2
iii. 𝑓 𝑛 (𝑥) = 𝑛×(𝑛 − 1)× …×3×2×1 = 𝑛!
𝑛!
iv. 𝑓 𝑘 (𝑥) = (𝑛−𝑘)! 𝑥 𝑛−𝑘

1
b. 𝑓(𝑥) = 𝑥 = 𝑥 −1
1
i. 𝑓 ′ (𝑥) = −1×(𝑥 −2 ) = − 𝑥 2
2
ii. 𝑓 ′′ (𝑥) = (−1)×(−2)×(𝑥 −3 ) = 𝑥 3
120
iii. 𝑓 5 (𝑥) = (−1)×(−2)×(−3)×(−4)×(−5)×(𝑥 −6 ) = − 𝑥6
𝑛 (𝑥) 𝑛!
iv. 𝑓 = (−1)𝑛 × 𝑥 𝑛+1

9. LHS = 𝑘×𝑘!
RHS = (𝑘 + 1)! − 𝑘!

Adding and subtracting 1 to the 𝑘 in LHS: (𝑘 + 1 − 1)×𝑘!

Grouping and expanding: ((𝑘 + 1) − 1)×𝑘! = (𝑘 + 1)×𝑘! + (−1)×𝑘!
Simplifying: (𝑘 + 1)! − 𝑘! = RHS. Hence proved.

10.
a. Highest power of a prime number p in n! is given by continuously dividing n by p
until quotient is less than p and adding all the quotients.
i. Largest power of 2 in 10!
10 5 2 10 10 10
⌊ 2 ⌋ + ⌊2⌋ + ⌊2⌋ 𝑜𝑟 ⌊ 2 ⌋ + ⌊22 ⌋ + ⌊23 ⌋ = 5 + 2 + 1 = 8
So, the largest power of 2 in 10! is: 28

ii. Largest power of 10 in 10!

10 = 2×5. Hence, the largest power of 10 in 10! = GCD of powers of 2 and 5
Largest power of 2 = 8
10
Largest power of 5: 5 = 2
Hence, largest power of 10 in 10! is: 102

b. 100!
i. Largest power of 2:
100 50 25 12 6 3
⌊ 2 ⌋ + ⌊ 2 ⌋ + ⌊ 2 ⌋ + ⌊ 2 ⌋ + ⌊2⌋ + ⌊2⌋ = 50 + 25 + 12 + 6 + 3 + 1 = 97

© Cambridge University Press 2019 4

Chapter 14 – Combinatorics – Worked solutions

So, the largest power of 2 in 100! is: 297

ii. Largest power of 5:

100 20
⌊ 5 ⌋ + ⌊ 5 ⌋ = 20 + 4 = 24
So, the largest power of 5 in 100! is: 524

iii. Largest power of 7:

100 14
⌊ 7 ⌋ + ⌊ 7 ⌋ = 14 + 2 = 1
So, the largest power of 7 in 100! is: 716

iv. Largest power of 13:

100
⌊ 13 ⌋ = 7
So, the largest power of 13 in 100! is: 137

11.
a. 𝑓(𝑥) = 11𝑥 3 + 7𝑥 2 + 5𝑥 + 3
i. 𝑓(0) = 11(0) + 7(0) + 5(0) + 3 = 3, 𝑖. 𝑒. , 3×0!
ii. 𝑓 ′ (0) = 33(0)2 + 14(0) + 5×1 = 5, 𝑖. 𝑒. , 5×1!
iii. 𝑓 ′′ (0) = 66(0) + 7×2×1 = 14, 𝑖. 𝑒. , 7×2!
iv. 𝑓 ′′′ (0) = 11×3×2×1 = 66, 𝑖. 𝑒. , 11×3!
v. 𝑓 𝑘 (0) = 0 ∀𝑘 ≥ 4 𝑎𝑠 𝑓 ′′′ (0) = 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡
3×0! 5×1! 7×2! 11×3!
So, 𝑓(𝑥) = 0! + 1! 𝑥 + 2! 𝑥 2 + 3! 𝑥 3
𝑓(0) 𝑓 ′ (0) 𝑓 ′′ (0) 𝑓 ′′′ (0)
= + 𝑥+ 𝑥2 + 𝑥 3 = 𝑅𝐻𝑆. Hence proved.
0! 1! 2! 3!

b. 𝑓(𝑥) = 𝑎𝑛 𝑥 𝑛 + 𝑎𝑛−1 𝑥 𝑛−1 + ⋯ + 𝑎1 𝑥 + 𝑎0 = ∑𝑛𝑝=0 𝑎𝑝 𝑥 𝑝

𝑓(0) = 𝑎0 ×0!
𝑓 ′ (0) = 𝑎1 ×1!
𝑓 ′′ (0) = 𝑎2 ×2!
𝑘 (𝑥), 𝑘
i.e., 𝐹𝑜𝑟 𝑓 𝑡ℎ𝑒 𝑡𝑒𝑟𝑚 𝑥 𝑤𝑖𝑙𝑙 𝑏𝑒 𝑐𝑜𝑚𝑝𝑙𝑒𝑡𝑒𝑙𝑦 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑡𝑖𝑎𝑡𝑒𝑑 𝑡𝑜 𝑦𝑖𝑒𝑙𝑑 𝑘!
𝑎𝑛𝑑 𝑎𝑙𝑙 𝑜𝑡ℎ𝑒𝑟 𝑡𝑒𝑟𝑚𝑠 𝑤𝑖𝑙𝑙 𝑒𝑖𝑡ℎ𝑒𝑟 𝑏𝑒 𝑑𝑖𝑓𝑓𝑒𝑟𝑒𝑛𝑡𝑖𝑎𝑡𝑒𝑑 𝑡𝑜 𝑧𝑒𝑟𝑜 (𝑘 > 𝑖 𝑓𝑜𝑟 𝑥 𝑖 )
𝑜𝑟 𝑤𝑖𝑙𝑙 𝑔𝑒𝑡 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑖𝑒𝑑 𝑏𝑦 𝑣𝑎𝑙𝑢𝑒 𝑜𝑓 𝑥 𝑤ℎ𝑖𝑐ℎ 𝑖𝑠 𝑧𝑒𝑟𝑜 (0) 𝑎𝑠 𝑥 = 0
𝑘 (0)
So, 𝑓 = 𝑎𝑘 ×𝑘! 𝑓𝑜𝑟 𝑘 ≤ 𝑛 𝑎𝑛𝑑 𝑓 𝑘 (0) = 0 𝑓𝑜𝑟 𝑘 > 𝑛
𝑓(0) 𝑓 ′ (0) 𝑓 ′′ (0) 𝑓 ′′′ (0)
Hence, 𝑓(𝑥) = + + + +⋯
0! 1! 2! 3!

12.
𝑘
a. (𝑘+1)!
1
𝑘 = 1 => 2! = 0.5
2 1
𝑘 = 2 => 3! = 3 = 0.3333
3 3 1
𝑘 = 3 => 4! = 24 = 8 = 0.125

© Cambridge University Press 2019 5

Chapter 14 – Combinatorics – Worked solutions

4 4 1
𝑘 = 4 => 5! = 120 = 30 = 0.0333
5 5 1
𝑘 = 5 => 6! = 720 = 144 = 0.006944

1 2 𝑛
b. (1+1)!
+ (2+1)! + ⋯ + (𝑛+1)!
1 1
𝑘 = 1 => (1+1)! = 2! = 0.5
1 2
𝑘 = 2 => 2! + 3! = 0.8333
1 2 3
𝑘 = 3 => 2! + 3! + 4! = 0.958333
1 2 3 4
𝑘 = 4 => + + + = 0.991667
2! 3! 4! 5!
1 2 3 4 5
𝑘 = 5 => 2! + 3! + 4! + 5! + 6! = 0.998611

1 2 3 𝑛
c. 𝑆𝑛 = (1+1)! + (2+1)! + (3+1)! + ⋯ + (𝑛+1)!
𝑛!−1 𝑛!−1 𝑛! 1
𝑆𝑛 = => lim 𝑆𝑛 = lim = lim (𝑛! − 𝑛!)
𝑛! 𝑛→∞ 𝑛→∞ 𝑛! 𝑛→∞
1
𝐴𝑠 𝑛 → ∞, 𝑛! → 0, 𝑇ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒, lim 𝑆𝑛 = 1
𝑛→∞

𝑘
d. 𝐿𝐻𝑆 = (𝑘+1)!
1 1
𝑅𝐻𝑆 = 𝑘! − (𝑘+1)! , 𝑆𝑖𝑚𝑝𝑙𝑖𝑓𝑦𝑖𝑛𝑔:
1 1 1 1 1 𝑘+1−1 1 𝑘 𝑘
− (𝑘+1)!
= (1 − ) = ( ) = ( ) = (𝑘+1)!
= 𝐿𝐻𝑆. 𝐻𝑒𝑛𝑐𝑒 𝑝𝑟𝑜𝑣𝑒𝑑.
𝑘! 𝑘! 𝑘+1 𝑘! 𝑘+1 𝑘! 𝑘+1
𝑘 1 1
∑𝑛𝑘=1 (𝑘+1)! = ∑𝑛𝑘=1 ( − (𝑘+1)!) , 𝐸𝑥𝑝𝑎𝑛𝑑𝑖𝑛𝑔:
𝑘!
1 1 2 2 3 3 𝑛−1 𝑛−1 𝑛 𝑛
= (1! − 2!) + (2! − 3!) + (3! − 4!) + ⋯ + ((𝑛−1)! − 𝑛! ) + (𝑛! − (𝑛+1)!)

13.
a. 30×28×26× …×2
= (2×2×2× …×2 {15 𝑡𝑖𝑚𝑒𝑠})×(1×2×3×4×5× …×15)
= 215 ×15!

b. 29×27×25× …×1
30×29×28×27×…×1 30!
= =
30×28×26×…×2 215 ×15!
30! 30×29! 29!
= 215 ×15! = 2×15×214×14! = 214 ×14!

30×28×26×…×2
c. 29×27×25×…×1
2
30! (215 ×15!) (15!)2
(215 ×15!) ÷ (215 ×15!) = = 230 ×
30! 30!

1
𝑛 𝑛
14. 𝑛! ∶= √2𝜋 𝑛𝑛+2 𝑒 −𝑛 = √2𝜋𝑛 ( 𝑒 ) … 𝑎𝑠 𝑛 → ∞, 𝑒𝑟𝑟𝑜𝑟 → 0
𝑛 = 3 => 𝑛! = 3! = 6.
1
𝐴𝑠 𝑝𝑒𝑟 𝑆𝑡𝑖𝑟𝑙𝑖𝑛𝑔′ 𝑠 𝑓𝑜𝑟𝑚𝑢𝑙𝑎: √2𝜋×33+2 ×𝑒 −3 = 5.8362

© Cambridge University Press 2019 6

Chapter 14 – Combinatorics – Worked solutions

6−5.8362
Percentage error = ×100 = 2.7298 ≈ 2.73%
6
𝑛 = 10 => 𝑛! = 10! = 3628800
1
𝐴𝑠 𝑝𝑒𝑟 𝑆𝑡𝑖𝑟𝑙𝑖𝑛𝑔′ 𝑠 𝑓𝑜𝑟𝑚𝑢𝑙𝑎: √2𝜋×1010+2 ×𝑒 −10 = 3598695.619
3628800−3598695.619
Percentage error = ×100 = 0.8296 ≈ 0.83%
3628800
𝑛 = 60 => 𝑛! = 60!
1
𝐴𝑠 𝑝𝑒𝑟 𝑆𝑡𝑖𝑟𝑙𝑖𝑛𝑔′ 𝑠 𝑓𝑜𝑟𝑚𝑢𝑙𝑎: √2𝜋×6060+2 ×𝑒 −60
1
60+
√2𝜋×60 2
60!−
𝑒60
Percentage error = ×100 = 0.1388 ≈ 0.14%
60!

© Cambridge University Press 2019 7

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14B

1. Given word = “DOG”
3 distinct letters, hence number of permutations possible = 3! = 6

2. Given letters = “EFGHI”.

Start with “F” and 3 lettered permutations.
5! 5!
Number of permutations possible = 5P3 = (5−3)! = 2! = 60

3. Given word: “FRIEND”

a. Taken 4 at a time:
6! 6!
Number of permutations possible = 6P4 = (6−4)! = 2! = 360
b. Taken 6 at a time:
6! 6!
Number of permutations possible = 6P6 = (6−6)! = 0! = 720

4. Digits: 5, 6, 7, 8, 9 i.e., 5 distinct digits. To make a 4-digit number:

a. No digit is repeated:
Number of choices for 1st digit = 5
Number of choices for 2nd digit = 4
Number of choices for 3rd digit = 3
Number of choices for 4th digit = 2
5! 5!
Total number of permutations = 5P4 = (5−4)! = 1! = 120 𝑜𝑟 5×4×3×2 = 120
b. Any of the digits can occur more than once:
Number of choices for 1st digit = 5
Number of choices for 2nd/3rd/4th digits = 5 (repetition is allowed)
Hence, total number of permutations = 54 = 625

5. Distinct 3-digit numbers using digits (2, 3, 4, 5, 6)

5! 5!
Number of possible 3-digit numbers = 5P3 = (5−3)! = 2! = 60
Number of 3-digit numbers greater than 400:
For this, the hundred’s place digit can be one of 4, 5 or 6
So, choices for 1st digit = 3
4! 4!
For the remaining 2 digits, number of permutations = 4P2 = (4−2)! = 2! = 12
Total number of permutations greater than 400 = 3×12 = 36

6. 7 people and 7 different chairs ∴ Arrange 7 people in 7 chairs:

Number of arrangements = 7P7 = 7! = 5040

© Cambridge University Press 2019 8

Chapter 14 – Combinatorics – Worked solutions

7. Using nPr i.e., repetition is not allowed

10!
a. 3 people lining up from a group of 10: 10P3 = (10−3)! = 720
5! 5!
b. 3 cards from 5 unique cards: 5P3 = (5−3)! = 2! = 60
100!
c. First 3 winners of a lottery with 100 tickets: 100P3 = (100−3)! = 970200

8. Using 𝑛𝑟 i.e., repetition is allowed

a. 3-digit numbers using digits 1 to 9: 93 = 729
b. 3 winners of a 100-tickets, replacing lottery: 1003 = 1000000
c. 10-digit binary strings: 210 = 1024

9. 8 runners in 400m race:

a. Number of possible finishes: 8! = 40320
8! 8!
b. Gold, silver and bronze medal winners’ permutations: 8P3 = (8−3)! = 5! = 336

10.
a. Tossing a coin and rolling a die:
Outcomes possible for tossing a coin = 2
Outcomes possible for rolling a die = 6
Total number of outcomes of combined experiment = 2×6 = 12
b. Tossing 2 coins and rolling 3 dice:
Outcomes of tossing 2 coins = 22 = 4
Outcomes of rolling 3 dice = 63 = 216
Total outcomes possible = 22 ×63 = 864

11. The woman wears one of each item. So,

For every hat she has, she has a choice of 3 blouses, 5 skirts, 2 handbags and 6 shoes.
∴ 𝑃𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠 𝑝𝑒𝑟 ℎ𝑎𝑡 = 3×5×2×6 = 180
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 ℎ𝑎𝑡𝑠 𝑠ℎ𝑒 ℎ𝑎𝑠 = 4
So, total number of ways she can attire = 4×180 = 720

© Cambridge University Press 2019 9

Chapter 14 – Combinatorics – Worked solutions

12. Jack has 6 different football cards and Meg has another 8 different football cards.
All the 14 cards are different (Hence, each can be exchanged with the other)
For each of Jack’s card, he has 8 different Meg’s card to exchange for.
For each card → 8 𝑐ℎ𝑜𝑖𝑐𝑒𝑠
Number of cards → 6
Total number of exchanges = 6×8 = 48

13. 8-digit phone number starting with the number 9:

9_______
a. Total number of permutations: 7 blanks and 10 choices for each blank
Hence, total phone number = 107 = 10000000
b. Odd phone numbers:
For the odd phone numbers, the last digit has only 5 choices instead of 10, namely:
(1, 3, 5, 7, 9). So,
Odd phone numbers = 5×106 = 5000000
c. Phone numbers with odd digits only:
For number with only odd digits, each of the 7 blanks will have 5 choices:
(1, 3, 5, 7, 9). So,
Numbers with only odd digits= 57
d. Numbers with no 0 and alternate odd-even:
As the first number is an odd number (9), there are 4 blanks for even digits and 3
blanks for odd digits. For the 4 blanks there are 4 choices of even digits:(2, 4, 6, 8)
and the 3 blanks of odd digits have 5 choices of odd digits: (1, 3, 5, ,7, 9)
So, total number of such phone numbers= 44 ×53 = 256×125 = 32000

14. 4-digit pin codes:

a. Total number of pins= _ × _ × _ × _ = 10×10×10×10 = 10000
10!
b. 4 distinct digits: 10P4 = (10−4)! = 10×9×8×7 = 5040
c. Odd digits only: 5×5×5×5 = 54 = 625
d. Start and end with same digit: The choice for the last digit is accounted for in the
first digit. Hence, 10×10×10×1 = 103 = 1000

15. 4-digit numbers without repetition using 1 to 9

9! 9!
a. Total number of such 4-digit numbers: 9P4 = (9−4)! = 5! = 3024
b. Numbers ending in 1: Assign last digit as 1. So, only first 3 digits are to be selected
8!
from remaining 8. Hence, 8P3×1 = 5! = 336
c. Number of even numbers: The last digit has 4 choices (2, 4, 6, 8) and the remaining
are chosen later from the remaining.
Hence, 8×7×6×4 = 1344

© Cambridge University Press 2019 10

Chapter 14 – Combinatorics – Worked solutions

8!
d. Divisible by 5: Units digit is 5, rest 3 can be selected as 8P3 = 5! = 336
e. Greater than 7000: 3 choices (7, 8, 9) for the first digit and other 3 chosen from
the remaining 8: 3×8×7×6 = 1008

16. 4-digit numbers with repetition using 1 to 9

a. Total number of such 4-digit numbers: 94 = 6561
b. Numbers ending in 1: Assign last digit as 1. So, only first 3 digits are to be selected
93 = 729
c. Number of even numbers: The last digit has 4 choices (2, 4, 6, 8) and the remaining
are chosen at random.
Hence, 9×9×9×4 = 2916
d. Divisible by 5: Units digit is 5, rest 3 can be selected as: 9×9×9 = 729
e. Greater than 7000: 3 choices (7, 8, 9) for the first digit: 3×9×9×9 = 2187

17. Tasmanian car license plate: 2 letters and 4 digits

a. Total number of license plate possible: 26×26×10×10×10×10 = 6760000
b. No repetition of letters or digits: 26×25×10×9×8×7 = 3276000
c. 2nd letter is X and 3rd digit is 3: 26×1×10×10×1×10 = 26000
d. Letters are D and Q and the numbers are 3, 6, 7, 9: 2×1×4×3×2×1 = 48

18. Permutations of the letters in the word: “NUMBER”

a. 6 distinct letters ∴ 6! 𝑤𝑎𝑦𝑠 = 720 𝑎𝑟𝑟𝑎𝑛𝑔𝑒𝑚𝑒𝑛𝑡𝑠
b. Begin with N: Fix first letter as N, the others can be arranged in 5! Ways = 120
c. Begin with N and end with U: Fix 1st and last letters as N and U respectively. Then
the rest can be arranged in 4! Ways = 24
d. N is to the left of U: When U is last, N has 5 positions. When U is 5th, N has 4
positions. When U is 4th, N has 3 positions. Thus, total number of possible
arrangements where N is to the left if U is:
(5 + 4 + 3 + 2 + 1)×4! = 15×4! = 360

19. Total crew = 8 women. Grouping the 3 women who only row on the bow side as one
and the 2 women who only row on the stroke side as one. So, these groups can be
arranged on the bow and stroke side respectively in: 4×3×2 = 24 𝑎𝑛𝑑 4×3 = 12
ways. The remaining 3 women can be arranged in 3 places in 3! = 6 ways. Hence, total
number of arrangements = 24×12×6 = 1728 ways. (Bow and stroke side each has 4
seats)

© Cambridge University Press 2019 11

Chapter 14 – Combinatorics – Worked solutions

20. 5 people, 3-seats, only 2 can drive:

Driver seat can be occupied by one of the 2 drivers in 2 ways.
4!
The remaining 2 seats can be occupied by the remaining 4 in 4P2 2! = 12 ways
So, the total number of arrangements = 12×2 = 24

21. 5-digit numbers using digits (2, 3, 4, 5, 6)

a. Total numbers that can be formed without repetition: 5P5 = 5! = 120
b. Numbers greater than 56432: In the given case, the numbers greater than 56432
are the numbers greater than 60000, i.e., numbers starting with 6:
So, fix the first number as 6 and arrange the rest: 4P4×1 = 4! = 24
c. Numbers less than 56432 = (total number of numbers formed) – (numbers
greater than 56432 + 1)
(+1 because 56432 number itself is one of the total formed numbers)
=> 120 − 24 − 1 = 95

22.
a. Forming integers from (2, 3, 4, 5) without repetition:
i. Total integers possible: 1-digit + 2-digits + 3-digits + 4-digits
=> 4P1 + 4P2 + 4P3 + 4P4 = 4 + 12 + 24 + 24 = 64 integers
ii. Number of even integers: Half of the integers formed will be even as there are
equal number of even and odd digits in the given set.
∴ 64 ÷ 2 = 32 even integers
b. Forming integers from (2, 3, 4, 5) with repetition:
i. Total integers possible: 1-digit + 2-digits + 3-digits + 4-digits
=> 41 + 42 + 43 + 44 = 4 + 16 + 64 + 256 = 340
iii. Number of even integers: Half of the integers formed will be even as there are
equal number of even and odd digits in the given set.
∴ 340 ÷ 2 = 170 even integers.

23. 5-digit numbers without repetition using (0, 1, 2, 3, 4)

a. Total such numbers: The first digit cannot be 0 as it will be a 4-digit number then.
So, there are 4 choices for 1st digit and the rest can be arranged in 4! ways. Hence,
4×4! = 4×24 = 96 numbers.
b. Odd number of 5-digit numbers: The last digit has 2 choices (1, 3) and the first
digit has 3 choices (2, 4, 1/3). Rest 3 can be arranged in 3! ways. Hence,
2×3×3! = 36 odd numbers.
c. Divisible by 5: Units digit must be 0. Rest 4 can be arranged in 4! ways.
∴ 4! = 24

© Cambridge University Press 2019 12

Chapter 14 – Combinatorics – Worked solutions

24.
8! 8!
a. 8Pr = 336 =>
(8−𝑟)!
= 336. ∴ 336 = (8 − 𝑟)! = 120. Hence, (8 − 𝑟)! = 120 = 5!. So,
(8 − 𝑟) = 5 => 𝑟 = 3.
(2𝑛)! (2𝑛+1)! 7 2𝑛+1
b. 7× 2nPn = 4× 2n+1Pn => 7× = 4× (𝑛+1)!
=> 4 = => 𝑛 = 3
𝑛! 𝑛+1
𝑛!
c. Using nPr = (𝑛−𝑟)!
i. n+1Pr = nPr + r × nPr – 1
(𝑛+1)! 𝑛! 𝑛! 𝑛!
LHS = n+1Pr = (𝑛+1−𝑟)! = (𝑛 + 1)× (𝑛−(𝑟−1))! = 𝑛× (𝑛−(𝑟−1))! + (𝑛−(𝑟−1))!
𝑛! 𝑛! 𝑛! 𝑛! 𝑛!
RHS = nPr + r × nPr – 1 = (𝑛−𝑟)! + 𝑟× (𝑛−(𝑟−1))! = (𝑛−𝑟)! + 𝑟× (𝑛+1−𝑟)! = (𝑛−𝑟)! +
𝑟 𝑛! 𝑛! 𝑟 𝑛! (𝑛+1−𝑟)+𝑟 𝑛! 𝑛+1
× (𝑛−𝑟)! = (𝑛−𝑟)! (1 + 𝑛+1−𝑟) = (𝑛−𝑟)! ( ) = (𝑛−𝑟)! × 𝑛+1−𝑟 = n+1Pr
𝑛+1−𝑟 𝑛+1−𝑟
Hence proved.
ii. nPr = n – 2Pr + 2r × n-2Pr – 1 + r × (r – 1) × n-2Pr – 2
RHS = n – 2Pr + 2r × n-2Pr – 1 + r × (r – 1) × n-2Pr – 2
(𝑛−2)! (𝑛−2)! (𝑛−2)!
=> (𝑛−2−𝑟)! + 2𝑟× (𝑛−2−(𝑟−1))! + (𝑟 2 − 𝑟)× (𝑛−2−(𝑟−2))!
(𝑛−2)! 2𝑟 𝑟 2 −𝑟 (𝑛−2)! (𝑛−𝑟)(𝑛−𝑟−1)+2𝑟(𝑛−𝑟)+(𝑟 2 −𝑟)
(𝑛−𝑟−2)!
(1 + 𝑛−𝑟−1 + (𝑛−𝑟−1)(𝑛−𝑟)) = (𝑛−𝑟−2)! ( (𝑛−𝑟)(𝑛−𝑟−1)
)
(𝑛−2)! 𝑛2 −2𝑟𝑛−𝑛+𝑟 2 +𝑟+2𝑟𝑛−2𝑟 2 +𝑟 2 −𝑟 (𝑛−2)! 𝑛2 −𝑛
(𝑛−𝑟−2)!
( (𝑛−𝑟)(𝑛−𝑟−1)
)= (𝑛−𝑟−2)!
× ((𝑛−𝑟)(𝑛−𝑟−1))
(𝑛−2)! 𝑛(𝑛−1) 𝑛!
(𝑛−𝑟−2)!
× ((𝑛−𝑟)(𝑛−𝑟−1)) = (𝑛−𝑟)! = nPr = LHS
Hence proved.

25. 5-digit numbers divisible by 3 (repetition allowed)

For a 5-digit number, the first digit cannot be 0. All the other digits can be chosen at
random, therefore, there are 90 000 5-digit numbers (90×10×10×10×10).
a. From 100000 to 99999, one out of 3 numbers is a multiple of three. Hence there
are 30000 5-digit numbers that are divisible by 3.
b. 5-digit divisible by 3 numbers without 0: the first 4-digit can be chosen at random
among 1 to 9, and the last digit can be chosen among (1, 2, 3) depending upon the
sum of 1st 4-digits, so that the sum is a multiple of 3 = 9×9×9×9×3 = 19683
c. 5-digit divisible by 2 numbers without 0 = 9×9×9×9×4 = 26244
d. 5-digit divisible by 6 numbers without 0 = Numbers common in the set of divisible
by 2 and divisible by 3 => The last digit is even, middle three are at random, the
first digit is one of (1, 2, 3) depending on the sum of last 4
26244
∴ 3×9×9×9×4 = 8748. (Also, 3 = 8748)

© Cambridge University Press 2019 13

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14C

1.
a. BOARDS → Vowels are: “OA” which can be arranged amongst themselves in 2!
ways. Taking the group of vowels as 1 and the other 4 letters, total 5 can be
arranged in 5! ways.
∴ Total arrangements = 5!×2! = 240 ways.
b. RIO → Vowels are: “IO” which can be arranged amongst themselves in 2! ways.
Taking the group of vowels as 1 and the other letter, total 2 can be arranged in
2! ways.
∴ Total arrangements = 2!×2! = 4 ways
c. QUIT → Vowels are: “UI” which can be arranged amongst themselves in 2! ways.
Taking the group of vowels as 1 and the other 2 letters, total 3 can be arranged in
3! ways.
∴ Total arrangements = 3!×2! = 12 ways
d. TROUNCE →Vowels are: “OUE” which can be arranged amongst themselves in 3!
ways. Taking the group of vowels as 1 and the other 4 letters, total 5 can be
arranged in 5! ways.
∴ Total arrangements = 5!×3! = 720 ways

2. MATHS
a. T and H are together: They can be arranged in 2! ways and considered as a group.
The rest 3 letters and this group makes 4 and can be arranged in 4! ways.
∴ Total arrangements = 4!×2! = 48 ways
b. TH must be together in this order: TH is a group and constitute as one element
with other 3 letters. Together, the 4 can be arranged in 4! ways = 24 ways.

3. Andrew and Becky can be considered as one group and can be arranged in 2! ways.
Similarly, Dion and Ellie can be considered as a group and can be arranged in 2! ways.
And in total, 2 groups and Courtney as 3 can be arranged in 3! ways. So, total
arrangements possible are: 3!×2!×2! = 24

4. 3 different mathematics books, 6 different science books, 4 different English books.

Arranging the books of each subject individually and then arranging the 3 groups.
The Maths books can be arranged in: 3! ways.
The Science books can be arranged in: 6! ways.
The English books can be arranged in: 4! ways.
The three groups can be arranged in: 3! ways.
Total arrangements: 3!×6!×4!×3! = 622080 ways.

5. SOLAR: The first 2 positions cannot both be vowels (O, A)

a. Jack’s method: The word may or may not start with a vowel.
When the word starts with a vowel: 2×3×3×2×1 = 36
When the word does not start with a vowel: 3×4! = 72
Total arrangements: 36 + 72 = 108
b. Jill’s method: The words with 1st two positions having vowels
When the 1st two letters are vowels: 2!×3! = 2×6 = 12

© Cambridge University Press 2019 14

Chapter 14 – Combinatorics – Worked solutions

Total arrangements possible: 5! = 120

Required arrangements: 120 − 12 = 108

6. Consider the cases when the Father drives and when the Mother drives:
When Father drives: Mother has 2 options and the 2 children can be arranged in
2! ways. So, a total of: 2×2! = 4 ways
When the mother drives: Father will sit in the other front seat and the children can be
arranged in 2! ways on the back 2 seats. So, a total of: 2! = 2 ways
Hence, total arrangements: 4 + 2 = 6 ways.

7. (7, 8, 9) numbers > 80 that can be formed without repetition.

3-digit numbers (All will be greater than 80): 3! = 6
2-digit numbers: Only 2 choices for tens-place digit (8, 9) and remaining 2 for the
unit’s digit: 2×2 = 4
Total numbers greater than 80: 6 + 4 = 10

8. UNIFORM
a. Vowel at 1st, middle and last position:
3 vowels and 3 positions → 3! ways.
The other 4 letters have 4 positions → 4! ways.
Total arrangements → 3!×4! = 144 ways.
b. Word starts with U and ends with M:
First and last positions are fixed as U and M. Rest 5 positions and 5 letters:
∴ Total arrangements → 5! = 120 ways.
c. All consonants are in a group at the end of the word:
4 consonants as one group → 4! ways
3 vowels at the first 3 positions → 3! ways
∴ Total arrangements → 3!×4! = 144 ways
d. M is somewhere to the right of U:
When M is at the last position → U has 6 positions and others in 5! ways
When M is at 6th position → U has 5 positions and others in 5! ways
Similarly, for every nth position of M, there are total (∑𝑛𝑥=1(𝑥 − 1)) ×(𝑛 − 2)!
Arrangements where U is to the left of M.
Hence, total such arrangements: (6 + 5 + 4 + 3 + 2 + 1)×5! = 21×120 = 2520

9. BEHAVING
a. End in NG: Fix the last two letters as NG. Rest 6 can be arranged in: 6! = 720 ways
b. Begin with 3 vowels: 3 vowels in first 3 positions → 3! ways, and rest 5 in 5! ways.
Total = 3!×5! = 720
c. Have 3 vowels occurring together: 3 vowels as 1 group and can be arranged in
3! ways. Total 6 elements in 6 positions: 6! ways. So, total arrangements: 3!×6! =
4320 ways.

© Cambridge University Press 2019 15

Chapter 14 – Combinatorics – Worked solutions

10. Maths test with 6 different questions

a. Shortest question first and longest question last:
Fix first and last questions with the requirements. Then the remaining 4 can be
arranged in 4 places in: 4! ways = 12
b. Shortest and longest questions are next to each other:
Consider the 2 as a group and can be arranged in 2! ways.
Total 5 elements in 5 places, so: 5! Ways
Total arrangements: 2!×5! = 240 ways

11. Morse Code options are dots or dashes, i.e., number of options = 2
Maximum number of symbols used = 10 (repetition allowed)
Letters using 1 symbol = 21 = 2
Letters using 2 symbols = 22 = 4
Letters using 3 symbols = 23 = 8
Similarly, letters using n symbols = 2𝑛
Total = ∑10 𝑛
𝑛=1 2 = 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 512 + 1024 = 2046

12. 4 boys and 4 girls, total of 8 people:

a. Alternate boys and girls: 4 alternate positions for boys and arranged in 4! ways, 4
alternate positions for girls arranged in 4! ways, selecting the alternate position in
2! ways.
Total = 4!×4!×2! = 1152
b. Boys and girls in distinct group: Two groups can be arranged in 2! ways and each
group have 4 people which can be arranged in 4! ways.
Total = 4!×4!×2! = 1152

13. “PHYSICAL”, 5-letter words:

a. Only consonants: 6 consonants and 5 positions. This can be arranged in
6×5×4×3×2 ways = 720 words with only consonants
b. Begin with P and end with S: Fix first and last letters as P and S. The remaining 3
6!
letters can be chosen from the 6 letters left in 6P3 ways = 3! = 120. Total words
beginning with P and ending with S = 120
c. Begin with vowel: 2 vowels I and A. Assigning one to first position in 2! ways. Rest
7!
4 letters can be selected from remaining 7 letters in 7P4 = 3! = 840 ways. Total
such words possible 2×840 = 1680
7!
d. Containing Y: Select Y and select 4 letters from remaining 7 in 7C4 = 4!3! = 35 ways
and the 5 letters can be arranged in 5! ways. So, a total of: 35×5! = 4200 words.
Alternatively, All possible arrangements = 8P5 = 6720
Arrangements if Y was not in the options = 7P5 = 2520
Words containing Y = 6720 − 2520 = 4200
e. Vowels next to each other: 2 vowels as a group and can be arranged amongst itself
6!
in 2! ways. The 3 letters can be selected from the rest 6 in 6C3 = 3!3! = 20 ways. The
4 selected can then be arranged in 4! ways.
∴ Total such words = 2!×20×4! = 960

© Cambridge University Press 2019 16

Chapter 14 – Combinatorics – Worked solutions

Alternatively, the group of 2 vowels will have 4 spaces to choose while the other 3
spaces will have 6, 5, 4 choices respectively. So, 2!×4×6×5×4 = 960.
f. Words with A immediately followed by L: AL as a group with 4 spaces and the rest
3 with 6, 5, 4 choices respectively. So, 4×6×5×4 = 480 words.

14. INCLUDE, 7-letter words without repetition

a. Total possible words: 7P7 = 7! = 5040 words
b. Not begin with I: Words that begin with I = 1×6! = 720
Words that do not begin with I = 5040 − 720 = 4320
c. Ending in L: 1st 6 letters at random in 6! ways and last letter as L
So: 6! = 720 words
d. Vowels and Consonants alternating: Since, it is a 7 lettered word with 3 vowels
and 4 consonants, it should start with a consonant. Hence, 4 alternate spaces for 4
consonants arranged in 4! ways and 3 alternate places for 3 vowels arranged in
3! ways. So, 3!×4! = 6×24 = 144 words
e. C immediately after D: DC as one group and total 6 elements for 6 positions.
Total arrangements = 6! = 720 words.
f. Exactly 2 letters between N and D: Group of 4 blanks out of 7 with N and D at the
ends. Choices for the blanks in between them = 5×4 = 20. N and D can be
interchanged hence, 2! Ways. So, 2!×20 = 40 ways. This group with the remaining
3 letters. Total 4 elements for 4 positions. So, 4! = 24 ways.
Total such words = 40×24 = 960
g. N and D separated by more than 2 letters:
Words with ND together: 2!×6! = 1440
Words with N and D separated by 1 letter: 2!×5×5! = 1200
Words with N and D separated by 2 letters: 960
Words with N and D separated by more than 2 letters:
=> 5040 − (1440 + 1200 + 960) = 1440

15. INCLUDE, 7-letter words with repetition

a. Total possible words: 77 = 823543 words
b. Not begin with I: Words that begin with I = 1×76 = 117649
Words that do not begin with I = 77 − 76 = 705894
c. Ending in L: 1st 6 letters at random in 76 ways and last letter as L
So: 76 = 117649 words
d. Vowels and Consonants alternating: As, repetition is allowed alternate blanks for
vowels and consonants can be selected in 2 ways (first letter as vowel or
consonant):
First case (Vowel as 1st letter): 3×4×3×4×3×4×3 = 34 ×43 = 5184
Second case (consonant start): 4×3×4×3×4×3×4 = 33 ×44 = 6912
Total such words = 5184 + 6912 = 12096

16.
a. 10 people in a line:
i. Without restriction: 10P10 = 10! = 3628800
ii. One person at either end: Select one of the 2 ends in 2 ways and the rest 9 can
be arranged in 9! ways = 362880×2 = 725760

© Cambridge University Press 2019 17

Chapter 14 – Combinatorics – Worked solutions

iii. 2 people next to each other: Consider the 2 as a group. So, 2! ways they can be
arranged. Total 9 with the group in 9 places. Hence, 9!×2! = 725760
iv. Neither of the 2 can sit on the ends: For the two particular people, there are 8
choices of seats (excluding ends) which gives 8×7 = 56 arrangements. The
rest 8 people can be seated in 8 seats in 8! = 40320 ways.
So, total arrangements = 40320×56 = 2257920
b. N people in n seats
i. 1 person seated at either end: Select one of the 2 ends in 2 ways for the person
and the rest (𝑛 − 1) people seated in (𝑛 − 1) seats in (𝑛 − 1)! ways.
Total arrangements = 2×(𝑛 − 1)!
ii. Two particular people sit together: Consider the 2 as a group. Group
arrangements = 2!. The rest of the people with the group make (𝑛 − 1) people
in (𝑛 − 1) seats. So, total arrangements = 2!×(𝑛 − 1)!
iii. Two people not permitted to sit at the ends: The two people have (𝑛 − 2)
choices (excluding ends) and can be seated in (𝑛 − 2)×(𝑛 − 3) arrangements.
The rest (𝑛 − 2) people can be seated in (𝑛 − 2) seats in (𝑛 − 2)! ways.
So, total arrangements = (𝑛 − 2)×(𝑛 − 3)×(𝑛 − 2)!

17. The 2 brothers should stand together. So, count them as one unit and self-
arrangements of 2! ways. The three boys wish to stand together so consider them as
another group and self-arrangements of 3! ways. The two groups with the 4 girls
together making 6 can be arranged in 6! ways.
So, total arrangements: 2!×3!×6! = 8640

18. 8 people to form 2 queues of 4.

a. No restrictions: The choices for the first queue are: 8×7×6×5 = 1680
The choices for the second queue are: 4×3×2×1 = 24
Total arrangements = 1680×24 = 40320
b. Jim in left-hand queue: Assign Jim to left-hand queue and he has 4 spot choices.
The rest 7 have 7 spots so, can be arranged in: 7! ways.
Total arrangements = 7!×4 = 20160
c. Sean and Liam stand in the same queue: They can select one of the 2 queues in 2
ways and in each queue, they can be arranged in 3! Ways with self-adjustments of
2!. So: 2×3!×2! = 24 arrangements. The rest 6 can be arranged in 6 spots in
6! ways.
Hence, total arrangements: 24×6! = 17280

19. 8 swimmers, no dead heats, swimmer in lane 2 finishes:

a. Immediately after Lane 5 swimmer: Lane 5 and Lane 2 swimmer as a pair and the
rest 6 together form 7 for arrangements in 7 spots in: 7! ways.
Hence, total arrangements = 7! = 5040
b. Any time after Lane 5 swimmer: The rest 6 swimmers can be arranged in 6! ways.
The swimmer in Lane 2 will have the choices to the right of swimmer in Lane 5.
When Lane 5 swimmer finishes first, Lane 2 swimmer has 7 choices.
When Lane 5 swimmer finishes 2nd, Lane 2 swimmer has 6 choices and so on.
∴ Total arrangements = (7 + 6 + 5 + 4 + 3 + 2 + 1)×6! = 20160

© Cambridge University Press 2019 18

Chapter 14 – Combinatorics – Worked solutions

20. 5 backpackers and 5 hostels

a. Total arrangements if no restriction: Each backpacker has 5 choices.
∴ 5 backpackers with 5 choices each: 55 = 3125
b. Each backpacker stays in different hostel: 5 backpackers and no repetition with 5
hostels. Hence, 5P5 = 5! = 120 arrangements.
c. Brother and sister stay together and other 3 can stay in other 4 hostels: The
brother-sister can stay in one of the 5 hostels ∴ 5 choices. The other 3 have
remaining 4 choices => 43 choices.
∴ Total arrangements = 43 ×5 = 64×5 = 320

21. Numbers less than 4000 using (1, 3, 5, 8, 9) without repetition:

a. Total number of such numbers:
1-digit numbers = 5P1 = 5
2-digit numbers = 5P2 = 20
3-digit numbers = 5P3 = 60
4-digit numbers = The first digit can be one of (1, 3)→ 2 choices.
The rest 3 can be chosen from the remaining 4 in: 4×3×2 = 24 ways.
Total such numbers = 5 + 20 + 60 + 2×24 = 133
b. Number of such odd numbers:
1-digit odd numbers = 4
2-digit odd numbers: Units place has 4 choices and the other has 4 = 4×4 = 16
3-digit odd numbers: Units place has 4 choices, ten’s digit has 4, hundred’s digit
has 3 = 4×4×3 = 48
4-digit odd numbers = The first digit can be one of (1, 3)→ 2 choices.
The unit’s digit can be chosen from the remaining 3 odd numbers in 3 ways. The
middle 2 digits can be chosen from the rest 3 in: 3×2 ways. So: 2×3×6 = 36
Hence, total such odd numbers: 4 + 16 + 48 + 36 = 104

22. Derangements denoted by 𝐷(𝑛):

a. Derangements of A: 𝐷(1) = 0 as no other place to put A.
Derangements of AB: 𝐷(2) = 1, only one possible: BA
Derangements of ABC: 𝐷(3) = 2, BCA and CAB
Derangements of ABCD: 𝐷(4) = 9, [BCDA, BDAC, BADC, CADB, CDAB, CDBA, DCBA,
DABC, DCAB]
b. Derangements of ABCDE: 𝐷(5) = 4×𝐷(4) + 4×𝐷(3)
A letter X from the 5 will have 4 choices to take a place other than its original and
the rest are 4 letters with 𝐷(4) number of derangements possible ∴ 4×𝐷(4)
But the letter X occupies one of the positions of the other 4 which means one or 3
of the remaining could be on their own position (Only 2 letters are swapped, or 4
letters are swapped). Hence, the remaining 3 or 1 should also be deranged. ∴
4×𝐷(3) + 4×𝐷(1). But 𝐷(1) = 0
Hence, 𝐷(5) = 4×𝐷(4) + 4×𝐷(3)
c. 𝐷(5) = 4×(9) + 4×(2) = 44

© Cambridge University Press 2019 19

Chapter 14 – Combinatorics – Worked solutions

𝐷(6) = 5×𝐷(5) + 5×𝐷(4) = 5×(44) + 5×(9) = 265

𝐷(7) = 6×𝐷(6) + 6×𝐷(5) = 6×(265) + 6×(44) = 1854
𝐷(8) = 7×𝐷(7) + 7×𝐷(6) = 7×(1854) + 7×(265) = 14833

© Cambridge University Press 2019 20

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14D

1. Permutations of repeated letters:
3!
a. BOB: 2 Bs and an O, total permutations = 2! = 3
4!
b. ALAN: 2 As in 4 letters, total permutations = 2! = 12
6!
c. SNEEZE: 3 Es in 6 letters, total permutations = 3! = 120
8!
d. TASMANIA: 3 As in 8 letters, total permutations = 3! = 6720
8!
e. BEGINNER: 2 Es, 2 Ns in 8 letters, total permutations = 2!2! = 10080
9!
f. FOOTBALLS: 2 Os, 2 Ls in 9 letters, total permutations = 2!2! = 90720
11!
g. EQUILATERAL: 2 As, 2 Es, 2 Ls in 11 letters, total permutations = 2!2!2! = 4989600
9!
h. COMMITTEE: 2 Es, 2Ms, 2 Ts in 9 letters, total permutations = 2!2!2! = 45360
13!
i. WOOLLOOMOOLOO: 3 Ls, 8 Os in 13 letters, total permutations = 3!8! = 25740

2. (1, 1, 1, 2, 2, 3) to form a 6-digit number. Total number of distinct numbers that can
6!
be formed: 3 1’s and 2 2’s in 6 digits = 3!2! = 60

3. 6 coins lined up. Possible patterns when:

6!
a. 5 tails and 1 head = 5!1! = 6
6!
b. 4 heads and 2 tails = 4!2! = 15
6!
c. 3 tails and 3 heads = 3!3! = 20

4. 8 identical balls with conditions on colour as follows:

a. All different colours: 8! = 40320 arrangements
8!
b. 7 red and 1 white: 7!1! = 8 arrangements
8!
c. 6 red, 1 white and 1 black: 6!1!1! = 56 arrangements
8!
d. 3 red, 3 white and 2 black: 3!3!2! = 560 arrangements.

5. 5 identical green chairs and 3 identical red chairs:

8!
a. No restrictions arrangements: 5!3! = 56
b. Green chairs at each end: Put 2 green chairs on each end. Remaining can be
6!
arranged in 3!3! = 20 ways

6. 8 traffic lights and 3 are red others are green:

8!
a. Total such arrangements: 3!5! = 56

© Cambridge University Press 2019 21

Chapter 14 – Combinatorics – Worked solutions

b. Here 𝑟 = 3 for the 𝑟 identical lights. So, 𝑟 can be replaced by (𝑛 − 𝑟) to have the
same answer (As, nCr = nCn – r). So, (8 − 3) = 5. Hence, 5 number of red lights
would also yield the same answer as part (a)

7. SOCKS:
5!
a. No restriction arrangements: 2 Ss in 5 letters = 2! = 60
b. 2 Ss are together: Considering as a group and rest 3 letters to a total of 4: 4! = 24
c. 2 Ss are separated by at least 1 letter: Total arrangements – Ss are together
(60 − 24) = 36
3!
d. K is to the left of C: The other 3 can be arranged in 2! = 3 ways for each case.
When K is 1st, C has 4 choices; When K is 2nd, C has 3 choices and so on. So, a total
of: (4 + 3 + 2 + 1)×3 = 30 arrangements.

8.
a. SLOOPS: 2 Os, 2Ss in 6 letters:
6!
i. No restriction arrangements: 2!2! = 180
5!
ii. 2 Os are together: Consider as a group with the rest to total 5 = 2! = 60
iii. 2 Os are separated: Total arrangements – 2 Os together = 180 − 60 = 120
iv. 2 Os together and 2 Ss together: Consider both as a group to total 4: 4! = 24

b. TATTOO arrangements when 2 Os are separated:

6! 5!
Total arrangements – 2 Os together => 3!2! − 3! = 60 − 20 = 40

9. DECISIONS: 2 Is, 2Ss in 9 letters:

9!
a. No restriction arrangements: 2!2! = 90720
b. Alternate vowels and consonants: Start with the consonant as 9 letters and 5
5!
consonants. The consonants arrangements are: = 60. The vowels can be
2!
4!
arranged in 2! = 12 ways. Total arrangements: 60×12 = 720
c. Vowels come first followed by consonants: Taking the vowels 1st and arranging
4! 5!
them in: = 12 ways. Then, arranging the consonants in: = 60 ways. Total
2! 2!
arrangements: 12×60 = 720
7!
d. N is to the right of D: The rest 7 can be arranged in 2!2! = 1260 ways for all cases.
When D is 1st, N has 8 spots; When D is 2nd, N has 7 spots and so on. So, the total
number of such arrangements: (8 + 7 + 6 + 5 + 4 + 3 + 2 + 1)×1260 = 45360

© Cambridge University Press 2019 22

Chapter 14 – Combinatorics – Worked solutions

10. PROPORTIONALITY: arrangements such that vowels and consonants occupy the
same places.
2 Is, 3 Os, 2 Ps, 2 Rs, 2 Ts in 15 letters and 6 vowels and 9 consonants.
9! 6!
Re-arranging the consonants and vowels at their respective places: 2!2!2! and 3!2!
9! 6!
Total such arrangements: 2!2!2! × 3!2! = 2721600

11. 10 questions with “Yes-No” answers. Number of ways it can be filled when:
a. No restrictions: Each question has 2 options. So, 210 = 1024
b. 1st and last answers are “Yes”: Rest 8 has 2 choices. So, 28 = 256
c. 2 are “Yes” and 8 are “No”: Similar to 10 letters with 8 of one kind and 2 of other
10!
= 45
8!2!
10!
d. 5 “Yes” and 5 “No”: 10 balls with 5 red and 5 blue = 5!5! = 252
e. More than 7 “Yes”: Either 8 are “Yes” or 9 are “Yes” or all are “Yes”
10! 10! 10!
: → 8!2! + 9!1! + 10! = 56
f. Odd number of “Yes”: Same logic as above for odd numbers →
10! 10! 10! 10! 10!
+ + + + = 512
1! 9! 3! 7! 5! 5! 7! 3! 9! 1!
g. 3 “Yes” and they occur together: Consider them as a single group. The group with
8!
7 “No” together making 8 can be arranged in → 7! = 8 ways
h. 1st and last are “Yes” and exactly 4 more are “Yes”: First and last question are no
8!
choice. Rest 8 have 4 “Yes” and 4 “No”. So, 4!4! = 70

12. 3-yellow, 2-green and 1-purple as max allowed:

6!
a. Six dots are used. Maximum codes possible: 3!2!1! = 60
b. 5 dots are used. Maximum codes possible: 5 = (3 + 2), (1 + 2 + 2), (1 + 3 + 1)
5! 5! 5!
Arrangements for each of the 3 combinations: 3!2! , 2!2!1! , 3!1!1!
Total possibilities: 10 + 30 + 20 = 60

13.
a. STRESS: 5-letter words
2-types of 5-letter words are possible: contain 2 Ss or contain 3 Ss
5! 3! 5!
Contain 2 Ss: 2! = 60 words. Contain 3 Ss: 2! × 3! = 60
Total: 60 + 60 = 120
b. BANANA: 5-letter words
3 As, 1 B and 2Ns. Possible matches: (3𝐴 + 𝐵 + 𝑁), (3𝐴 + 2𝑁), (2𝐴 + 𝐵 + 2𝑁)
5! 5! 5!
Words for each combination: 3! , 3!2! , 2!1!2!
Total words: 20 + 10 + 30 = 60

© Cambridge University Press 2019 23

Chapter 14 – Combinatorics – Worked solutions

14. TRANSITION: arrangements of the letters possible

10!
a. No restrictions: 2 Ts, 2 Is, 2 Ns in 10 letters. So, 2!2!2! = 453600
b. The Is are together: Consider Is as a group. So, 9 letters to be arranged. Hence,
9!
= 90720
2!2!
c. Is, Ns, Ts are together: Consider each as a group. So, 3 groups and 4 letters making
7 to be arranged. Hence, 7! = 5040
d. Ns at the end positions: Last 2 positions are assigned to the Ns. The first 8 positions
8!
can be filled in: 2!2! = 10080 ways
e. 1 N at 1st but not at last: 1st position is fixed, last position has 8 choices, middle 8
8!
have 8 choices. So, 8× 2!2! = 80640
f. N is not at either end: Each end has 8 and 7 options respectively. The rest 8 can be
8!
arranged normally. So, 8×7× 2!2!2! = 282240
g. Vowels are together: AIIO are all together. Consider them as one group.
4!
Arrangements within the group: 2! = 12
7!
The rest 6 letters with the group make 7 which can be arranged in: 2!2! = 1260
Total arrangements: 12×1260 = 15120

15. 10 coloured marbles placed in a row.

a. All different colours: 10 different marbles. So, 10! arrangements = 3628800
b. Minimum number of coloured marbles to exceed 10000 different patterns: If all
are the same colour, then no different arrangements are possible. Similarly, for
10!
two different coloured marbles, for any combination of (𝑎 + 𝑏) = 10, <𝑎!𝑏!
10000. So, 2 colours are not possible. For 3 different colours of marble as well,
10!
(𝑎 + 𝑏 + 𝑐) = 10, < 10000 for all possible values of (a, b, c). For 4 different
𝑎!𝑏!𝑐!
10!
colours of marble, (𝑎 + 𝑏 + 𝑐 + 𝑑) = 10 𝑎𝑛𝑑 𝑎 = 3, 𝑏 = 3, 𝑐 = 2, 𝑑 = 2, 𝑎!𝑏!𝑐!𝑑! =
25200 > 10000. So, with marbles of 4 different colours, it is possible to get greater
than 10000 patterns.

16. GUMTREE:
7!
a. No restrictions: 2 Es in 7 letters: 2! = 2520
b. Es are together: 2 Es as 1 group and 5 letters to make 6: 6! = 720
c. Es are separated by:
i. 1 letter: A group of 3 blanks with the Es at the corners. There are 5 choices for
the middle letter. The rest 4 with the group can be arranged in 5! ways. So, a
total of: 5×5! = 600 arrangements
ii. 2 letters: Same as above with 2 blanks between the Es. Total = 5×4×4! =
480 arrangements.

© Cambridge University Press 2019 24

Chapter 14 – Combinatorics – Worked solutions

iii. 3 letters: 3 blanks between 2 Es. Total = 5×4×3×3! = 360 arrangements.

iv. 4 letters: 4 blanks between 2 Es. Total = 5×4×3×2×2! = 240 ways.
v. 5 letters: 5 blanks between 2 Es. Total = 5! = 120 arrangements.

d. G is somewhere between the 2 Es: Depending on the number of blanks between

the 2 Es, the letter G has (1, 2, 3, 4, 5) choices respectively. When G has 1 choice,
there can be: 5! = 120 arrangements. When G has 2 choices, there can be
4×2×4! = 192 arrangements. When G has 3 choices, there can be 3!×3!×6 =
216 arrangements. When G has 4 choices, there can be 4×4!×2! =
192 arrangements. When G has 5 choices, there can be 5! = 120 arrangements. So,
total arrangements: 120 + 192 + 216 + 192 + 120 = 840
e. U is between the Es and M to the left: For the case “EUE”, M at 1st place: 4! ways.
M at 2nd place: 3×3! ways. M at 3rd place: 2×3! Ways. M at 4th place: 3! ways.
For the case “E_UE” or “EU_E”, M at 1st place: 2×3×3! = 36 ways. M at 2nd place:
2×3×2×2! = 24 ways. M at 3rd place: 2×3×2! = 12 ways. For the “E_U_E” case, M
at 1st place: 3×3!×2! = 36 ways. M at 2nd place: 3×3! = 18 ways. For the “E_ _U_E”
case, M at 1st place: 4! ways. So, total = (24 + 18 + 12 + 6) + (36 + 24 + 12) +
(36 + 18) + (24) = 210
f. G is to the left of U and M is to the right: Consider it as a group with increasing
5! 4!
blanks each time. “GUM” case: = 60 ways. “G_UM” case: 4C1×2!× 2! = 96 ways.
2!
3! 2!
“G_U_M” case: 4C2×3!× = 108. “G_U_ _M” case: 4C3×4!× = 96 ways. “G__U__M”
2! 2!
5!
case: 4C4× 2! = 60 ways. Total = (60 + 96 + 108 + 96 + 60) = 420

17. GUMTREE + KOALA

In the word “KOALA”, there are 5 letters and they have to be in that particular order.
12!
So, of the total 12, 5 are in particular order: . But in the 12, the letter E is repeated.
5!
12!
Hence, total arrangements: 5!2! = 1995840 arrangements.

18. Bob has 8 different shirts of 4 types. 2 of each type.

All possible arrangements if no two identical shirts are next to each other:
When all the identical shirts are together = 4! = 24 ways.
When 3 identical types are together = 4C3×3!×3! = 144 as 3 places to hang the
remaining pair and the 3 pairs can be arranged in 3! ways.
6!
When 2 identical types are together = 4C2 ×(2!2! − 4! − 2×(3!×3!)) = 504 ways as it
would include all 4 are together and when any 3 are together.
7! 6!
When 1 identical pair is together = 4C1× (2!2!2! − 24 − 3×(3!×3!) − 3× (2!2! − 4! −

2×(3!×3!))) = 984

Required arrangements = Total arrangements – Identical pair together arrangements

© Cambridge University Press 2019 25

Chapter 14 – Combinatorics – Worked solutions

8!
∴ Required arrangements = 2!2!2!2! − 24 − 144 − 504 − 984 = 864 arrangements

19. Derangements 𝐷(𝑛) using inclusion-exclusion principle.

a. Permutations of ABCD: 4 distinct letters → 4! = 24
b. Following letter is at the same position:
i. A: Fix A at 1st position, other 3 can be arranged in 3! = 6 ways.
ii. B: Fix B at 2nd position, other 3 can be arranged in 3! = 6 ways.
iii. C: Fix C at 3rd position, other 3 can be arranged in 3! = 6 ways.
iv. D: Fix D at 4th position, other 3 can be arranged in 3! = 6 ways.
∴ Subtracting from total arrangements: 4! − 4×3! = 0
c. Both A and B are unmoved: A is in 1st position and B is in 2nd, so, the rest 2 can be
arranged in 2! = 2 ways. Same is the case for each of the 2 letters.
d. Equation for 𝐷(4) = 4C0×4! − 4C1×3! + 4C2×2! − 4C3×1! + 4C4×0! = 9
1 1 1 1 1
e. 𝐷(4) = 4! (0! − 1! + 2! − 3! + 4!)
f. The equation for 𝐷(4) is derived from the inclusion-exclusion principle. Instead of
4 if we consider any number 𝑛, first we calculate total permutations of
𝑛 letters/things. Then, we subtract the possibilities when one letter is at its own
position. These include the arrangements when 2 (or more) letters are at their
own positions and are subtracted repeatedly. So, we add the cases when 2 letters
are at the same position. Now, in this we end up adding cases when 3 or more
letters are at their original places. So, we subtract the cases with 3 letters at the
same place. Similarly, the logic continues till we reach 𝑛. This can be expressed as:
𝐷(𝑛) = 𝑛𝐶0 ×𝑛! − 𝑛𝐶1 ×(𝑛 − 1)! + 𝑛𝐶2 ×(𝑛 − 2)! − ⋯ + (−1)𝑛 𝑛𝐶𝑛 ×0! and can
1 1 1 1 (−1)𝑛
be simplified as: 𝐷(𝑛) = 𝑛! (0! − 1! + 2! − 3! + ⋯ + )
𝑛!
𝐷(𝑛) 1 𝐷(𝑛)
g. Explanation for → 𝑒 𝑎𝑠 𝑛 → ∞: The sequence of can be termed as the
𝑛! 𝑛!
probability that none of the letter occurs in its original place. As per the given
result, it means that as 𝑛 → ∞, the ratio of derangements of 𝑛 to the permutations
1
of 𝑛 tends to the value of: 𝑒

© Cambridge University Press 2019 26

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14E

1. (P, Q, R, S, T) 2 people are chosen at random. Possible selections:
= (PQ, PR, PS, PT, QR, QS, QT, RS, RT, ST)
5C2 = 10 total combinations

2. Combinations:
7!
a. 2 people from given 7: 7C2 = 5!2! = 21
7!
b. 3 people from given 7: 7C3 = 3!4! = 35
6!
c. 2 people from given 6: 6C2 = = 15
2!4!
9!
d. 5 people from given 9: 9C5 = 5!4! = 126

3.
a. Combinations from a group of 10:
10!
i. 2 people are chosen: 10C2 = 2!8! = 45
10!
ii. 8 people are chosen: 10C8 = 8!21 = 45
b. The answers are same because this is simply the selection of 2 people i.e., not
selecting 8 people or selection of 8 people i.e., not selecting 2 people irrespective
of the order in which people are selected. nCr = nCn – r

4. 12 men and 8 women select:

12! 8!
a. 5 men and 3 women: 12C5 × 8C3 = 5!7! × 3!5! = 44352
12! 8!
b. 4 women and 4 men: 12C4 × 8C4 = 8!4! × 4!4! = 34650

5. Select 4 numbers from first eight positive integers:

8!
a. No restrictions: 8C4 = 4!4! = 70
b. 2 odd and 2 even numbers: Select 2 from the 4 odd and select 2 from the 4 even.
4C2×4C2
4! 4!
= 2!2! × 2!2! = 36
4! 4!
c. Exactly 1 odd: Select 1 from 4 odd and 3 from 4 even. 4C1 × 4C3 = × = 16
3!1! 1!3!
4!
d. All are even: Select 4 from 4 even numbers 4C4 = 4!0! = 1
e. At least 1 odd: Total combinations = 70. All even combinations = 4
∴ At least 1 odd combinations: 70 − 4 = 66

6. 3 green and 6 blue balls, 4 balls drawn simultaneously at random:

9!
a. Balls may be any colour: 9C4 = 4!5! = 126
3! 6!
b. Exactly 2 green balls: 3C2 × 6C2 = 2!1! × 2!4! = 45

© Cambridge University Press 2019 27

Chapter 14 – Combinatorics – Worked solutions

c. At least 2 green balls: Total combination = 126. Combinations with no green balls:
6C4 = 15. Combinations with 1 green ball: 3C1 × 6C3 = 60.

∴ Combinations with at least 2 green balls = 126 − 15 − 60 = 51

d. More blue balls than green balls: 4 blue or 3 blue 1 green as only possible
combinations => 6C4 + 3C1 × 6C3 = 15 + 60 = 75

7. 6 men and 8 women; select 5 for a committee:

14!
a. No restrictions: select 5 from total 14 => 14C5 = 9!5! = 2002
8!
b. All are females: select 5 from 8 women => 8C5 = 5!3! = 56
6!
c. All are males: select 5 from 6 men => 6C5 = 5!1! = 6
6! 8!
d. Exactly 2 men: 6C2 × 8C3 = 2!4! × 3!5! = 840
8! 6!
e. 4 women and 1 man: 8C4 × 6C1 = 4!4! × 5!1! = 420
f. Majority of women: (0 males + 1 male + 2 male) => 8C5 + 8C4 × 6C1 + 8C3 × 6C2
8! 8! 6! 8! 6!
= 5!3! + 4!4! × 1!5! + 3!5! × 2!4! = 56 + 420 + 840 = 1316
g. A particular man must be included: Select the particular man. The rest 4 can be
13!
selected from the remaining 13 in 13C4 = 4!9! = 715 ways. So, total: 715 ways
h. A particular man must not be included: total selection = 2002. Selections when a
particular man must be included = 715. Selections when a particular man must
not be included = (2002 − 715) = 1287

8.
8!
a. Select 4 letters from “EQUATION”: 8C4 = 4!4! = 70
5!
b. Containing 4 vowels: (E, U, A, I, O) → 5 vowels, select 4 => 5C4 = 1!4! = 5
7!
c. Combinations that contain Q: Fix Q and select 3 from the rest: 7C3 = 3!4! = 35

9. 7 netballers chosen from (A, B, C, D, E, F, G, H, I, J, K, L)

12!
a. No restrictions: 12C7 = 7!5! = 792
11!
b. Captain C is included: Fix C and select 6 from the rest: 11C6 = = 462
6!5!
10!
c. J and K are both excluded: Select from the remaining 10=> 10C7 = 7!3! = 120
d. A is included and H is not: Fix A and remove H. Select 6 from remaining 10 => 10C6
10!
= 6!4! = 210
e. One of F and L included and other excluded: Select 6 from 10 twice => 2× 10C6 =
10!
2× 6!4! = 420. In one case F is fixed and in the other L is selected.

10. (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)
a. Select 5 such that digits are in:

© Cambridge University Press 2019 28

Chapter 14 – Combinatorics – Worked solutions

i. Descending order: Select any 5 digits and then they can be arranged in the
10!
required order. 10C5 = 5!5! = 252
ii. Ascending order: For same reason as above except that the number cannot
start with 0, selections 9C4 = 126
b. The questions involve unordered selections because we can select any required
number of digits from the given numbers and then arrange them in any particular
order as needed by the questions.

11. 12 people and three tables – 1 for 6, 1 for 4 and 1 for 2:

12! 6! 2!
They can be assigned the table as: 12C6 × 6C4 × 2C2 = 6!6! × 4!2! × 2!0! = 13860
Select first 6 for the table, then select 4 from the remaining 6 for the 2nd table, lastly
select the remaining 2 for the last table.

12. 20 students - 10 male, 10 female travel to sports ground. 8 in minibus, 6 in cars, 4 on

bikes and two of them walk. They can be selected in:
20! 12! 6! 2!
a. No restrictions: 20C8 × 12C6 × 6C4 × 2C2 = 12!8! × 6!6! × 4!2! × 2!0! = 1745944200
b. None of the boys walk: Select 2 girls who will walk first and then select people for
each mode of transport from the remaining 18 =>
10C2
10! 18! 14! 8!
× 18C4 × 14C6 × 8C8 = 2!8! × 4!14! × 6!8! × 8!0! = 413513100

13. 10 points in a plane such that no 3 are collinear: P1, P2, …, P10
a. Number of lines that can be drawn through pair of points: This is same as number
10!
of ways two distinct points that can be selected from the given 10. 10C2 = 2!8! = 45
b. Number of triangles that can be drawn with the points as vertices: This is same as
selecting 3 distinct points from the given 10 as none three are collinear. 10C3 =
10!
= 120
3!7!
c. Number of triangles with P1 as a vertex: Select point P1 and select any 2 points
9!
from the remaining 9. 1C1 × 9C2 = 1× 2!7! = 36
d. Number of triangles with P1 and P2 as vertices: Fix P1 and P2 as 2 vertices and select
1 from the remaining 8. 2C2 × 8C1 = 1×8 = 8

14. 10 points in a plane such that 5 of them are collinear but no other set of 3 are:
5!
a. Set of 3 from the 5 collinear points: 5C3 = 3!2! = 10
b. Number of triangles from 3 points: Select 2 points from the set of collinear points
and 1 from the set of non-collinear ones or select 2 from the set of non-collinear
points and one from the set of collinear ones or select 3 from the set of non-
5! 5! 5! 5! 5!
collinear ones => (5C2 × 5C1) + (5C1× 5C2) + (5C3) = 2!3! × 1!4! + 1!4! × 2!3! + 2!3! =
50 + 50 + 10 = 110

© Cambridge University Press 2019 29

Chapter 14 – Combinatorics – Worked solutions

15. Standard deck of 52 playing cards, deal hand of 5 cards:

a. Black cards only: Half the cards in the deck are black. So, dealing the hand of five
26!
from the 26 cards => 26C5 = 5!21! = 65780
b. Diamonds only: 13 diamond cards. So, dealing the hand of five from the 13 cards
13!
only => 13C5 = 5!8! = 1287
c. Containing all 4 kings: All 4 kings can be selected from the set of 4 kings in 1 way
and 1 card from the remaining 48 => 4C4 × 48C1 = 1×48 = 48
d. 3 diamonds and 2 clubs: Select 3 from set of 13 diamonds and 2 from a set of 13
13! 13!
clubs => 13C3 × 13C2 = 3!10! × 2!11! = 22308
e. 3 twos and another pair: 3 twos can be selected in 4 ways and the pairs can be
selected by taking a particular number from the set of 12 and another card from
the 3 same valued cards of different suits. Further there are choice of 2 pairs for
each possibility due to 4 cards of each value => (4C3 × 12C1 × 3C1) × 2 =
4×12×3×2 = 288
f. One pair and 3 of a kind: 3 of a kind can be selected in 4C3 ways. The value for the
card can be chosen in 13C1 ways. From the remaining 12, one pair can be chosen in
(12C1 × 3C2) ×2. So, total selections => 4×13×12×3×2 = 3744

16. Divide group of people

a. Group of 6 people:
i. 2 unequal non-empty groups: Select one person for 1st group and rest for
another or select 2 people for 1st group and rest for the 2nd group. => 6C1 + 6C2
= 6 + 15 = 21
6!
ii. 2 equal groups: Select 3 people for the first group. => 6C3 = 3!3! = 20
b. Group of 4 people:
i. 2 unequal non-empty groups: Select one person for 1st group and rest for
another. => 4C1 = 4
4!
ii. 2 equal groups: Select 2 people for the 1st group. => 4C2 = 2!2! = 6
c. Group of 8 people:
i. 2 unequal non-empty groups: Select one person for 1st group and rest for
another or select 2 people for 1st group and rest for the 2nd group or select 3
people for the 1st group and rest for the 2nd. => 8C1 + 8C2 + 8C3 = 8 + 28 +
56 = 92
8!
ii. 2 equal groups: Select 4 people for the 1st group. => 8C4 = 4!4! = 70

17. Number of diagonals in: Diagonal is the line joining two non-adjacent vertices. So,
when we count the number of diagonals, we have to deduct the sides from the
selection as selecting 2 points would yield the selection of 2 adjacent points as well.
4!
a. Quadrilateral: 4 vertices. So, 4C2 − 4 = 2!2! − 4 = 2
5!
b. Pentagon: 5 vertices, using same logic as above => 5C2 − 5 = 2!3! − 5 = 5

© Cambridge University Press 2019 30

Chapter 14 – Combinatorics – Worked solutions

10!
c. Decagon: 10 vertices => 10C2 − 10 = 2!8! − 10 = 35
𝑛! 𝑛2 −𝑛−2𝑛 𝑛(𝑛−3)
d. Polygon with n sides = nC2 − 𝑛 = (𝑛−2)!2! − 𝑛 = =
2 2

18. 12 points around a circle

a. Number of triangles formed from selecting 3 points: As all points are on the circle,
no set of 3 points is collinear. Selecting any 3 will yield a triangle. So,
12C3
12!
= 3!9! = 220
12! 9!
×
b. Pairs of triangles with distinct vertices: (12C3 × 9C3)/2 = 9!3! 2 6!3! = 9240
Division by 2 as every triangle was counted twice in the selection.

19. S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19}

a. Subsets of S: 10Cr where r = (0, 1, 2, 3, 4, 5, 6,7, 8, 9, 10). Total number of subsets =
210 = 1024
b. Subsets of S containing at least 3 numbers: 1024 − 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑡ℎ𝑎𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛 <
3 𝑛𝑢𝑚𝑏𝑒𝑟𝑠 => 1024 − 1 − 10 − 45 = 968
c. Subsets with at least 3 numbers not containing 7: 9C3 + 9C4 + 9C5 + 9C6 + 9C7 + 9C8
+ 9C9 = 84 + 126 + 126 + 84 + 36 + 9 + 1 = 466
d. Subsets with at least 3 numbers not containing 7 and containing 19: Eliminate 7
and fix 19 as an element. Selecting the rest elements from 8 numbers left.
8C2 + 8C3 + 8C4 + 8C5 + 8C6 + 8C7 + 8C8 = 28 + 56 + 70 + 56 + 28 + 8 + 1 = 247

20. {1, 2, 3, 4, 5, 6, 7, 8, 9} 2 numbers selected such that their sum is:

4! 5!
a. even: Either both the number are even, or both are odd: 4C2 + 5C2 = 2!2! + 2!3! =
6 + 10 = 16
b. odd: One number is even, and one is odd: 4C1×5C1 = 4×5 = 20
c. divisible by 3: possible sums are (3, 6, 9, 12, 15). Sum 3 can occur in 1 way (1+2),
6 can occur in 2 ways (1+5, 2+4), 9 can occur in 4 ways (1+8, 2+7, 3+6, 4+5),
12 can occur in 3 ways (3+9, 4+8, 5+7) and 15 can occur in 2 ways (7+8, 9+6).
So, a total of 1 + 2 + 4 + 3 + 2 = 12
d. divisible by 5: possible sums (5, 10, 15). Sum 5 can occur in 2 ways (1+4, 2+3),
10 can occur in 4 ways (1+9, 2+8, 3+7, 4+6) and 15 can occur in 2 ways (6+9,
7+8). So, total of 2 + 4 + 2 = 8
e. divisible by 6: Number of even divisible by 3. Meaning 6 and 12. So, total of 3 +
2=5

21. 10 basketballers in a team:

10!
a. Select starting 5: Select any 5 from the 10. 10C5 = 5!5! = 252
b. Split into 2 teams: Select any 5 for 1st team But as both teams are considered in
this case the selections need to be halved as when we select say (1, 2, 3, 4, 5) as

© Cambridge University Press 2019 31

Chapter 14 – Combinatorics – Worked solutions

the first team, the second team is (6, 7, 8, 9, 10) and hence the selection where the
10!
5!5!
first team is (6, 7, 8, 9, 10) is same and counted twice. 10C5/2 = = 126
2

22. 9 players to be divided in 2 teams of 4 and 1 umpire:

9! 5! 1!
a. Number of ways the teams can be formed: 9C4×5C4×1C1÷ 2 = 5!4! × 4!1! × 2 = 315
b. 2 particular people not on the same team: Select 1 of them as an umpire or select
1 of them in a team and then select the other in another team. =>
2×70×1+2×35×4×1 140+280
(2C1×8C4×4C4 + 2C1×7C3×4C1×4C4)/2 = = = 210
2 2

The division by 2 in both the cases is for the same reason as in Q21 part b.
23. Considering prime factorizations, the positive divisors of:
When a selection is to be made from a set of 𝑟 identical objects, it can be done in
(𝑟 + 1) ways as you can select 𝑚 objects where 1 ≤ 𝑚 ≤ 𝑟 in 1 ways and you can
select 0 objects in 1 way.
a. 23 ×32 = 72 => As in the rime factors we have three 2s and two 3s, the positive
divisors of 72 can be obtained by selecting a group of numbers from the available
factors, i.e., [2, 2, 2, 3, 3]. This is same as separating 5 objects with 3 of a kind and
2 of another kind in 2 groups. This can be done in (3 + 1)×(2 + 1) = 12 ways.
b. 1000000 = 26 ×56 . Number of positive divisors = (6 + 1)(6 + 1) = 49
c. 315000 = 3×3×5×7×23 ×53 = 23 ×32 ×54 ×71 . Number of positive divisors =
(3 + 1)×(2 + 1)×(4 + 1)×(1 + 1) = 120
d. 2𝑎 ×5𝑏 ×13𝑐 => Number of positive divisors = (𝑎 + 1)×(𝑏 + 1)×(𝑐 + 1)

24.
a. Six faces of a number of identical cubes painted in 6 different colours. Number of
different cubes that can be formed is the number of ways the cube can be oriented
assuming each side is similar. Assign the numbers to each side of the cube as (1, 2,
3, 4, 5, 6) like a die. Fix one side facing up. This can be done in 6 ways. This
automatically fixes the side facing down. Fix one side facing right. This can be done
in 4 ways and it automatically fixes the other 3 sides as front, back and left. If all
the 6 sides were different it could be arranged in 6! Ways. So, total number of
6!
different cubes possible are: 6×4 = 30
b. Fitting a die in a box: This is same as the fixing of cube problem explained in the
above question. Fix a number facing up. It can be done in 6 ways. Fix a number
facing right or east. This can be done in 4 ways. So, 6×4 = 24

25. In the 6×4 grid, 10 steps are required to reach to B from A. The only steps possible
are downwards D or right R. From the dimensions of the grid and locations of A and
B, any journey would require 6 Ds and 4 Rs. So, it is a selection of 4 Rs in 10 steps.
a. Number of routes possible:

© Cambridge University Press 2019 32

Chapter 14 – Combinatorics – Worked solutions

10!
i. No restrictions: 10C4 = 4!6! = 210
ii. If C must be included in the path: First 4 steps should have 2 Rs => 4C2×6C2 =
4! 6!
× 2!4! = 90
2!2!
9!
iii. Cannot move along top line of grid: 1st step can’t be R=> 9C4 = 5!4! = 126
iv. Can’t move along 2nd row from top: Starting with R and followed by 2 Ds or
start with 2 Ds => 8C4 + 7C3 + 6C2 + 5C1 + 4C0 = 70 + 35 + 15 + 5 + 1 = 126
b. Any possible route must pass through one of the crossed points. So, possible paths
can be described as:
First 4 Rs and then 6 Ds => 4C4 × 6C0
First 3 Rs, 1 D and then 1 R in rest 6 steps => 4C3 × 6C1
First 2 Rs, 2Ds and then 2 R in rest 6 steps => 4C2 × 6C2
First 1 R, 3 Ds and then 3 Rs in rest 6 steps => 4C1 × 6C3
First 4 Ds, then 4 Rs in rest 6 steps => 4C0 × 6C4
So, from part (a) section (i) Total number of ways = 10C4
Hence, 10C4 = 4C0 × 6C4 + 4C1 × 6C3 + 4C2 × 6C2 + 4C3 × 6C1 + 4C4 × 6C0
c. Consider the diagonal from (2, 4) to (6, 1). All possible paths must pass through
points on this diagonal. So, possible paths can be described as:
4 Rs in first 5 steps => 5C4 × 5C0
3 Rs in 1st 5 steps and 1 in next 5 => 5C3 × 5C1
2 Rs in 1st 5 steps and 2 in next 5 => 5C2 × 5C2
1 R in 1st 5 steps and 3 in next 5 => 5C1 × 5C3
No R in 1st 5 and 4 Rs in next 5 => 5C0 × 5C4
Hence, 10C4 = 5C0 × 5C4 + 5C1 × 5C3 + 5C2 × 5C2 + 5C3 × 5C1 + 5C4 × 5C0
d. 6 × 6 grid. So, 12 step paths with 6 Rs and 6 Ds. So, total possible paths: 12C6
Also, using the identity: nCr = nCn – r
1st 6 steps are Rs => 6C6 × 6C0 = (6C6)2
5 Rs in 1st 6 steps => 6C5 × 6C1 = (6C5)2
4 Rs in 1st 6 steps => 6C4 × 6C2 = (6C4)2
3 Rs in 1st 6 steps => 6C3 × 6C3 = (6C3)2
2 Rs in 1st 6 steps => 6C2 × 6C4 = (6C2)2
1 R in 1st 6 steps => 6C1 × 6C5 = (6C1)2
No Rs in 1st 6 steps => 6C0 × 6C6 = (6C0)2
Hence, 12C6 = (6C0)2 + (6C1)2 + (6C2)2 + (6C3)2 + (6C4)2 + (6C5)2 + (6C6)2

26. 3 categories design, technique and originality each marked out of 100. Total score of
200. That means 100 marks are lost from the total. Let marks lost in each category be
𝑎, 𝑏, 𝑐 respectively. 0 ≤ (𝑎, 𝑏, 𝑐) ≤ 100. So, it is same as number of solutions of 𝑎 + 𝑏 +
𝑐 = 100 for 𝑎, 𝑏, 𝑐 as whole numbers less than 101. This is same as dividing 100
identical objects in 3 groups using 2 separators. Select 2 from 102 objects. 102C2 ways
102! 102×101
= 100!2! = = 5151 ways.
2

© Cambridge University Press 2019 33

Chapter 14 – Combinatorics – Worked solutions

27. 1 ≤ (𝑎, 𝑏, 𝑐) ≤ 30 and (𝑎 + 𝑏 + 𝑐) is divisible by 3. Between 1 and 30, there are 10

multiples of 3, 10 numbers of the form (3x + 1) and 10 numbers of the form (3x + 2).
Multiples of 3 can be selected in the following ways as: 3 multiples of 3, 3 numbers of
the form 3x + 1 or 1 multiple of 3 and 1 of the form 3x + 1 and 1 of the form 3x + 2.
It can be done as: 3× 10C3 + 10C1×10C1×10C1 = 3×120 + 10×10×10 = 1360

28.
4!
a. 4 players for doubles tennis games. Select 2 people for a team: 4C2/2 = 2!2!×2 = 3
b. Arrange 2 doubles tennis game from a group of 8 players: Select 4 people for 1
game and each game can be arranged in 3 ways as in part (a). ( 8C4/2) ×3×3 =
8!
×3×3 = 315
4!4!×2
c. 6 mean and 6 women to play 3 games of doubles tennis. Number of pairings
possible with:
i. No restriction: Select 4 people for each game and each game can be arranged
12! 8! 33
in 3 ways. (12C4× 8C4/3!) ×3×3×3 = 8!4! × 4!4! × 3! = 155925
ii. Each game is of mixed doubles: Select 2 men from 6 then 2 men from 4 for the
first two games which leaves the last 2 for the third. Each woman can be paired
with a man thus selected giving 6! more possibilities. So, (6C2×4C2/3!) ×6! =
6! 4! 6!
× 2!2! × 3! = 10800
4!2!

29. Bob has 2𝑛 shirts with 2 shirts of each 𝑛 type. They are to be arranged such that no
two shirts of same type are next to each other.
a. Show that number of arrangements are:
nC0(2n)!2-n – nC1(2n – 1)!21 – n + nC2(2n – 2)!22 – n + … + (–1)n nCn n! 20
(2𝑛)!
If there were no restrictions, total arrangements would be: = nC0(2n)!2-n
2𝑛
Now, as the paired combinations are not allowed subtracting the number of 1 pair
(2𝑛−1)! (2𝑛−1)!
of shirts: 𝑛× = nC1×
2𝑛−1 2𝑛−1
But, it would also include arrangements that are 2 pairs and would be deducted
(2𝑛−2)!
twice, so adding the arrangements with 2 paired arrangements: nC2× 2𝑛−2
Similarly, based on the inclusion-exclusion principle, every alternate term will be
subtracted and added. So, finally it would yield the number of arrangements as:
nC0(2n)!2-n – nC1(2n – 1)!21 – n + nC2(2n – 2)!22 – n + … + (–1)n nCn n! 20
2!
b. 𝑛 = 1 => Total arrangements = = 1, allowed arrangements = none or all as
2
only 2 shirts of identical type are there.
4! 4! 3!
𝑛 = 2 => Total arrangements = 22 = 6, allowed arrangements = 22 − 2× 2 +
2! 6
1× 20 = 2 ∴ Ratio = 2 = 3

© Cambridge University Press 2019 34

Chapter 14 – Combinatorics – Worked solutions

6! 6! 5!
𝑛 = 3 => Total arrangements = 23 = 90, allowed arrangements = − 3× 22 +
23
4! 3! 90
3× 2 − 1× 1 = 30 ∴ Ratio = 30 = 3
8! 8! 7!
𝑛 = 4 => Total arrangements = 24 = 2520, allowed arrangements = 16 − 4× 8 +
6! 5! 4! 2520 35
6× 4 − 4× 2 + 1× 1 = 864 ∴ Ratio = = 13 = 2.91667
864
10! 10!
𝑛 = 5 ∴ Total arrangements = = 113400, allowed arrangements = −
25 32
9! 8! 7! 6! 5! 113400 135
5× 16 + 10× 8 − 10× 4 + 5× 2 − = 39480 ∴ Ratio = = = 2.872
1 39480 47
12! 12!
𝑛 = 6 =>Total arrangements = = 7484400, allowed arrangements = −
64 64
6×11! 15×10! 20×9! 15×8! 6×7! 6! 7484400
+ − + − + = 2631600 ∴ Ratio = 2631600 = 2.844
32 16 8 4 2 1

30. Binary strings with exactly 𝑎 0s and at most 𝑏 1s.

a. Binary string with exactly 𝑎 0s that contains:
i. No 1s: We have 𝑎 number of 0s and to make binary strings with 𝑎 0s. So, aC0
ii. One 1: We have 𝑎 number of 0s and one 1 to make binary strings. So, (𝑎 + 1)
gaps to select a spot for the only 1. (a + 1)C1
iii. Two 1s: We got 𝑎 number of 0s and two 1s to make binary strings. So, (𝑎 + 2)
gaps to select a spot for the two 1s. (a + 2)C2
iv. Three 1s: 𝑎 number of 0s and three 1s to make binary strings. So, (𝑎 + 3) spots
to select places for the three 1s. (a + 3)C3
v. r 1s: 𝑎 number of 0s and 𝑟 number of 1s to make binary strings. So, (𝑎 + 𝑟)
gaps to select spots for the 𝑟 1s. (a + r)Cr
b. 𝑁 = Number of binary strings that contain exactly 𝑎 0s and 𝑏 1s. From the part (a)
sub-part (v) it can be generalized as:
𝑁 = aC0 + (a + 1)C1 + (a + 2)C2 + (a + 3)C3 + … + (a + b)Cb
c. 𝑆 is a binary string with 𝑎 0s and 𝑟 1s. Initially, (𝑎 + 𝑟) digits. Then, a 0 to the right
and (𝑏 − 𝑟) 1s are added to the string.
∴ Total 0s = 𝑎 + 1, Total 1s = 𝑟 + (𝑏 − 𝑟) = 𝑏, Total string length = (𝑎 + 1) + 𝑏
d. Following the process in part (c) in reverse order, a string with (𝑎 + 1) 0s and 𝑏 1s
can be converted to a string with 𝑎 0s and at most 𝑏 1s by removing the last 0 in
the string and the 1s that follow it. For an inverse mapping to exist, it has to be a
one-to-one correspondence.
e. Length of string 𝑁 = select 𝑏 places from (𝑎 + 𝑏 + 1) spots for the 1s. So,
𝑁 = (a + b + 1)Cb
f. From the part (b) and part (e), it follows that
𝑁 = aC0 + (a + 1)C1 + (a + 2)C2 + (a + 3)C3 + … + (a + b)Cb = (a + b + 1)Cb

© Cambridge University Press 2019 35

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14F

1. Select 3 people from a group of 9 members.
9!
a. Number of committees = 9C3 = 3!6! = 84
b. There are 5 men, probability that selected committee is all males = 5C3/9C3 =
5!
3!2! 10
9! = 84 = 0.06
3!6!

2. 4 pieces of paper from 10 are drawn at random. Probability that:

a. Numbers drawn are 1, 2, 3 and 6: All 4 numbers can be drawn in 1 way and any 4
1
numbers can be drawn in 10C4 = 210 ways. Hence, the probability = 210
b. Number 9 is one of the drawn: Select 9 in 1 way and other 3 in 9C3 ways. So, the
9!
1× 4 2
3!6!
probability = 10! = 10 = 5 = 0.4
4!6!
c. Number 8 is not drawn: 1 − when 8 is selected. 8 is selected with same probability
2 3
as the probability of 9 ∴ 1 − 5 = 5 = 0.6
d. Number 7 is drawn and 1 is not: Select 7 in 1 way and select 3 others from 8 out
8!
1× 24 4
3!5!
of 9 as 1 is not included. So, the probability = 10! = 90 = 15
6!4!

3. 3 red, 7 yellow and 5 blue balls and 3 balls are drawn at random, probability that:
7!
3!4! 1
a. All 3 are yellow: Select 3 from the 7 yellow by total selections = 15! = 13
3!12!
b. All balls are same colour: Select all from one colour and add probabilities =
1 35 10 46
(3C3/15C3) + (7C3/15C3) + (5C3/15C3) = 455 + 455 + 455 = 455
5 3
c. 2 red and 1 blue balls: 3C2×5C1/15C3 = 3× 455 = 91
3×5×7 3
d. All balls are of different colour: 3C1×7C1×5C1/15C3 = = 13
455

4. Select 5 from 8 AFL and 7 soccer players. The probability that:

8
a. Only AFL footballers: 8C5/15C5 = 429
21 1
b. Only soccer players: 7C5/15C5 = 3003 = 143
35×28 140
c. 3 soccer and 2 AFL players: 7C3×8C2/15C5 = = 429
3003
8 421
d. At least 1 soccer player: 1 − no soccer players = 1 − 429 = 429
8!
8 ×7 2
e. At most 1 soccer player: no soccer player + 1 soccer player = 429 + 4!4! = 11
3003
f. Ian, a particular soccer player is selected: Select Ian and select 4 out of rest 14 and
14!
4!10! 1
total selections: 1× 14C4/15C5 = 15! =3
5!10!

52!
5. Standard 52 card pack and 3 cards selected at random= 52C3 = 3!49! = 22100. The
probability that:

© Cambridge University Press 2019 36

Chapter 14 – Combinatorics – Worked solutions

a. They are jack of spades, two of clubs and seven of diamonds: These 3 cards are
1
selected in one way. Hence, probability = 22100
4
b. All 3 are aces: three aces can be selected in 4C3 = 4 ways. So, probability = 22100 =
1
5525
c. All are diamonds: 3 Diamond cards can be selected in 13C3 = 286 ways. Hence,
286 11
probability = 22100 = 850
d. All are of same unit: Select one unit in 13C1 ways and 3 of that unit in 4C3 ways.
13×4 1
Hence, probability = 22100 = 425
e. All are picture cards: Total 4×3 = 12 picture cards so 12C3= 220 ways. Hence,
220 11
probability = 22100 = 1105
f. 2 are red and 1 is black: 2 reds can be selected in 26C2 ways and 1 black in 26C1
25×13×26 13
ways. So, probability = 22100 = 34
g. One of each unit 7, 8, and 9: Each of the unit can be selected in 4C1 ways. So,
64 16
4×4×4 = 12 ways. Hence, probability = 22100 = 5525
h. 2 sevens and 1 six: These can be selected in 4C2 = 4 and 4C1 = 6 ways. Hence,
24 6
probability = 22100 = 5525
i. Exactly 1 diamond: Select 1 diamond from 13 and select 2 from the 39. This can
13×39×19 741
be done in: 13C1 × 39C2 ways. Hence probability = 22100 = 1700
j. At least 2 are diamonds: 1 − (𝑛𝑜 𝑑𝑖𝑎𝑚𝑜𝑛𝑑𝑠 𝑜𝑟 1 𝑑𝑖𝑎𝑚𝑜𝑛𝑑) => 39C3 + 39C2×13C1.
39×38×37 39×38×13
+ 361 64
6 2
Hence, probability = 1 − = 1 − 425 = 425
22100

6. 52 cards and 3 drawn 1 at a time with replacement, meaning repetition allowed.

Three cards can be drawn from the set in 52×52×52 = 140608
a. Drawn cards are jack of spades, two of clubs and seven of diamonds: These 3 cards
6 3
can be drawn in: 3! ways. Hence, the probability = 140608 = 70304
64 1
b. All 3 are aces: 3 aces can be selected in 43 = 64 ways. So, probability 140608 = 2197
c. All are diamonds: 3 diamonds in 3 draws can be selected in 13C1×13C1×13C1=
2197 1
13×13×13 = 2197 ways. Hence, probability = 140608 = 64
d. All are same suit: there are 52 possibilities for the first card. Then, only 13
possibility for the second (same suit) and 13 for the third). Hence the probability
52×13×13 1
= 140608 = 16
e. All are picture cards: Every time a card is drawn, the probability of selecting a
12 12 12 12 27
picture card is: 52. Hence, the probability = 52 × 52 × 52 = 2197
f. 2 red and 1 black: Select 2 from the 26 red and 1 from the 26 black. Select a
position for the black card from the three. Probability of this event is =
26 26 26 3 3
× × × C 1=
52 52 52 8
g. One of each unit 7, 8 and 9: 3 numbers in 3 slots so 3! ways and each can be drawn
4 43 6
with the probability of: 52. Hence, probability = 3!× 523 = 2197

© Cambridge University Press 2019 37

Chapter 14 – Combinatorics – Worked solutions

h. 2 sevens and 1 six: 3 places to select for the six. Each of the unit can be drawn with
4 43 3
the probability of 52. So, probability = 3× 523 = 2197
i. Exactly 1 diamond: Select one draw out of 3 in 3 ways. A diamond can be drawn
13 13
with the probability 52 every draw. So, probability = 3× 52. The probability that
39 3 3 3 27
the other two draws are not diamonds is 52. Hence probability = 4 × 4 × 4 = 64
393 27 10 5
j. At least 2 are diamonds: 1 − 𝑛𝑜 𝑑𝑖𝑎𝑚𝑜𝑛𝑑𝑠 𝑜𝑟 1 𝑑𝑖𝑎𝑚𝑜𝑛𝑑 = 1 − 523 − 64 = 64 = 32

7. 3 boys and 3 girls sit in a row. Total arrangements = 6!. The probability that:
a. Boys and girls alternate: Either girl is first, or boy is first, and each can be arranged
2×3!×3! 1
in 3 seats. Hence, probability = 6! = 10
b. Boys sit together, and girls sit together: Each group of 3 can be arranged in 3! ways
2×3!×3! 1
and the groups can be arranged in 2 ways. Hence, probability = 6! = 10
c. Two specific girls sit next to each other: Group of two girls arranged in 2! ways as
2!×5! 1
one with 4 others arranged in 5! ways. Hence, probability = 6! = 3

8. Family of 5 seated in a row. Total arrangements = 5!. The probability that:

a. Parents at the ends and children in the middle: Parents at the ends in 2 ways and
2×3! 1
3 children in the middle in 3! ways. Hence, probability = 5! = 10
b. Parents sit together: Parents as one group arranged in 2 ways with the children
2×4! 2
and combined arranged in 4! ways. Hence, probability = 5! = 5

9. 6 people in a row including Patrick and Jessica. Total arrangements = 6! Ways

a. Patrick and Jessica at the ends: They can sit at the ends in 2 ways and the rest can
2×4! 1
be arranged in 4! ways in the middle. Hence, probability = 6! = 15
b. Patrick and Jessica are not next to each other: 1−
2×5! 2
𝑃𝑎𝑡𝑟𝑖𝑐𝑘 𝑎𝑛𝑑 𝐽𝑒𝑠𝑠𝑖𝑐𝑎 𝑎𝑟𝑒 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 = 1 − 6! = 3

10. “PROMISE” 7 unique letters. Total arrangements = 7!

a. Start with R and end with S: Assign R and S to first and last positions. Rest 5 can
5! 1
be arranged in 5! ways. Hence, probability = =
7! 42
b. P and R are next to one another: Group of P and R in 2! ways and group with other
2!×6! 2
letters in 6! ways. Hence, probability = 7! = 7
c. P and R separated by at least 3 letters: Three cases of 3 or more blanks in between.
When 3 letters in between → 5C3×3!×3!×2 = 720
When 4 letters in between → 5C4×4!×2!×2 = 480
When 5 letters in between → 5C5×5!×2 = 240
720+480+240 2
Hence, probability = =
7! 7
d. Vowels and consonants alternate: 3 vowels so the arrangements starting with
4!3! 1
consonants. Hence, probability = 7! = 35

© Cambridge University Press 2019 38

Chapter 14 – Combinatorics – Worked solutions

e. Vowels are together: 3 vowels as 1 group and arranged in 3! ways and with other
3!5! 1
letters total arranged in 5! ways. Hence, probability = 7! = 7

6!
11. (3, 3, 4, 4, 4, 5) arranged to make a 6-digit number. Total arrangements = 2!3! = 60
5!
a. Even number: Last digit is 4. Other can be arranged in = 30 ways. Hence,
2!2!
30 1
probability = 60 = 2
5!
b. It ends in 5: Assign last digit as 5. Others can be arranged in 3!2! = 10 ways. Hence,
10 1
probability = 60 = 6
4!
c. 4s occur together: Treat the 4s as one unit and arranging the 4 units in =
2!
12 1
12 ways. Hence, probability = 60 = 5
d. Starts with 5 and 4s and 3s alternate: Only one way and one such number possible.
1
Hence, probability = 60
5! 1 2
e. 3s are not together: 1 − 3𝑠 𝑎𝑟𝑒 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 = 1 − 3!×60 = 1 − 3 = 3

7!
12. “PRINTER” 7 letters with 2 Rs. Total arrangements = 2! = 2520. The probability that:
6!
a. Word starts with E: Assign E as 1st letter and arrange remaining 6 in 2! = 360 ways.
360 1
Hence, probability = 2520 = 7
b. Letters I and P are next to each other: Considering I and P as a group with
6!
6! 2!× 2
2!
2! arrangements and arranging the 6 in 2! ways. Hence, probability = 2520 =7
c. There are 3 letters between N and T: Select 3 letters from 5. This can be done in
3!
5C3 in 10×3!×2× ways. Hence, probability =
360 1
=7
2! 2520
d. At least 3 letters between N and T: 3 cases with 3 letters, 4 letters or 5 letters in
1 2!
the middle. For 3 letters, the probability = 7. For 4 letters, 5C4 ×4!×2!× 2! and for
1! 1 240 120 2
5 letters, 5C5×5!×2!× 2!. Hence, total probability = 7 + 2520 + 2520 = 7

6!
13. “KETTLE” 6 letters with 2 Es, 2 Ts. Total arrangements = 2!2! = 180
a. 2 Es are together: Consider them as 1 group and with the rest, they can be
5! 60 1
arranged in = 2! = 60. Hence, probability = 180 = 3
1 2
b. 2 Es are not together: 1 − 2 𝐸𝑠 𝑎𝑟𝑒 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 = 1 − 3 = 3
c. 2 Es and 2 Ts are together: Consider the 2 Es and 2 Ts as one group each. Thus, the
4! 2
4 letters can be arranged in 4! ways. Hence, probability = 180 = 15
4!
d. Es and Ts are together in one group: 4 letters as 1 group can be arranged in 2!2! =
6 ways. Together with other 2 letters, it can be arranged in 3! = 6 ways. Hence,
6×6 1
probability = 180 = 5

© Cambridge University Press 2019 39

Chapter 14 – Combinatorics – Worked solutions

13!
14. “ENTERTAINMENT” 13 letters with 3 Es, 3 Ts, 3 Ns. Total arrangements = (3!)3 =
28828800
11!
3!3! 1
a. Es are together: 3 Es as 1 group = = 26
28828800
10!
b. 2 Es are together and 1 is apart: Arrange the letters other than Es in 3!3! ways.
Group 2 Es together as one and select 2 of the 11 gaps between the other letters.
10! 11!
× 5
3!3! 2!9!
Hence, probability = 28828800 = 13
10!
c. Es are apart: The letters other than Es can be arranged in 3!3! ways. Now there are
11 blanks around these 10 letters in which Es can be inserted. So, 11C3 ways. Hence,
10! 11!
× 15
3!3! 8!3!
probability = 28828800 = 26
d. Start and end with E: Fix Es at 1st and last position. The rest 11 letters can be
11! 1108800 1
arranged in 3!3! ways. Hence, probability = 28828800 = 26

15. Tank has 20 tagged and 80 untagged fish. 4 fish selected at random and put back. Total
possible combinations: 100C4 = 3921225
a. No tagged fish selected: 80C4 = 1581580. Hence, probability = 0.4033
b. At least 1 tagged fish selected: 1 − 𝑛𝑜 𝑡𝑎𝑔𝑔𝑒𝑑 𝑓𝑖𝑠ℎ 𝑠𝑒𝑙𝑒𝑐𝑡𝑒𝑑 = 1 − 0.4033 =
0.5966 ≈ 0.597
c. No tagged fish selected for a week: (Probability of selecting no tagged fish) 7 =
(0.403)7 = 0.00174
d. No tagged fish on exactly 3 of 7 days in a week: 7C3×(0.403)3 (0.597)4 = 0.291

16. 7 white and 5 black discs. 3 discs chosen at random. The probability that all black if:
12! 5!
a. No replacement: Total selections = 12C3 = 3!9! = 220, required discs = 3!2! = 10.
10 1
Hence, probability = 220 = 22
b. With replacement: Total selections = 123 = 1728, required possible selections =
125
53 = 125. Hence, probability = 1728 = 0.0723
c. Disc of opposite colour added after each draw: Total selections = 123 , required
60 5
possible selections = 5×4×3 = 60. Hence, probability = 1728 = 144

17. 6 people to be divided in 2 groups each with at least 1 person. Each person has 2
choices so, 26 possibilities but no group can be empty so deducting 2 26 − 2 = 62
20 10
a. 3 people in each group: Select 3 from 6, 6C3 = 20 Hence, probability = 62 = 31
b. 2 in one group and 4 in other: Select 2 from 6, 6C2 × 2 for each group. Hence,
30 15
probability = 62 = 31
c. 1 group of 5 and an individual: Select 1 from 6 and could be for any group, 6C1×2.
12 6
Hence, probability = 62 = 31

5!
18. 3-digit number from (3, 4, 5, 6, 7) without repetition. Total number = 5P3 = 2! = 60

© Cambridge University Press 2019 40

Chapter 14 – Combinatorics – Worked solutions

1
a. Number is 473: one way. Hence, probability = 60
36 3
b. Number is odd: 3 choices for last digit: 3×4×3 = 36. Hence probability = 60 = 5
12 1
c. Number divisible by 5: Units digit is 5. 4P2 = 12. Hence, probability = 60 = 5
d. Number divisible by 3: (3+4+5), (4+5+6), (3+5+7), (5+6+7) are the
combinations that would yield a number divisible by 3. Each combination can be
3! 2
arranged in 3! ways. Hence, probability = 4× 60 = 5
3 1
e. Number starts with 4 and ends with 7: 3 such numbers. Probability = 60 = 20
f. Number contains digit 3: 3 is selected and can have 3 places. Others in 4P2=
12 3
12 ways. Hence, probability = 3× 60 = 5
g. Number contains 3 and 5: Select 1 from rest, 3C1 and arrange the 3 in 3! ways.
6 1
Hence probability = 60 = 10
6 9
h. Number contains 3 or 5: 1 − 𝑛𝑜 3 𝑜𝑟 5 = 1 − 60 = 10
6 1
i. All odd digits: 3 odd choices so 3! ways. Hence, probability = 60 = 10
36
j. Number > 500: 3 choices for 1st digit. So, 3×4×3 = 36. Hence, probability = 60 =
3
5

19. (1, 2, 3, 4) to form 1, 2, 3, or 4-digit numbers. Total possibilities: 4 one-digit, 12 two-

digit, 24 three-digit and 24 four-digit numbers. Total = 64
24 3
a. 3-digit number: Probability = 64 = 8
2+6+12+12 1
b. It is even: Probability = =2
64
c. >200: some 3-digit and all 4-digit. 3-digit → 1st digit has 3 choices, so 18 numbers.
18+24 21
Probability = 64 = 32
d. Odd and > 3000: only 4 digits starting with 3 or 4 and ending with 1 or 3. 2 starting
2+4 3
with 3 and 4 starting with 4. Hence, probability = 64 = 32
e. Divisible by 3: 1 one-digit, 4 two-digit, 12 three-digit and 0 4-digit. Hence,
1+4+12 17
probability = 64 = 64

20.
a. 6 Labor and 5 Liberal senators. Select 5. Total selections = 11C5 = 462
Labor has majority, so either 3, 4 or 5 senators of Labor. Probability = (6C35C2 +
6C45C1 + 6C55C0)/462 =
281
462
3
b. N Labor and 5 Liberal senators. Probability of having Labor majority > 4 = 0.75
3 91
For N = 6, P(Labor) < 4 from part (a). So, try with N = 7. P(Labor) = 132 = 0.68 <
3 322 3
. So, try N = 8, P(Labor) = 429 = 0.7505 > 4 . Hence, N ≥ 8
4

21. 4 teams → A, B, C, D each with 10 numbered players. 5 players are to be selected. Total
possible selections = 40C5 = 658008

© Cambridge University Press 2019 41

Chapter 14 – Combinatorics – Worked solutions

a. 3 numbered 4 and 2 numbered 9: Select 3 teams to get the number 3 and select 2
24 1
teams to get the number 9=> 4C3×4C2 = 24 Hence, probability = 658008 = 27417
b. At least 4 from same team: Select 1 team and select 4 from that team and 1 from
other team or select 1 team and select al 5 from that team=> 4C1×10C4×3C1×10C1
26208 28
+ 4C1×10C5 = 25200 + 1008 = 26208. Hence, probability = 658008 = 703

22. Poker hand of 5 dealt from a pack of 52 cards. Total combinations = 52C5 = 2598960
352
a. One pair: (13C1×4C2×12C3×4×4×4)/2598960 = 833
198
b. Two pairs: (13C2×4C2×4C2×11C1×4)/2598960 = 4165
44
c. 3 of a kind: (13C1×4C3×12C2×4×4)/2599860 = 4165
1
d. 4 of a kind: (13C1×4C4×12C1×4)/2598960 = 4165
6
e. Full house: (13C1×4C3×12C1×4C2)/2598960 = 4165
f. A Straight: The least card can be selected in 10 ways (1 to 10) and the other cards
are fixed as per the lowest card in sequence. For each card there are 4 choices for
10×45 128
the suit. So, 2598960 = 32487
33
g. A Flush: Select a suit in 4 ways and 5 of its 13 cards=> 13C5×4C1/2598960 = 16660
4 1
h. A Royal Flush: Select the suit in 4 ways, the cards are fixed. 2598960 = 649740

1
23. 4 adults and 5 exits. Probability of each exit for each adult = 5
a. All leave via same exit: Select one of the 5 exits in 5 ways. Each adult has a
1 1 4 1
probability of choosing that exit of 5. Total Probability = 5× (5) = 125
b. 3 particular adults select same exit and 4th uses different exit: Select one exit in 5C1
ways and the 4th adult will use one of 4C1 exits. Hence, probability =
1 4 4
(5×4)× ( ) =
5 125
c. Any 3 adults use same exit and one uses different exit: Select 3 adults and repeat
4 4 16
part (b). Hence, probability = 4C3× 125 = 4× 125 = 125
d. No more than 2 adults come out the same exit: 1 − 3 𝑎𝑑𝑢𝑙𝑡𝑠 𝑢𝑠𝑒 𝑡ℎ𝑒 𝑠𝑎𝑚𝑒 𝑒𝑥𝑖𝑡 −
16 1 108
𝑎𝑙𝑙 4 𝑢𝑠𝑒 𝑡ℎ𝑒 𝑠𝑎𝑚𝑒 𝑒𝑥𝑖𝑡 = 1 − 125 − 125 = 125

24.
a. 5 diners choose randomly from a menu of 5 dishes
Exactly one course is not selected by any of the diners: The 1st diner can select out
of 5, the second chooses a different one, the third chooses a different one, the 4th
also chooses a different one, then the last diner has 4 choices. This can be done for
each meal in the menu. So, (5×4×3×2×4)×5. But then one meal is repeated, i.e.,
52 ×42 ×3×2 1200 48
2 diners have the same meal, so, . Hence, probability = 3125 = 125
2

© Cambridge University Press 2019 42

Chapter 14 – Combinatorics – Worked solutions

b. Following the same logic as in part (a), first diner will have n choices, second will
have (n – 1) and so on till the last one who will have (n – 1). 1 meal will be
𝑛2 ×(𝑛−1)2 ×(𝑛−2)!
repeated. Hence, probability = 2×𝑛𝑛
25.
a. 365-day a year and 3 people. At least 1 birthday in common = 1 −
365×364×363
𝑛𝑜 𝑐𝑜𝑚𝑚𝑜𝑛 𝑏𝑖𝑟𝑡ℎ𝑑𝑎𝑦𝑠 = 1 − = 0.008204
3653
b. For n people in a group, probability of at least 1 common birthday = 1 −
365 𝑃
𝑛
𝑛𝑜 𝑐𝑜𝑚𝑚𝑜𝑛 𝑏𝑖𝑟𝑡ℎ𝑑𝑎𝑦𝑠 = 1 − 365𝑛
c. n vs P(n)

d. From the graph, it seems like when we have 23 people in a group, the probability
exceeds 0.5
e. P(40) = 0.8912 and P(41) = 0.903, so 41 people.

26. 7 games of football season, max and Bert to miss 3 consecutive games each selected
independently and at random. Ways to select the to be missed games: (1,2,3), (2,3,4),
(3,4,5), (4,5,6), (5,6,7) → 5 ways.
a. Both have 1st game off: only 1 combination out of 5 and same for both. So,
1 1 1
Probability = 5 × 5 = 25
b. 2nd game is first when both are missing: One of them misses the first 3 and the
other misses the (2,3,4) games. This can happen in 2 ways. Or both can miss the
2 1 3
(2,3,4) games. So, probability = 25 + 25 = 25
c. Both miss at least one of the same game: 1 − 𝑛𝑜 𝑐𝑜𝑚𝑚𝑜𝑛 𝑔𝑎𝑚𝑒𝑠 𝑚𝑖𝑠𝑠𝑒𝑑, If one
misses the 1st set, the other can miss the last possible combinations, if one misses
the 2nd set, the other can miss the last set, no one can miss the 3rd set, if one misses
the 4th set, other can miss the 1st set and if one misses the last set, other can miss
6 19
the 1st 2 sets. So, total 6 ways to miss no common game. 1 − 25 = 25

27. 8 players at the Wimbledon quarter-finals.

© Cambridge University Press 2019 43

Chapter 14 – Combinatorics – Worked solutions

a. All are equally likely to win, probability that 2 particular players play each other
1 6 1 1 1 1
= 7 + 7 × 2 × 2 × 2 = 4, either they meet in 1st round or win the 1st round and meet
in the 2nd round.
1 14 1 1
b. 16 players, two particular players play each other probability = 15 + 15 × 4 × 4 =
1
8
1 2𝑛 −2 1 2 1
c. 2𝑛 players in similar knockout tournament: 2𝑛−1 + 2𝑛−1 × (2𝑛−2 ) = 2𝑛−1 = 21−𝑛

© Cambridge University Press 2019 44

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14G

1.
a. Arrange 5 people in a:
i. Line: 5! = 120 ways
ii. Circle: (5 − 1)! = 24 ways
b. Arrange 10 people in a:
i. Line: 10! = 3628800 ways
ii. Circle: (10 − 1)! = 362880 ways

2. 8 people are arranged so that 2 particular people sit together.

a. A straight line: The 2 are as a group, so, = 7!×2! = 10080
b. A circle: The 2 are as a group, so, = 2!×(7 − 1)! = 1440

3. Bob, Betty, Ben, Brad and Belinda to sit around a table. Number of ways to do this if:
a. No restrictions: (5 − 1)! = 24
b. Betty sits on Bob’s right: Betty and Bob as a group with Betty on his right and then
the 4 can be arranged in (4 − 1)! = 6
c. Brad sits between Bob and Ben: Consider them as a group with Brad in the middle
and Bob and Ben at corners in 2 ways. Together with the girls, they can be
arranged in (3 − 1)! = 2! Ways. So, 2!×2 = 4 ways.
d. Belinda and Betty sit apart: 24 − 𝐵𝑒𝑙𝑖𝑛𝑑𝑎 𝑎𝑛𝑑 𝐵𝑒𝑡𝑡𝑦 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 = 24 − (2!×(4 −
1)!) = 24 − 12 = 12 ways.
e. Ben and Belinda sit apart, but Betty sits next to Bob: Ben and Belinda as a group
and they can be sat together in 2!×(4 − 1)! = 12 ways. So, the remaining 12
arrangements have Ben and Belinda sitting apart. In these remaining
arrangements Bob and Betty sitting together in 2!×(3 − 1)! = 4 ways. As Ben and
Belinda are a group and Bob and Betty are a group so 2 and Brad as the 3rd person.

4. 4 boys and 4 girls arranged in a circle. Number of arrangements:

a. No restrictions: (8 − 1)! = 7! = 5040
4!
b. Boys and girls alternate: The boys can be arranged in 2 ways and girls can be
4! 4! 4!
arranged in 2 ways as it is around a circle. So, 2 × 2 = 144
c. Boys and girls in distinct groups: 8 seats 8 people. All 4 girls can be arranged in 4
consecutive seats in 4! ways. Similarly, boys can be seated in 4! ways. So, total
arrangements = 4!×4! = 576
d. A particular boy and girl sit next to each other: Consider them as a group and
arrange all. So, 2!×(7 − 1)! = 1440
e. 2 particular boys do not sit together: total arrangements − when the 2 boys sit
together. The 2 boys can be seated together in 2!×(7 − 1)! = 1440. So, possible
arrangements 5040 − 1440 = 3600
f. A particular boy sits between 2 particular girls: The three can sit in together in 2
ways and with the rest 5 they can be arranged in 2×(6 − 1)! = 240 ways.

5. A, E, I, P, Q, R are arranged in a circle. Total arrangements = 5! = 120. The probability

that:

© Cambridge University Press 2019 45

Chapter 14 – Combinatorics – Worked solutions

a. The vowels are together: Consider the vowels as a group and arranging in
36 3
3!×(4 − 1)! = 36 ways. So, probability = 120 = 10
b. A is opposite R: As A and R are opposite, the rest 4 can be arranged in 4 seats in
24 1
4! ways. So, probability = 120 = 5
c. Vowels and consonants alternate: 3 vowels and 3 consonants each has to be
12 1
arranged in a circle So, 3!×2! = 12 ways. Hence, probability = 120 = 10
d. At least 2 vowels are next to each other: 1 − 𝑎𝑙𝑙 𝑣𝑜𝑤𝑒𝑙𝑠 𝑎𝑟𝑒 𝑎𝑝𝑎𝑟𝑡. All vowels are
1 9
apart means vowels and consonants alternate. So, Probability = 1 − 10 = 10

6. (1, 2, 3, 4, 5, 6, 7, 8) are placed in a circle: Number of ways if:

a. No restrictions = (8 − 1)! = 7! = 5040
b. All even numbers are together: Implies all odd number are together. 2 groups of
even and odd. Total arrangements 4!×4! = 576
c. Odd and even number alternate: Fix the first number and then the rest can be
arranged in 3!×4! = 144 ways.
d. At least 3 odd numbers are together: All 4 odd numbers together + 3 odd numbers
together. Select any 3 odd numbers in 4C3 ways and arrange the group in 3! ways,
the 4th odd number can be arranged in 3 ways and the rest 4 even in 4! Ways. So,
total ways 576 + 4×3!×3×4! = 576 + 1728 = 2304
e. Numbers 1 and 7 are adjacent: Consider them as a group and arranged the group
with others in 2!×(7 − 1)! = 1440
f. Numbers 3 and 4 are separated: 5040 − 3 𝑎𝑛𝑑 4 𝑎𝑟𝑒 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟. 3 and 4 can be
together in 2!×(7 − 1)! =1440 ways. So, 5040 − 1440 = 3600

7. Committee of 3 women and 7 men seated randomly at a round table. Total

arrangements = (10 − 1)! = 362880
a. Probability that the 3 females sit together = Consider them as a group. So possible
30240 1
arrangements = 3!×(8 − 1)! = 30240. Hence, probability = 362880 = 12
b. A president and vice-president are elected. The probability that the two sit
opposite to each other: Once a president is selected, there are 9 others who could
be the vice-president but only 1 person sitting opposite the president. So, the
1
probability = 9

8. Circular arrangements of 𝑛 people:

a. No restriction: (𝑛 − 1)!
b. Two particular people must sit together: Consider them as a group and arrange in
a circle 2!×((𝑛 − 1) − 1)! = 2!×(𝑛 − 2)!
c. Two particular people sit apart: 𝑡𝑜𝑡𝑎𝑙 − 𝑡ℎ𝑒 𝑡𝑤𝑜 𝑝𝑒𝑜𝑝𝑙𝑒 𝑠𝑖𝑡𝑡𝑖𝑛𝑔 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 =>
2
(𝑛! − 2!×(𝑛 − 2)!) = 𝑛! (1 − )
𝑛(𝑛−1)

© Cambridge University Press 2019 46

Chapter 14 – Combinatorics – Worked solutions

d. 3 particular people sit together: Consider the 3 as a group and arrange all in a
circle 3!×((𝑛 − 2) − 1)! = 3!×(𝑛 − 3)!

9. 12 marbles placed in a circle. Number of ways to do this if:

a. All marbles of different colours: Each is a unique marble, so, (12 − 1)! = 11! Ways
b. 8 red, 3 blue and 1 green: Arrange the marbles as if they were different then
11!
remove the cases when the arrangements would be same → 8!3!1! = 165

10. 10 people to be seated around two different round tables. So, select a group of 5 from
the 10 and arrange it around a table and the second group around the 2nd table. The
groups can be interchanged with the tables so multiply by 2. Hence, total
4!×4!
arrangements = 10C5× 2 ×2 = 145152

11. 4 rowers, 3 basketballers and 2 cricketers sit around a table.

a. Basketballers and rowers sit in groups, but the groups are not together: So, the
cricketers sit at each end of the groups to separate the two groups. The two groups
can be arranged in 4!×3!×2 = 288. As the groups can be switched.
b. One rower and one cricketer are related. The probability they sit together as per
conditions in part (a): Total arrangements = 288. Fix the cricketers position, the
rower has 2 choices and the other rowers can be arranged in 3! ways and the
2×3!×3! 1
basketballers in 3! ways. So, the probability = 288 = 4

12. 𝑛 men and (𝑛 + 1) women to sit around a circular table. The probability that no 2 men
sit next to one another = Probability that men and women alternate => The women
can be first arranged around the table in alternate seats in (𝑛 + 1)! ways. Now the
men have 𝑛 seats available and can be arranged in 𝑛! ways. So, the probability =
𝑛!×(𝑛+1)! 𝑛!×(𝑛+1)!
= (2𝑛)! .
((𝑛+(𝑛+1))−1)!

13.
a. Necklace with 6 differently coloured beads. Arrangements possible = (6 − 1)!. As
turning the necklace clockwise or anti-clockwise would yield the same, so the total
(6−1)!
would be half of obtained value. Hence, 2 = 120
b. 10 different keys to be placed on a key ring. Again, clockwise and anti-clockwise
(10−1)!
rotation would yield the same result. So, 2 = 181440 ways.
c. 1yellow, 2 red and 4 green beads in a bracelet. So, possible arrangements are:
(YRRGGGG), (RYRGGGG), (RRYGGGG), (RRGYGGG), (RRGGYGG), (RRGGGYG),
(RGYRGGG), (RGRYGGG), (RGGRYGG). So total 9 arrangements.

© Cambridge University Press 2019 47

Chapter 14 – Combinatorics – Worked solutions

Solutions to Exercise 14H

1. A die is thrown repeatedly.
a. Smallest number of times the die must be thrown to ensure at least one number
turns up twice: Die has 6 faces and 6 different possible numbers. So, in the first 6
turns if all different numbers turn up, on the 7th turn, it has to be one of the first 6
numbers. Hence, 7 turns are required.
b. Smallest number of times to ensure six occurs twice: Again, assuming that first 6
throws are all different, six will occur once in first 6 throws. But it is an
assumption. Even after taking this assumption, there is no guarantee when the 2nd
6 will occur. So, no way to predict when it will occur twice for sure.

2. 3 numbers on 3 papers. Numbers can be same or different. Assuming that only

integers are written, the numbers could be either even or odd. As there are 3 numbers,
there can be 2-even, 1-odd or 2-odd, 1-even or 3-even or 3-odd. Hence, he can
guarantee that at least 2 are even or at least 2 are odd.

3. Jemima hides eggs in 5 different locations. Total eggs = 16. Now, 16 = 3×5 + 1, so as
per the pigeonhole principle, she can be certain that at least 1 location holds 4 eggs.

4. A pair of coins tossed repeatedly.

a. Smallest number of tosses to get at least 1 outcome occurring twice: Using the
pigeonhole principle, 3 + 1 = 4 tosses would ensure 1 outcome occurring twice.
b. Smallest number of tosses to get at least 1 outcome occurring thrice: Using the
pigeonhole principle twice, 3 + 3 + 1 = 7 tosses.
c. Smallest number of tosses to get at least 1 outcome occurring 𝑛 times: Using he
pigeonhole principle, (3(𝑛 − 1) + 1) = 3𝑛 − 2 tosses.

5. A die is thrown 13 times. A die has 6 faces so, 6 possible outcomes. 13 = 2×6 + 1. So,
when a die is cast 13 times, assuming every 6 tosses we get a different number, one of
the six numbers will occur for the 3rd time on the 13th toss. Hence, the reason.

6. 10 tickets are given at random to a group of boys. At least someone is going to get 2
tickets. So, assuming the extreme case when each ticket is given to different boy until
everyone has one ticket, there must be (10 − 1) = 9 boys for someone to get 2 tickets.
Hence, there are at most 10 boys.
7. 3 different sinks for pots, pans and dishes. There must at least 4 items of a type for the
Chef to wash up.
a. Maximum number of recipes he can make before he must wash up: Using the
pigeonhole principle, until each sink has (4 − 1) items, he can continue cooking.
So, 3 + 3 + 3 = 9 recipes can be made and after he prepares the 10th recipe, he
will need to wash up at least one sink. So, 10 recipes.
b. Minimum number of recipes he can make before he has to wash up: If he cooks 4
recipes that are the same, then after 4 recipes he has to wash up. So, 4 recipes.

© Cambridge University Press 2019 48

Chapter 14 – Combinatorics – Worked solutions

8. 100 points scattered around 7𝑚×7𝑚 square. So, 100 points in 49 m2 area. Assuming
that the points are scattered such that, a point will be filled in new square every time
possible, each 1𝑚×1𝑚 square will have 2 points when 98 points are filled and then
the remaining two points are to be filled in one of the 49 squares making at least 1
square containing 3 points. Hence, there is at least one 1𝑚×1𝑚 square with 3 points.

9. Baruch has 3 spinners, each with 3 sides labelled 1, 2, 3. A pair of spinners are thrown
and their sum recorded. Possible outcomes of the sum are:
2 = (1,1), 3 = (1,2), 4 = (2,2), (1,3), 5 = (2,3), 6 = (3,3). So, 5 outcomes are possible
in 6 ways. But as 4 can occur via a combination of 2 outcomes, 5 ways. So, on the sixth
throw, one of the 5 numbers will be repeated as the sum. Hence, 6 throws.

10. In a group of 100 people, the case where the 100 people are selected such that when
the first person is selected with a birthday in particular month, the next person with
their birthday in same month is selected after there is at least one with birthday in
every other month, i.e., 13th. So, in this extreme possible case, there will be 8 people
with birthdays in every month when first 96 people are selected. After that, the
remaining 4 people, if assigned in similar fashion will give 9 people with their
birthdays in same months and 4 such months. So, for sure, there will be at least 9
people with birthdays in same month.

11. A player gets a hand of 10 cards. In the maximum diversity case when the player gets
first 4 cards of all different suits, the next 4 cards of all different suits, then when he
gets the 9th card, it will be the 3rd cards of a particular suit. So, he will have at least one
suit that occurs 3 times or more unless he gets 2 jokers as the question does not
mention the hand being dealt from 52 cards.

12. 567 chairs and 23 classrooms. So, 567 ÷ 23 = 24.65, each classroom gets 24 chairs
and then we have 15 extra chairs to be distributed. So, definitely, at least one
classroom will have 25 chairs.

13.
a. As we don’t know the total number of people, there is no guarantee. So, 0 (zero)
b. Assuming all her friends get divided equally in each group, then 19 = 3×6 + 1. So,
there exists a group with 7 of Jackie’s friends. Hence, proved.
c. As, we don’t know the number of people, all 19 could be in her group.
14.
a. 4 squares can be selected in each alternate row and columns of the chessboard.
So, 4×4 = 16 Kings can be placed such that no two of them are adjacent.
b. If all the rooks are placed on one of the main diagonals, 8 rooks can be placed such
that no two are on the same row or column or no two of them attack each other.

15. 8𝑚×12𝑚 field and 9 cows (point size)

a. If the cows are arranged at the maximum distance possible from each other, then,
the big 8×12 rectangle can be divided into 8 small 4×3 rectangles each with a
diagonal of 5𝑚. If each cow is placed at the diagonal positions of these small

© Cambridge University Press 2019 49

Chapter 14 – Combinatorics – Worked solutions

rectangles, then after placing the 8 cows, there are no more diagonal positions
available to place the last cow. Hence, at least 2 of them are at most 5m apart or
less than 5m apart.
b. Following the same method as in part (a), the 8 cows can be arranged at a distance
of 5m from each other at the diagonal positions of small rectangles.

16. When a number is divided by 3, possible remainders are 0, 1 and 2. Amongst 100
numbers, when divided by 3, the remainders can be 33 zeroes, 33 ones and 33 twos
and the last number would yield a remainder which would make one of the
remainders to be obtained 34 times in the extreme case that the first 99 yield a 33 of
each remainder. So, at least 34 will leave the same remainder when divided by 3.

17. 2𝑥 − 2𝑦 = 2019×𝑛 = 2𝑦 (2𝑥−𝑦 − 1) = 2019×𝑛. So, 2𝑦 = 2019𝑛 𝑜𝑟 (2𝑘 − 1) =

2019𝑛. If we consider the case of 2𝑦 ÷ 2019 = 𝑛, for 𝑦 ∈ (1, 2020), the remainders
would be between (0, 2018). As we are considering 2020 numbers, there has to be 2
remainders that are common. So, for those 2 powers, that yield the same remainder,
their difference has to be a multiple of 2019.

18. 52 = 13×4, there are 26 positive odd integers less than 52 and 13 pairs which sum to
52: {(1, 51), (3, 49), (5, 47), … , (23, 29), (25, 27)}. As there are 13 pairs that sum to 52,
when we select any 14 positive odd integers less than 52, at least one of this pair is in
the selection as in the extreme case we can select 13 integers one from each pair and
for the 14th choice, it will be the 2nd from one of these pairs. Hence, there is always a
pair whose sum is 52.

19. Odd whole numbers less than 200. There are 100 odd numbers less than 200 and 50
pairs that sum to 200: {(1, 199), (3, 197), (5, 195), … , (97, 103), (99, 101)}. So, a
200
subset that ensures a pair that sum to 200 would be: 4 + 1 = 51. Suppose we select
1 number from each pair shown above, after 50 numbers are selected, then the 51st
number will be the 2nd number from a pair. It will ensure that we have a pair that sums
to 200.

20. 2 colours for adjacent point. So, consider 3 points forming a triangle in the plane. The
first vertex is of one colour and the second vertex of a different colour. For, the third
vertex, it has to be one of the two colours already used for one of the two vertices.
Hence, there are 2 adjacent points with same colour.

21. 41 pigeons fly into 10 different pigeonholes.

a. At least 1 pigeonhole with at least 5 pigeons: Assuming a pigeon flies into a pigeonhole
with minimum pigeons, the first 10 will occupy all 10 pigeonholes, the next 10 will fill
each pigeonhole with 2 pigeons. Similarly, after 40 pigeons have nested in the
pigeonholes, each pigeonhole will have 4 pigeons. When the 41st pigeon flies inside a
pigeonhole, that pigeonhole will have 5 pigeons. Hence, proved.

© Cambridge University Press 2019 50

Chapter 14 – Combinatorics – Worked solutions

b. At least 1 pair of pigeonholes with 9 pigeons: Following the same logic as in part (a),
there would be a pigeonhole with 5 pigeons and all the rest with 4 pigeons. Hence,
there would at least be 1 pair of pigeonholes with 9 pigeons.

22. Email addresses are generated with the initials of student’s names:
a. There will be 2 people with same email addresses: The number of different email
addresses possible are 26×26 = 676. So, there must me more than 676 students
for two of them to have same email addresses Or simply there are at least 2
students with the same initials and the particular someone knows both in which
case we cannot determine the number of students.
b. Total combinations = 676. 50% have first names starting from 8 different letters.
So, 50% students have 8×26 = 208 addresses. So, there are at least 2×208 + 1 =
417 students in the school as they are certain that 2 will share a common email
address.
c. Either the initials or initials with a symbol. So, there are 676 default cases of just
the initials and each such case can be paired with 10 numbers from 0 to 9 giving
6760 more combinations. So, total of 676 + 6760 = 7436 possibilities. The school
has 1200 students and 200 join every year. Thus, for the email to be reused, the
arithmetic progression should exceed 7436: 1200 + 200𝑡 ≥ 7437 => 𝑡 ≥ 31.185
Hence, in the 32nd year, there will be a reassigning of an email address.

23. 6 people at a dinner table, there are 2 with identical number of friends. A person at
the table can have 0 to 5 friends. So, there are 6 people to be put in 5 places making
one that always has 2 people. Hence proved.

24. Regular octahedron with 6 vertices, each vertex connected to each other vertex by
rods either in yellow or blue colour.
a. Number of rods: Each vertex is connected to every other vertex. So, the first vertex
has 5 rods connecting to all the others. The second vertex is connected to all 4
remaining. The third is connected to all the 3 remaining. The fourth is connected
to all the 2 remaining. The fifth is connected to the one remaining. So, total number
of rods = 5 + 4 + 3 + 2 + 1 = 15
b. Each set of 3 vertices with rods joining them, form a triangle. Number of such
triangles: This is same as selecting 3 vertices from 6 given vertices and can be done
6!
in 6C3 = 3!3! = 20 ways. Hence, 20 such triangles exist.
c. At least one triangle with all same coloured rods: Select any vertex at random. It
will have 5 rods connected to it. The rods can be of 2 colours only. So, there will at
least be 3 rods of same colour in the maximum diversity scenario. Hence, that
particular triangle will have all the rods of same colour. Thus, at least 1 triangle
with all same coloured rods.

© Cambridge University Press 2019 51

Chapter 14 – Combinatorics – Worked solutions

Solutions to chapter 14 review

1. 8 people lining up for a queue: 8! = 40320 ways.

2.
9! 9×8×7!
a. = = 72
7! 7!
(𝑛+1)! (𝑛+1)×𝑛×(𝑛−1)!
b. (𝑛−1)!
= (𝑛−1)!
= 𝑛2 + 𝑛
c. (𝑘 + 1)! − 𝑘! = 𝑘! ((𝑘 + 1) − 1) = 𝑘×𝑘! = 𝑘 2 (𝑘 − 1)!

3. Evaluate:
12!
a. 12C7 = 7!5! = 792
10!
7!3!
b. 10C3 ÷ 6C3 = 6! =6
3!3!
20!
c. (20
17
) = 17!3! = 1140

4. “JACKSON”, 4 letter words without repetition: 7P4 = 7×6×5×4 = 840

5. 3 letters and 4 digits to make a number plate: total number of plates possible =
263 ×104 = 175760000

6. “FOUNDER”- 7 letters, 4 consonants and 3 vowels

a. Vowels and consonants alternate: Starts with consonants, total arrangements =
4! 3! = 144
b. Start with N and end with D: Fix them at the positions. Rest 5 can be arranged in
5! = 120 ways.
c. Consonants in a group at the end: The group of consonants can be arranged in 4!
ways and first 3 letters can be arranged in 3! ways. So, total arrangements =
4! 3! = 144
d. R is to the right of U: When the word starts with U, 6 choices for R, when U is at 2nd
place, 5 choices, when U at 3rd, 4 choices and so on. Total arrangements
(6 + 5 + 4 + 3 + 2 + 1)×5! = 21×120 = 2520

7. 5 boys and 5 girls sit in a row. Number of ways if:

a. No restrictions: 10! = 3628800
b. Boys and girls sit in distinct groups: 5!×5!×2! = 28800
c. A particular boy and girl must sit together: 2!×9! = 725760

8!
8. “REPORTER” 8 letters with 2 Es and 3 Rs. Total arrangements = 2!3! = 3360

6! 6!
9. 3 or 4 letter words from “SAMUEL” – 6 distinct letters: 6P3 + 6P4 = 3! + 2! = 480

10. 10 questions with “Yes-No” answers. Number of ways to get 6 correct and 4 wrong
10!
answers: Select 6 answers to be “Yes”, so → 6!4! = 210

© Cambridge University Press 2019 52

Chapter 14 – Combinatorics – Worked solutions

11. 6 men and 10 women and a committee of 7 is to be chosen:

16!
a. No restrictions: 16C7 = 7!9! = 11440
10!
b. All female members: 10C7 = 7!3! = 120
c. All male members: Not possible as only 6 males are there. So, zero ways.
6! 10!
d. Exactly 2 men: Select 2 men and 5 women→ 6C2×10C5 = 2!4! × 5!5! = 3780
10! 6!
e. 4 women and 3 men: 10C4×6C3 = 6!4! × 3!3! = 4200
f. Majority of women: 10C46C3 + 10C56C2 + 10C66C1 + 10C7 = 9360
g. A particular man must be included: 15C6×1 = 5005
h. A particular man must not be included: 11440 − 𝑎 𝑝𝑎𝑟𝑡𝑖𝑐𝑢𝑙𝑎𝑟 𝑚𝑎𝑛 𝑖𝑠 𝑖𝑛𝑐𝑙𝑢𝑑𝑒𝑑 =
11440 − 5005 = 6435
14!
i. Only one of Mustafa or Ying Yue is on the committee: 2× 14C7 = 2× 7!7! = 6864, As
exclude one of them and select the other.

12. 8 people arrive at a restaurant. Number of ways to assign:

8!
a. Large table for 5 and small table for 3: 8C5 = 5!3! = 56
8!
b. 2 different tables for 4: 2×8C4÷ 2 = 4!4! = 70
8!
4!4!
c. Two indistinguishable table for 4: 8C4 ÷ 2 = = 35
2

13. A committee of 6 to be formed from 4 men and 3 women. Total number of ways=
7!
= 7 ways. The probability that it will have more men = only one case where all
6!1!
3!
1×( ) 3
men are selected and 2 of the women are selected => 72!1! = 7
14. 3 cards selected at random from a standard pack of 52 cards. Total ways = 52C3 =
22100. The probability that:
a. They are queen of spades, 3 of clubs and 9 of hearts: this can happen in 1 way. So,
1
probability = 22100
4 1
b. All are kings: 4C3÷ 22100 = 22100 = 5525
286 11
c. All are clubs: 13C3/52C3 = 22100 = 850
1144 22
d. All are same suit: 4C1×13C3/52C3 = 22100 = 425
13
e. One red and 2 black: 26C1 × 26C2 / 52C3 = 34
64 16
f. One is 3, one is 5 and one is an 8: (4C1)3 / 52C3 = 22100 = 5525
24 6
g. 2 are fives and 1 is seven: 4C2×4C1/52C3 = 22100 = 5525
64
h. At least 2 are spades: (13C2×39C1 + 13C3)/52C3 = 425

15. 3 boys and 3 girls are arranged in a circle. Number of ways if:
a. No restrictions: (6 − 1)! = 5! = 120
b. Boys and girls alternate: 3!×2! = 12
c. Boys and girls are in distinct groups: 3!×3! = 36

© Cambridge University Press 2019 53

Chapter 14 – Combinatorics – Worked solutions

d. A particular boy and girl sit together: 2!×(5 − 1)! = 2×24 = 48

e. 2 particular boys do not sit together: 120 − 𝑡ℎ𝑒 2 𝑏𝑜𝑦𝑠 𝑠𝑖𝑡 𝑡𝑜𝑔𝑒𝑡ℎ𝑒𝑟 = 120 −
48 = 72
f. A particular boy sits opposite a particular girl: Sit the girl first, the boy will sit in
one place. The rest 4 can be arranged in 4! = 24 ways.

16. 17 peanuts distributed among six monkeys. Assuming even distribution (extreme
case) that a monkey will get a 2nd peanut when all others have at least one, 17 =
2×6 + 5. So, after getting 2 peanuts each, we still have 5 peanuts to distribute amongst
6 monkeys. The 13th peanut given to any monkey will make it it’s 3rd peanut. Hence,
there is at least 1 monkey with at least 3 peanuts.

17. 1500 people, there is guarantee that at least 5 people share their birthdays. Assuming
365 day a year and extreme case when 1st person has birthday on 1st January, second
person on 2nd January and so on till 365th person has birthday on 31st December and
366th person again on 1st January and so on. Then, 1500 = 365×4 + 40 So, after 1460
people are done we still have 40 people and the birthday of 1461st person will fall on
1st January as per the mentioned logic and the person will be the 5th to have birthday
on 1st January. Hence, there are at least 5 people who have their birthdays on the same
day and month.

© Cambridge University Press 2019 54