[Probability · Core Concepts ② - Permutations & Combinations] The Essence of Arranging in a Line & Selecting Representatives: The Block Method, Zero-Restricted Digits & Fibonacci Stair Climbing

 

Probability · Core Concepts ② [Permutations & Combinations]

The Essence of Arranging in Line & Selecting Representatives: Block Method, Zero-Restricted Digits & Fibonacci Stairs

Slot Assignment Multiplications, Block Internal Swaps, Rank vs Equal Representative Divisions & Stair Recurrences

🎯 3 Golden Action Protocols for Permutations & Combinations
  • Visualize Empty Chairs (Slots) and Multiply Decreasing Options: When arranging $n$ elements in a row, assign options progressively: $n$ for the first slot, $(n-1)$ for the second, $(n-2)$ for the third, establishing the factorial cascade: $\mathbf{n! = n \times (n-1) \times \dots \times 1}$.
  • Bundle Adjacent Elements and Multiply Internal Permutations: When elements must stand together, enclose them into a single super-element to arrange the macro-blocks ($M!$), then multiply by the internal permutations of the bundle ($k!$).
  • Divide by Permutation Redundancy When Order Does Not Matter: If positions carry distinct roles (President & Vice President), order matters (multiply directly). If roles are identical (2 Committee Delegates), divide by internal ordering ($\mathbf{\div 2!}$ or $\mathbf{\div 3!}$) to eliminate duplicate sets.

1. Linear Permutations ($n!$) & The Block Grouping Method

Arranging $n$ distinct elements in a straight line embodies the Rule of Product: each filled position decreases subsequent available options by $1$.

[Core Invariant 1] Fundamental Formulas for Linear Arrangements

• Arranging all $n$ items in line: $\mathbf{n! = n \times (n-1) \times (n-2) \times \dots \times 2 \times 1}$
• Arranging $2$ items chosen from $n$: $\mathbf{n \times (n-1)}$
• Arranging $3$ items chosen from $n$: $\mathbf{n \times (n-1) \times (n-2)}$

Arranging 5 Items where A and B Must Be Adjacent A Swap (2!) B [Treated as 1 Bundle] C D E Arranging 4 Macro Units: 4! = 24 Total: (Macro Arrangement 4!) × (Internal Swap 2!) = 24 × 2 = 48 ways
✏️ [Standard Example 1] Three Elements Standing Adjacently
Among $3$ boys and $2$ girls standing in a line, find the number of arrangements where **all $3$ boys stand adjacently**.
💡 Yul's Pro-Tip: Enclose the 3 boys into 1 single bundle!
1. Arrange $1$ bundle + $2$ girls ($3$ total units): $3! = 3 \times 2 \times 1 = \mathbf{6\text{ ways}}$
2. Internal permutations inside the bundle of $3$ boys: $3! = \mathbf{6\text{ ways}}$
Total outcomes: $6 \times 6 = \mathbf{36\text{ ways}}$.
View Solution & Answer (Click to Expand)
1. Macro arrangement of 3 units: $3! = 6$.
2. Micro internal ordering of boys: $3! = 6$.
3. Rule of Product: $6 \times 6 = 36$.
Answer: 36

2. Forming Integers with Digit Cards Containing Zero

When forming multi-digit integers, **the leading most significant digit can never be zero**, creating an initial slot constraint.

Forming 3-Digit Integers from Cards {0, 1, 2, 3, 4} Hundreds 4 ways (Exclude 0) × Tens 4 ways (0 Re-enters) × Units 3 ways (Remaining 3) Total 3-Digit Integers: 4 × 4 × 3 = 48 ways
✏️ [Standard Example 2] Forming Even Integers with Digit Zero
Using $3$ distinct cards from $\{0, 1, 2, 3, 4\}$, find the number of **even $3$-digit integers** that can be formed.
💡 Yul's Pro-Tip: Partition into units digit being $0$ versus non-zero ($2$ or $4$)!
• Case 1 [Units digit is $0$ ($\square\square 0$)]: Hundreds digit has $4$ choices, tens has $3$ choices $\implies 4 \times 3 = \mathbf{12\text{ integers}}$
• Case 2 [Units digit is $2$ ($\square\square 2$)]: Hundreds digit excludes $0$ and $2$ ($3$ choices), tens has $3$ choices $\implies 3 \times 3 = \mathbf{9\text{ integers}}$
• Case 3 [Units digit is $4$ ($\square\square 4$)]: Identical to Case 2 $\implies \mathbf{9\text{ integers}}$
Total even numbers: $12 + 9 + 9 = \mathbf{30}$.
View Solution & Answer (Click to Expand)
1. Units digit 0: $4 \times 3 = 12$.
2. Units digit 2 or 4: $2 \times (3 \times 3) = 18$.
3. Rule of Sum: $12 + 18 = 30$.
Answer: 30

