7.2 Permutations
An arrangement of all or part of a set of objects in a specific order is a permutation.
nPr=P(n,r)=(n−r)!n!(r≤n)
Theorem. nPr=n(n−1)⋯(n−r+1)=(n−r)!n!.
Proof. First place: n choices; second: n−1; …; rth: n−r+1. Multiply by the fundamental principle.
Reason 0!=1: when n=r, nPn=0!n!=n! forces 0!=1.
Example 4
Different 4-digit numbers from 1,2,3,4,5,6 (no repeat): 6P4=360.
Example 5
4 math, 3 physics, 2 chemistry books on a shelf of 9:
(a) No restriction: 9!=362880.
(b) Same subjects together: treat 3 subject blocks ⇒ 4!3!2!3!=1728.
(c) Only math together: 4!6!=17280.
Example 6
Seat 5 people on a bench:
(a) No restriction: 5!=120.
(b) Two particular people together: 4!2!=48.
(c) Those two not together: 120−48=72.