A brief note on Arrangements and Selections . Read it before a test. Try each question at the end before you open its answer.
Multiplication rule: choices made one after another multiply. Factorial: n ! = n ( n − 1 ) ⋯ 1 n! = n(n - 1)\cdots 1 n ! = n ( n − 1 ) ⋯ 1 , and 0 ! = 1 0! = 1 0 ! = 1 . Permutation: n P r = n ! ( n − r ) ! {}^{n}P_{r} = \dfrac{n!}{(n - r)!} n P r = ( n − r )! n ! . The order matters. Combination: n C r = n ! r ! ( n − r ) ! {}^{n}C_{r} = \dfrac{n!}{r!\,(n - r)!} n C r = r ! ( n − r )! n ! . The order does not matter. Symmetry: n C r = n C n − r {}^{n}C_{r} = {}^{n}C_{n - r} n C r = n C n − r . Choosing the method Ask: does a different order give a different result? Together: glue the people into a block, then multiply by the orders inside the block. Apart: subtract the "together" count from all the arrangements. Must be chosen: remove that person and choose the rest from the others. At least one: subtract the "none" case from the total. Numbers: fill the place with the condition first. A worked example How many 3 3 3 -letter codes can be made from the letters P, Q, R, S, T, with no letter used twice?
Does the order matter? Yes: PQR and QRP are different codes. Use a permutation. 5 P 3 = 5 × 4 × 3 = 60 {}^{5}P_{3} = 5 \times 4 \times 3 = 60 5 P 3 = 5 × 4 × 3 = 60 . Practice with new numbers
A program to try The program prints the permutations, the combinations and the combinations found by dividing, for three cases.
Read it first. Then run it. What do you notice about the last two columns?
1. Add the case (7, 2). Predict both counts first.
Mistakes to avoid A permutation where the order does not matter. Forgetting the swap inside a block of people who sit together. Starting a number with 0 0 0 . Keeping a negative or fractional n n n . Check yourself Work out 8 P 3 {}^{8}P_{3} 8 P 3 . Stuck? Show a hint Show the answerWork out 9 C 7 {}^{9}C_{7} 9 C 7 . Stuck? Show a hint Show the answerIn how many ways can 4 4 4 people be seated in a row of 4 4 4 chairs? Stuck? Show a hint Show the answerA group of 10 10 10 chooses a team of 3 3 3 , and one named member must be in it. How many teams? Stuck? Show a hint Show the answerSolve n C 2 = 15 {}^{n}C_{2} = 15 n C 2 = 15 . Stuck? Show a hint Show the answerSources Cambridge International, IGCSE Additional Mathematics 0606 syllabus, unit 11.