Permutation & Combination - Advanced Level: step-by-step approach ADVANCED

Step-by-Step Solution:

Concept: Circular Permutation with reflection symmetry. This is used for arrangements like necklaces or keyrings where flipping the arrangement produces the same result (Clockwise = Anticlockwise).

Formula: $\text{Total Ways} = \frac{(n-1)!}2$

Analysis:
- Total items ($n$): 6
- Step 1: Normal circular arrangements (rotations same) = $(n-1)!$ = 120
- Step 2: Account for reflection (flips) by dividing by 2.

Calculation:
Arrangements = $\frac{(6-1)!}2$
= $\frac{120}2$
= 60

Formula Summary:
- Linear: $n!$
- Circular (no reflection): $(n-1)!$
- Circular (with reflection): $\frac{(n-1)!}2$

Key Principle: Dividing by 2 removes the overcounting caused by the symmetry when the arrangement can be flipped.

Step-by-Step Solution:

Concept: Derangement - permutation where no element appears in its original position. Denoted as D(n) or !n.

Given:
- Number of items: 5
- Constraint: No item in its correct position

Derangement Formula:
D(n) = n! × [1 - 1/1! + 1/2! - 1/3! + ... + (-1)ⁿ/n!]

Or recursively: D(n) = (n-1)[D(n-1) + D(n-2)]

Step-by-Step Calculation:
D(0) = 1 (convention)
D(1) = 0 (one item must be in its position)
D(2) = 1 (only one swap possible)

For n ≥ 3, we use: D(n) = (n-1)[D(n-1) + D(n-2)]

Let's calculate:
D(0) = 1
D(1) = 0
D(2) = 1
D(3) = (3-1)[D(2) + D(1)] = 2 × [1 + 0] = 2
D(4) = (4-1)[D(3) + D(2)] = 3 × [2 + 1] = 9
D(5) = (5-1)[D(4) + D(3)] = 4 × [9 + 2] = 44

Answer: D(5) = 44

Intuitive Understanding:
Total arrangements = 5! = 120
Derangements = 44
Probability of derangement ≈ 1/e ≈ 0.368 (for large n)

Real-World Application:
- Secret Santa where no one gets their own name
- Permutation ciphers in cryptography
- Hat-check problem in probability

Key Formula Memory Aid:
D(n) ≈ n!/e for large n (within 1 unit)
For 5: 120/e ≈ 44 ≈ 44

Common Error: Don't subtract n! - n, that's not derangement count.

Step-by-Step Solution (Sum Rule):

Concept: 'At least' problems require finding the sum of ways for all valid, mutually exclusive cases.

Given:
- Men available: 8
- Women available: 8
- Committee size: 7
- Constraint: At least 3 men

Strategy: We sum the ways for all cases from exactly 3 men up to the maximum possible number of men (7).

Valid Cases (Men, Women) and Calculation:

(3 Men, 4 Women): C(8,3) × C(8,4) = 56 × 70 = 3920
(4 Men, 3 Women): C(8,4) × C(8,3) = 70 × 56 = 3920
(5 Men, 2 Women): C(8,5) × C(8,2) = 56 × 28 = 1568
(6 Men, 1 Women): C(8,6) × C(8,1) = 28 × 8 = 224
(7 Men, 0 Women): C(8,7) × C(8,0) = 8 × 1 = 8

Final Calculation (Sum Rule):
Total ways = (Ways with 3 men) + (Ways with 4 men) + ...
= 3920 + 3920 + 1568 + 224 + 8
= 9640

Key Principle: Use the Sum Rule (addition) because the cases are mutually exclusive (you cannot simultaneously select exactly $k$ men and exactly $j$ men, where $k
e j$).

Step-by-Step Solution:

Concept: Counting even/odd numbers with distinct digits.

Given: 3-digit numbers, distinct digits, even numbers.

Case Analysis for even numbers:

Case 1: Last digit = 0
- First digit: 1-9 (9 choices)
- Remaining 1 digits: choose from remaining 8 digits and arrange
- Ways = 9 × P(8, 1) = 9 × 8 = 72

