[Probability · Core Concepts ② - Permutations & Combinations] The Essence of Arranging in a Line & Selecting Representatives: The Block Method, Zero-Restricted Digits & Fibonacci Stair Climbing
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
- 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$.
• 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)}$
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)
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.
• 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)
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.
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.
• 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}$).
6. ⚠️ Three Traps That Cost 10 Points on Permutation Exams
• Fact Check: $[A, B]$ and $[B, A]$ are physically distinct. You must always multiply by internal permutations: $4! \times 2! = \mathbf{48}$.
• 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$.
• 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}$.
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
Post a Comment