Theory of Intelligence
11TH•Mathematics•Permutations And Combinations•7.2 Permutations

7.2 Permutations

Permutations of distinct objects, formula, and seating/arrangement examples.

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!(n−r)!(r≤n){}^n P_r = P(n,r) = \dfrac{n!}{(n-r)!} \quad (r \le n)

Theorem. nPr=n(n−1)⋯(n−r+1)=n!(n−r)!{}^n P_r = n(n-1)\cdots(n-r+1) = \dfrac{n!}{(n-r)!}.

Proof. First place: nn choices; second: n−1n-1; …; rrth: n−r+1n-r+1. Multiply by the fundamental principle.

Reason 0!=10! = 1: when n=rn = r, nPn=n!0!=n!{}^n P_n = \dfrac{n!}{0!} = n! forces 0!=10! = 1.

Example 4

Different 44-digit numbers from 1,2,3,4,5,61,2,3,4,5,6 (no repeat): 6P4=360{}^6 P_4 = 360.

Example 5

44 math, 33 physics, 22 chemistry books on a shelf of 99:

(a) No restriction: 9!=3628809! = 362880.

(b) Same subjects together: treat 33 subject blocks ⇒\Rightarrow 4! 3! 2! 3!=17284!\,3!\,2!\,3! = 1728.

(c) Only math together: 4! 6!=172804!\,6! = 17280.

Example 6

Seat 55 people on a bench:

(a) No restriction: 5!=1205! = 120.

(b) Two particular people together: 4! 2!=484!\,2! = 48.

(c) Those two not together: 120−48=72120 - 48 = 72.

Discuss theoretical concepts, mathematical formulas, and architectural foundations.

Supports inline code with `backticks`
No comments yet. Be the first to start the discussion!