📘 1.2 Permutations and combinations – arrange or choose?
Hello students! Today we’re learning two powerful counting tools: permutations (order matters) and combinations (order doesn’t matter). These are super common in exams – from arranging students in a line to picking a committee. I’ll explain every formula step by step and give you lots of practice. 🇪🇹 Let’s go!
🔁 Permutation – ordered arrangement
\[ P(n,r) = n(n-1)(n-2)\cdots(n-r+1) = \frac{n!}{(n-r)!} \]
For example, 3-permutations of \(\{A,B,C,D,E\}\) = \(P(5,3) = 5·4·3 = 60\). We listed them in the textbook. If all \(n\) objects are taken: \(P(n,n) = n!\) .
➡️ Order matters (gold, silver, bronze are different). \(P(100,3) = 100·99·98 = 970,200\).
(Think: 100 choices for 1st, 99 left for 2nd, 98 left for 3rd.)
That’s \(P(5,5)=5! = 120\).
🔁 Permutations with repetitions – different objects, unlimited supply
\(10^4 = 10000\) (choose each digit independently).
✍️ Exam‑style MCQs – Permutations
\(P(8,3) = 8·7·6 = 336\). Order of medals matters → permutation.
\(P(6,6)=6! = 720\).
\(P(n,2)=n(n-1)=72\) → \(n^2-n-72=0\) → \((n-9)(n+8)=0\) → \(n=9\).
🧩 Combinations – order doesn’t matter
Example: 3-combinations of \(\{a,b,c,d,e\}\): \(\binom{5}{3}=10\). The list is in the textbook: {a,b,c}, {a,b,d}, … {c,d,e}.
\(C(52,5) = \frac{52!}{5!47!} = 2,598,960\).
✍️ Exam‑style MCQs – Combinations
\(\binom{6}{3}\binom{5}{2}\binom{8}{4} = 20·10·70 = 14000\).
\(C(10,4) = \frac{10·9·8·7}{4·3·2·1} = 210\).
🔄 Circular permutations – sitting around a table
(for \(r\) out of \(n\) in a circle: \(\frac{P(n,r)}{r}\))
(ii) no two women together: first seat 5 men (4! ways), then 5 women choose 5 gaps (5! ways) → \(4!·5! = 24·120 = 2880\).
\((6-1)! = 5! = 120\).
🔤 Permutations with indistinguishable objects
\(\frac{7!}{3!2!}=420\).
📐 Binomial theorem and binomial coefficients
📝 Exercise 1.2 – selected answers
| Question | Answer / hint |
|---|---|
| 1. List all permutations of {a,b,c} | abc, acb, bac, bca, cab, cba (6 permutations) |
| 2. Permutations of {a,…,g} (7 letters) | 7! = 5040 |
| 3. Permutations ending with a | 6! = 720 (fix a at end, arrange the other 6) |
| 5a. C(5,1) | 5 |
| 5b. C(5,3) | 10 (same as C(5,2)=10) |
| 8a. 4‑member committee from 10 students | C(10,4)=210 |
| 8b. 2 men, 2 women (6 men,4 women) | C(6,2)·C(4,2)=15·6=90 |
| 9a. P(n,2)=110 → n | n(n-1)=110 → n=11 |
| 9c. P(n,4)=12P(n,2) → n | n(n-1)(n-2)(n-3)=12n(n-1) → cancel n(n-1) → (n-2)(n-3)=12 → n=6 |
| 10. Integers >5400, digits distinct, no 2 or 7 | Break into cases (5‑digit & 4‑digit) … final answer 240 |
| 16. Expand (x+y)^6 | x⁶+6x⁵y+15x⁴y²+20x³y³+15x²y⁴+6xy⁵+y⁶ |
📌 Quick reference – exam tips
- Permutation – order counts (passwords, races, line).
- Combination – order ignored (committee, handshake).
- Circular – fix one person to break symmetry.
- Identical objects – divide by factorial of counts.
- Pascal’s identity: \(\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}\).
Seat 5 men: (5-1)! = 4! = 24. 5 women into 5 gaps: 5! = 120. Multiply: 24·120 = 2880.
\(P(8,5) = 8·7·6·5·4 = 6720\).
⚡ More binomial coefficients
\(\sum_{k=0}^{n}\binom{n}{k}=2^n\). For \(n=4\) sum = \(1+4+6+4+1=16=2^4\).
You’ve got this! Practice makes perfect. In the next section we’ll tackle the binomial theorem in depth. Stay sharp! 🇪🇹