The document discusses mathematical problems involving factorials and arrangements. It provides worked examples of counting problems, such as:
1) How many different ways can 8 athletes take the first 3 places in a 400m race?
2) How many ways can 7 boys of different ages be seated on a bench if the youngest sits next to the oldest, or if the youngest and oldest cannot sit next to each other?
The solutions show that for the first problem there are 336 arrangements, and for the second problem there are two possible seating arrangements based on whether the youngest and oldest can or cannot sit together.
The document discusses mathematical problems involving factorials and arrangements. It provides worked examples of counting problems, such as:
1) How many different ways can 8 athletes take the first 3 places in a 400m race?
2) How many ways can 7 boys of different ages be seated on a bench if the youngest sits next to the oldest, or if the youngest and oldest cannot sit next to each other?
The solutions show that for the first problem there are 336 arrangements, and for the second problem there are two possible seating arrangements based on whether the youngest and oldest can or cannot sit together.
The document discusses mathematical problems involving factorials and arrangements. It provides worked examples of counting problems, such as:
1) How many different ways can 8 athletes take the first 3 places in a 400m race?
2) How many ways can 7 boys of different ages be seated on a bench if the youngest sits next to the oldest, or if the youngest and oldest cannot sit next to each other?
The solutions show that for the first problem there are 336 arrangements, and for the second problem there are two possible seating arrangements based on whether the youngest and oldest can or cannot sit together.
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