3. Ranked Positions (Permutations) vs Equal Representatives (Combinations)

The fundamental distinction in representative selection lies in whether swapping two chosen individuals creates a different outcome.

Category Example Roles Order Effect Formula (from $n$ candidates)
Distinct Positions President & Vice President Order Matters ($A \neq B$) $\mathbf{n \times (n-1)}$
Equal Representatives (2) 2 Committee Delegates Order Irrelevant ($(A, B) = (B, A)$) $\mathbf{\dfrac{n \times (n-1)}{2 \times 1}}$
Equal Representatives (3) 3 Committee Delegates Order Irrelevant ($3! = 6$ duplicates) $\mathbf{\dfrac{n \times (n-1) \times (n-2)}{3 \times 2 \times 1}}$
[Distinct] President & Vice President A: Pres, B: VP B: Pres, A: VP 2 Distinct Outcomes! Formula: n × (n - 1) [Equal] 2 Committee Delegates (A, B) Chosen (B, A) Chosen Exactly 1 Equivalent Pair! Formula: {n × (n - 1)} ÷ 2

4. Geometric Line Segments, Triangles & Handshakes

Forming line segments, triangles from non-collinear points on a circle, or counting mutual handshakes are mathematically identical to selecting equal representatives.

[Core Invariant 2] Geometric Selections as Unordered Combinations

• Line Segments / Handshakes among $n$ entities: Selecting $2$ unordered points $\implies \mathbf{\dfrac{n(n-1)}{2}}$
• Triangles among $n$ points (no 3 collinear): Selecting $3$ unordered points $\implies \mathbf{\dfrac{n(n-1)(n-2)}{6}}$

5. [Exam Highlight] 1-Step or 2-Step Climbing & The Fibonacci Recurrence

When ascending stairs by climbing either $1$ or $2$ steps at a time, the final step to the $n$-th stair must originate from either step $(n-1)$ or step $(n-2)$. By the Rule of Sum, this yields the Fibonacci Sequence ($a_n = a_{n-1} + a_{n-2}$).

Start (0) Step 1 1 way Step 2 2 ways Step 3 3 ways Step 4 5 ways Step 5 (Goal) 8 ways (5 + 3 = 8) +1 Step Jump +2 Step Jump Fibonacci Sequence: Step 1 (1) → Step 2 (2) → Step 3 (3) → Step 4 (5) → Step 5 (8) → Step 6 (13)

6. ⚠️ Three Traps That Cost 10 Points on Permutation Exams

🚨 [Trap 1] Omitting Internal Swaps in Block Grouping
• Critical Mistake: Treating $A, B$ as $1$ unit among $5$ people and stating the answer is simply $4! = 24$.
• Fact Check: $[A, B]$ and $[B, A]$ are physically distinct. You must always multiply by internal permutations: $4! \times 2! = \mathbf{48}$.
🚨 [Trap 2] Dividing by 3 Instead of 3! (6) for 3 Equal Representatives
• Critical Mistake: Evaluating $(10 \times 9 \times 8) \div 3 = 240$.
• Fact Check: Three delegates $A, B, C$ can be ordered in $3! = 6$ ways. Each triad is overcounted $6$ times, so you must divide by $\mathbf{6}$, yielding $120$.
🚨 [Trap 3] Allowing Leading Digit Zero in Multi-Digit Numbers
• Critical Mistake: Computing $5 \times 4 \times 3 = 60$ for $3$-digit numbers formed from $\{0, 1, 2, 3, 4\}$.
• Fact Check: A leading zero reduces the number to $2$ digits ($012 \to 12$). The hundreds slot has only $4$ choices: $4 \times 4 \times 3 = \mathbf{48}$.
🌿 Yul's Masterclass Perspective
"Permutations and combinations are not about dry symbols like $n\text{P}r$ or $n\text{C}r$—they are built on one intuitive foundation: multiply when order distinguishes the outcome, and divide by the redundant permutations when elements are symmetric."

You have mastered slot arrangements, block bundling, zero restrictions, representative divisions, and stair climbing recurrences.

Put these into practice with [Probability · Practice Lab ②] 15 Ultra-Challenging Permutation & Combination Killers & 1:1 Diagnostic Twins.

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)