Probability & Statistics

Permutations & Combinations

๐ŸŽฒ Probability & Statistics
๐ŸŽฐ

Permutations & Combinations

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.

P(n,r)=n!(nโˆ’r)!C(n,r)=(nr)=n!r!โ€‰(nโˆ’r)!P(n, r) = \frac{n!}{(n-r)!} \qquad C(n, r) = \binom{n}{r} = \frac{n!}{r!\,(n-r)!}
n!=nโ‹…(nโˆ’1)โ‹…(nโˆ’2)โ‹ฏ2โ‹…10!=1n! = n \cdot (n-1) \cdot (n-2) \cdots 2 \cdot 1 \qquad 0! = 1

Permutations (order matters)

Number of ways to arrange r from nP(5,3) = 5!/(5โˆ’3)! = 60Lock combinations, race finishesLonger formula (no r! in denominator)

Combinations (order irrelevant)

Number of ways to choose r from nC(5,3) = 5!/(3!ยท2!) = 10Poker hands, committee selectionShorter count: C(n,r) = P(n,r)/r!

C(n,r) = P(n,r)/r! โ€” dividing by r! removes the overcounting of the r! arrangements of the chosen items.

๐Ÿ†Choosing a Committee
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.

โœ๏ธ Try It!

How many ways can 4 books be arranged on a shelf from a collection of 7?

Take Quiz ๐Ÿ“ โ€” 25 Questions