Count ordered arrangements and unordered selections using P(n,r) and C(n,r).
A permutation is an ordered arrangement of objects. A combination is an unordered selection. The key question: does order matter? If yes, use permutations. If no, use combinations.
Permutations (order matters)
Combinations (order irrelevant)
C(n,r) = P(n,r)/r! โ dividing by r! removes the overcounting of the r! arrangements of the chosen items.
From 8 people, how many 3-person committees? Order doesn't matter: C(8,3) = 8!/(3!ยท5!) = (8ยท7ยท6)/(3ยท2ยท1) = 56.
Remember This!
Pascal's Triangle gives binomial coefficients: C(n,r). Note C(n,r) = C(n, nโr) โ choosing r to include is the same as choosing nโr to exclude.
How many ways can 4 books be arranged on a shelf from a collection of 7?