You are on page 1of 1

3.

Show that the following is true:


a)
n!
(n 2)!
= n
2
n
b)
(n 1)!
n!
=
1
n
c)
(n 2)!
(n 1)!
=
1
n 1
for n > 1
4. More questions. Sign in at Everything Maths online and click Practise Maths.
Check answers online with the exercise code below or click on show me the answer.
1a. 29H4 1b. 29H5 1c. 29H6 1d. 29H7 1e. 29H8 1f. 29H9
1g. 29HB 1h. 29HC 1i. 29HD 1j. 29HF 1k. 29HG 2a. 29HH
2b. 29HJ 2c. 29HK 2d. 29HM 2e. 29HN 3a. 29HP 3b. 29HQ
3c. 29HR
www.everythingmaths.co.za m.everythingmaths.co.za
10.6 Application to counting problems EMCK4
Worked example 14: Further arrangement of outcomes without repetition
QUESTION
Eight athletes take part in a 400 m race. In how many different ways can the rst three
places be arranged?
SOLUTION
Eight different athletes can occupy the rst 3 places. For the rst place, there are 8
different choices. For the second place there are 7 different choices and for the third
place there are 6 different choices. Therefore 8 different athletes can occupy the rst
three places in:
8 7 6 = 336 ways
Worked example 15: Arrangement of objects with constraints
QUESTION
In how many ways can seven boys of different ages be seated on a bench if:
1. the youngest boy sits next to the oldest boy?
2. the youngest and the oldest boys must not sit next to each other?
431 Chapter 10. Probability

You might also like