Skip to content

Mathematics · Ch 6 — Permutations and Combinations

Summary

Summary

  • The fundamental principle of counting (multiplication rule): if one event can occur in mm ways and another independent event in nn ways, the two together can occur in m×nm \times n ways. The addition rule applies when events are mutually exclusive: m+nm + n ways.

  • A permutation is an arrangement of objects in a definite order. The number of permutations of nn distinct objects taken rr at a time is:

nPr=n!(n−r)!,0≤r≤n^nP_r = \frac{n!}{(n-r)!}, \quad 0 \le r \le n

Special case: nPn=n!^nP_n = n! (arranging all nn objects).

  • When objects are repeated (not all distinct), the number of distinct permutations of nn objects where there are pp of one kind, qq of another, etc., is:

n!p! q! …\frac{n!}{p!\,q!\, \dots}

  • A combination is a selection of objects without regard to order. The number of combinations of nn distinct objects taken rr at a time is:

nCr=n!r!(n−r)!=nPrr!^nC_r = \frac{n!}{r!(n-r)!} = \frac{^nP_r}{r!}

  • Key relation: nCr=nCn−r^nC_r = ^nC_{n-r}. Also, nC0=nCn=1^nC_0 = ^nC_n = 1, and nC1=n^nC_1 = n. …