Case 2: Last digit = 2,4,6,8 (4 choices)
- First digit: cannot be 0 and cannot be last digit (8 choices)
- Remaining 1 digits: choose from remaining 8 digits and arrange
- Ways = 4 × 8 × P(8, 1) = 256

Total = 72 + 256 = 328

Key Principle: Always handle first digit (can't be 0) and last digit (parity constraint) separately.

Step-by-Step Solution:

Concept: Multinomial theorem expansion:
$$(x_1 + x_2 + ... + x_k)^n = \sum_{a_1+...+a_k=n} \frac{n!}{a_1! a_2! ... a_k!} x_1^{a_1} x_2^{a_2} ... x_k^{a_k}$$

Given:
- Expression: (x+y+z)^5
- Desired term: the term x^2 * y^1 * z^2
- Exponents: x = 2, y = 1, z = 2

Step 1 - Verify exponent sum:
2 + 1 + 2 = 5 = 5 ✓

Step 2 - Apply multinomial coefficient formula:
Coefficient = $\frac{5!}{2! × 1! × 2!}$

Step 3 - Calculate:
- Numerator: 5! = 120
- Denominator: 2! × 1! × 2! = 2 × 1 × 2
- Denominator value: 4

Final Calculation:
Coefficient = 120 / 4 = 30

Alternative interpretation: This equals the number of ways to arrange 5 items with:
2 of type x, 1 of type y, 2 of type z

Key Principle: Multinomial coefficients generalize binomial coefficients:
- Binomial: C(n, k) = n!/(k!(n-k)!)
- Multinomial: n!/(a! b! c! ...) where a+b+c+... = n

Quick Check: The sum of all multinomial coefficients for given n is k^n = 3^5 = 243

Step-by-Step Solution (Sum Rule):

Concept: 'At least' problems require finding the sum of ways for all valid, mutually exclusive cases.

Given:
- Men available: 8
- Women available: 7
- Committee size: 6
- Constraint: At least 4 men

Strategy: We sum the ways for all cases from exactly 4 men up to the maximum possible number of men (6).

Valid Cases (Men, Women) and Calculation:

(4 Men, 2 Women): C(8,4) × C(7,2) = 70 × 21 = 1470
(5 Men, 1 Women): C(8,5) × C(7,1) = 56 × 7 = 392
(6 Men, 0 Women): C(8,6) × C(7,0) = 28 × 1 = 28

Final Calculation (Sum Rule):
Total ways = (Ways with 4 men) + (Ways with 5 men) + ...
= 1470 + 392 + 28
= 1890

Key Principle: Use the Sum Rule (addition) because the cases are mutually exclusive (you cannot simultaneously select exactly $k$ men and exactly $j$ men, where $k
e j$).

Step-by-Step Solution:

Concept: Number formation with positional restrictions. The first digit cannot be 0 (otherwise it wouldn't be an 7-digit number).

Given:
- Number length: 7 digits
- Available digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 (10 digits)
- Repetition: Allowed
- Constraint: First digit cannot be 0

Position-by-Position Analysis:

First digit (leftmost):
Cannot be 0 (would make it 6-digit number)
Choices: 1, 2, 3, 4, 5, 6, 7, 8, 9
Count: 9 choices

Second digit:
Can be any digit including 0
Choices: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Count: 10 choices

Third digit through 7th digit:
Each can be any digit including 0
Count: 10 choices each

Apply Multiplication Principle:
Total numbers = 9 × 10 × 10 × ... × 10 (6 times)
= 9 × 10^6
= 9 × 1000000
= 9000000

Alternative Verification:
- Smallest 7-digit number: 1000000 = 1000000
- Largest 7-digit number: 9999999 = 9999999
- Total count: 9999999 - 1000000 + 1 = 9000000

Related Problems:
1. No repetition: 9 × P(9,6) = 9 × 9!/3!
2. Odd numbers only: 9 × 10^5 × 5 (last digit: 1,3,5,7,9)
3. Even numbers only:
- If last digit 0: 9 × 10^5 × 1
- If last digit 2,4,6,8: 8 × 10^5 × 4
- Total: 9 × 10^5 + 8 × 4 × 10^5

Key Principle: When forming numbers:
- First digit has special restriction (can't be 0)
- Handle positional constraints carefully
- Use multiplication principle for independent choices

Step-by-Step Solution:

Concept: Gap Method - used when certain items must be separated.

Strategy:
1. Arrange the items that don't have restrictions
2. Identify gaps where restricted items can be placed
3. Place restricted items in available gaps

Given:
- Consonants: 4
- Vowels: 3
- Constraint: No two vowels together

Step 1 - Arrange Consonants:
Arrange 4 consonants: 4! = 24 ways

Step 2 - Identify Gaps:
When 4 consonants are arranged: _ C _ C _ C _ ... _ C _
Number of gaps (including ends) = 5

Visual: If we have 4 consonants, we get 5 positions where vowels can go.

Step 3 - Place Vowels in Gaps:
Choose 3 gaps from 5 available gaps: C(5,3) = 10
Arrange 3 vowels in chosen gaps: 3! = 6

Step 4 - Apply Multiplication Principle:
Total arrangements = 24 × 10 × 6
= 24 × 10 × 6
= 1440

Key Technique: Gap method ensures no two restricted items are adjacent by placing them in gaps created by unrestricted items.

Verification: Check that 3 ≤ 5 (we need enough gaps).

Step-by-Step Solution:

Concept: Geometrical combination with constraint. Three collinear points cannot form a triangle.

Strategy: Use complementary counting:
Total valid triangles = All possible triangles - Invalid triangles

Given:
- Total points: 10
- Collinear points: 4

Triangle Formation Rule: We need exactly 3 non-collinear points to form a triangle.

Step 1 - Calculate Total Possible Selections:
Selecting any 3 points from 10 points: C(10,3)
C(10,3) = 10! / [3! × 7!] = 120

Step 2 - Calculate Invalid Triangles:
3 collinear points don't form a triangle.
Selecting 3 points from 4 collinear points: C(4,3)
C(4,3) = 4! / [3! × 1!] = 4

Step 3 - Apply Complementary Counting:
Valid triangles = Total selections - Invalid selections
= 120 - 4
= 116

Key Technique: Complementary counting is often easier than direct counting when dealing with restrictions.

Verification: Answer should be less than C(10,3) = 120 since we have a constraint.

Related Concepts:
- For lines from n points: C(n,2) - (collinear points consideration)
- For quadrilaterals: C(n,4) with appropriate constraints

Step-by-Step Solution:

Concept: Gap Method - used when certain items must be separated.

Strategy:
1. Arrange the items that don't have restrictions
2. Identify gaps where restricted items can be placed
3. Place restricted items in available gaps

Given:
- Consonants: 4
- Vowels: 2
- Constraint: No two vowels together

Step 1 - Arrange Consonants:
Arrange 4 consonants: 4! = 24 ways

Step 2 - Identify Gaps:
When 4 consonants are arranged: _ C _ C _ C _ ... _ C _
Number of gaps (including ends) = 5

Visual: If we have 4 consonants, we get 5 positions where vowels can go.

Step 3 - Place Vowels in Gaps:
Choose 2 gaps from 5 available gaps: C(5,2) = 10
Arrange 2 vowels in chosen gaps: 2! = 2

Step 4 - Apply Multiplication Principle:
Total arrangements = 24 × 10 × 2
= 24 × 10 × 2
= 480

Key Technique: Gap method ensures no two restricted items are adjacent by placing them in gaps created by unrestricted items.

Verification: Check that 2 ≤ 5 (we need enough gaps).

Step-by-Step Solution:

Concept: Inclusion-Exclusion Principle - when counting elements in the union of sets, add individual counts and subtract overcounted intersections.

Formula: |A ∪ B| = |A| + |B| - |A ∩ B|

Given:
- Range: 1 to 9
- Divisors: 3 and 5

Step 1 - Count numbers divisible by 3:
Numbers divisible by 3 = ⌊9/3⌋ = 3
These are: 3, 6, 9, ..., 9

Step 2 - Count numbers divisible by 5:
Numbers divisible by 5 = ⌊9/5⌋ = 1
These are: 5, 10, 15, ..., 5

Step 3 - Count numbers divisible by BOTH 3 AND 5:
Numbers divisible by LCM(3,5) = 15
Count = ⌊9/15⌋ = 0
(These are counted twice in steps 1 and 2)

Step 4 - Apply Inclusion-Exclusion:
Total = (divisible by 3) + (divisible by 5) - (divisible by both)
= 3 + 1 - 0
= 4

Visualization (Venn Diagram concept):
- Circle A: divisible by 3 (3 numbers)
- Circle B: divisible by 5 (1 numbers)
- Intersection: divisible by both (0 numbers)
- Union: 4 numbers

Key Principle: Subtract the intersection to avoid double counting.

Extension to Three Sets:
|A ∪ B ∪ C| = |A| + |B| + |C| - |A ∩ B| - |B ∩ C| - |A ∩ C| + |A ∩ B ∩ C|

Common Application: Finding numbers NOT divisible by either = 9 - 4 = 5

Step-by-Step Solution:

Concept: Combination with mandatory inclusion constraint.

Given:
- Total people: 10
- Committee size: 5
- Must include: 2 specific people

Strategy: Fix the mandatory selections first, then choose remaining from available pool.

Analysis:
We need to select 5 people total, with 2 already fixed.
- Fixed positions: 2 (these specific people are already in)
- Remaining positions to fill: 5 - 2 = 3
- People available for remaining positions: 10 - 2 = 8

Step 1 - Fix Mandatory Members:
2 specific people must be included: C(2,2) = 1 way
(This is automatic - we have no choice here)

Step 2 - Select Remaining Members:
Choose 3 people from remaining 8 people:
C(8,3) = 56

Calculation:
C(8,3) = (8)! / [3! × (5)!]
= 40320 / [6 × 120]
= 56

Alternative Approach - Verification:
Think of it as: "We've used 2 spots, now choose 3 more from 8 remaining"

Related Problem Types:

1. Must EXCLUDE specific people:
Select all 5 from remaining 10 - (people to exclude)

2. At least one specific person:
Total ways - Ways without that person
= C(10,5) - C(10-1,5)

3. Exactly k from group A, rest from group B:
C(|A|,k) × C(|B|,5-k)

Common Error: Don't forget to reduce both the total pool and the selection size by the number of mandatory inclusions.

Answer: 56 ways

Step-by-Step Solution (Rencontres Numbers):

Concept: This is a partial derangement problem. We want exactly k fixed points, with the remaining n-k elements deranged.

Formula:
$$D(n, k) = \binom{n}{k} \cdot !(n-k)$$
where $!(m)$ is the derangement number.

Given:
- n = 7 (total elements)
- k = 1 (exact fixed points)

Step 1 - Choose which positions are fixed:
Choose 1 positions out of 7: C(7,1) = 7

Step 2 - Derange the remaining elements:
Remaining 6 elements must have NO fixed points
Derangement number D(6) = 265

Step 3 - Apply multiplication principle:
Total = C(7,1) × D(6)
= 7 × 265
= 1855

Verification:
- When k=0: D(n,0) = derangement(n) ✓
- When k=n-1: D(n,n-1) = 0 (can't have all but one fixed) ✓
- When k=n: D(n,n) = 1 (identity permutation) ✓

Rencontres numbers table for n=7:
- D(7,0) = 1854
- D(7,1) = 1855
- D(7,2) = 924
- ... and so on.

Key Insight: The sum of all rencontres numbers for given n equals n! (total permutations).

Step-by-Step Solution:

Concept: Combination with mandatory inclusion constraint.

Given:
- Total people: 12
- Committee size: 6
- Must include: 2 specific people

Strategy: Fix the mandatory selections first, then choose remaining from available pool.

Analysis:
We need to select 6 people total, with 2 already fixed.
- Fixed positions: 2 (these specific people are already in)
- Remaining positions to fill: 6 - 2 = 4
- People available for remaining positions: 12 - 2 = 10

Step 1 - Fix Mandatory Members:
2 specific people must be included: C(2,2) = 1 way
(This is automatic - we have no choice here)

Step 2 - Select Remaining Members:
Choose 4 people from remaining 10 people:
C(10,4) = 210

Calculation:
C(10,4) = (10)! / [4! × (6)!]
= 3628800 / [24 × 720]
= 210

Alternative Approach - Verification:
Think of it as: "We've used 2 spots, now choose 4 more from 10 remaining"

Related Problem Types:

1. Must EXCLUDE specific people:
Select all 6 from remaining 12 - (people to exclude)

2. At least one specific person:
Total ways - Ways without that person
= C(12,6) - C(12-1,6)

3. Exactly k from group A, rest from group B:
C(|A|,k) × C(|B|,6-k)

Common Error: Don't forget to reduce both the total pool and the selection size by the number of mandatory inclusions.

Answer: 210 ways

Step-by-Step Solution:

Concept: Handshake problem with selective participation.

Given:
- Total: 8 people
- VIPs: 4 (shake with everyone)
- Non-VIPs: 4 (only shake with other non-VIPs)

Step 1 - Total possible handshakes without restrictions:
Total possible = C(8, 2) = 8×7/2 = 28

Step 2 - Handshakes that DON'T occur:
Non-VIPs shaking with VIPs (these don't happen because non-VIPs only shake with non-VIPs)
Non-VIP to VIP handshakes = 4 × 4 = 16

Step 3 - Subtract restricted handshakes:
Actual handshakes = Total possible - Forbidden handshakes
= 28 - 16
= 12

Alternative direct count:
- VIP to VIP: C(4, 2) = 6
- VIP to Non-VIP: 0 (forbidden)
- Non-VIP to Non-VIP: C(4, 2) = 6
Total = 6 + 6 = 12

Verification: Both methods give the same result.

Step-by-Step Solution:

Concept: Circular permutation formula = (n-1)! when clockwise and anticlockwise are considered different, and rotations are considered the same.

Why (n-1)! and not n!?
In a circle, there's no fixed starting point. Rotations of the same arrangement are identical.

Analysis:
- If arranged in a line: 7! = 5040 ways
- But in a circle: we fix one person's position as reference
- Remaining 6 people can be arranged in 6! ways

Calculation:
Circular arrangements = (7-1)! = 6! = 720

Intuition: Fix one person at a position (say 12 o'clock). Now arrange the remaining 6 people in the 6 positions clockwise.

Formula Summary:
- Linear permutation: n!
- Circular permutation (rotations same): (n-1)!
- Circular permutation (reflections also same): (n-1)!/2

Common Error: Don't use n! for circular arrangements - this counts rotations as different arrangements.

Step-by-Step Solution:

Concept: Rank of a word in dictionary order - counting how many words come before it alphabetically.

Given word: MANGO

Strategy:
1. For each position, count arrangements starting with letters smaller than the actual letter
2. Add these counts to find rank
3. The rank is 1 + (number of words before it)

Letters in alphabetical order: A G M N O

Step-by-Step Calculation:

Position 1 (current letter: M):
Available letters: A G M N O
If we place 'A' here: 24 arrangements possible
If we place 'G' here: 24 arrangements possible
Subtotal arrangements before 'M': 48
Position 2 (current letter: A):
Available letters: A G N O
Position 3 (current letter: N):
Available letters: G N O
If we place 'G' here: 2 arrangements possible
Subtotal arrangements before 'N': 2
Position 4 (current letter: G):
Available letters: G O
Position 5 (current letter: O):
Available letters: O

Final Rank: 51

Verification Strategy:
1. Rank starts at 1 (not 0)
2. We count all words that come alphabetically before our word
3. Our word's rank = 1 + count of words before it

Key Principle:
- At each position, consider all possible smaller letters
- For each smaller letter, count permutations of remaining letters
- Account for repeated letters by dividing by their factorials

General Formula for Position Counting:
At position i, add: Σ (arrangements with smaller letter at position i)

Common Errors:
- Forgetting to start rank from 1
- Not accounting for repeated letters
- Counting arrangements after the word instead of before

Step-by-Step Solution:

Concept: Partitioning into groups of specified sizes. When group sizes are different, groups are automatically distinguishable by size.

Given:
- Total people: 11
- Group sizes: 5, 4, 2
- Groups are unlabeled (no names like Team A, Team B)

Formula:
$$\frac{n!}{n_1! \cdot n_2! \cdot ... \cdot n_k!}$$

Step 1 - Choose first group:
Choose 5 people from 11: C(11, 5) = 462

Step 2 - Choose second group:
From remaining 6 people, choose 4: C(6, 4) = 15

Continue for all groups:
C(11,5) = 462
C(6,4) = 15
C(2,2) = 1 (last group)

Step 3 - Multiply:
Total ways = 462 × 15 × 1 (last group)
= 6930

Simplified formula:
= 11! / (5! × 4! × 2!)
= 39916800 / (120 × 24 × 2)
= 6930

Key Insight: Since groups have different sizes, we don't divide by k! (they're naturally distinguishable by their sizes).

Contrast with equal groups:
- If groups were same size: would divide by k!
- Here, sizes differ: no division needed

Verification: Sum of group sizes = 11 = 11 ✓

Step-by-Step Solution:

Concept: Multinomial theorem expansion:
$$(x_1 + x_2 + ... + x_k)^n = \sum_{a_1+...+a_k=n} \frac{n!}{a_1! a_2! ... a_k!} x_1^{a_1} x_2^{a_2} ... x_k^{a_k}$$

Given:
- Expression: (x+y+z)^6
- Desired term: the term x^2 * y^1 * z^3
- Exponents: x = 2, y = 1, z = 3

Step 1 - Verify exponent sum:
2 + 1 + 3 = 6 = 6 ✓

Step 2 - Apply multinomial coefficient formula:
Coefficient = $\frac{6!}{2! × 1! × 3!}$

Step 3 - Calculate:
- Numerator: 6! = 720
- Denominator: 2! × 1! × 3! = 2 × 1 × 6
- Denominator value: 12

Final Calculation:
Coefficient = 720 / 12 = 60

Alternative interpretation: This equals the number of ways to arrange 6 items with:
2 of type x, 1 of type y, 3 of type z

Key Principle: Multinomial coefficients generalize binomial coefficients:
- Binomial: C(n, k) = n!/(k!(n-k)!)
- Multinomial: n!/(a! b! c! ...) where a+b+c+... = n

Quick Check: The sum of all multinomial coefficients for given n is k^n = 3^6 = 729

Step-by-Step Solution (Sum Rule):

Concept: 'At least' problems require finding the sum of ways for all valid, mutually exclusive cases.

Given:
- Men available: 8
- Women available: 6
- Committee size: 6
- Constraint: At least 4 men

Strategy: We sum the ways for all cases from exactly 4 men up to the maximum possible number of men (6).

Valid Cases (Men, Women) and Calculation:

(4 Men, 2 Women): C(8,4) × C(6,2) = 70 × 15 = 1050
(5 Men, 1 Women): C(8,5) × C(6,1) = 56 × 6 = 336
(6 Men, 0 Women): C(8,6) × C(6,0) = 28 × 1 = 28

Final Calculation (Sum Rule):
Total ways = (Ways with 4 men) + (Ways with 5 men) + ...
= 1050 + 336 + 28
= 1414

Key Principle: Use the Sum Rule (addition) because the cases are mutually exclusive (you cannot simultaneously select exactly $k$ men and exactly $j$ men, where $k
e j$).