Permutation & Combination - Beginner Level: common mistakes to avoid BEGINNER

Step-by-Step Solution:

Concept: Permutation with repetition. When some objects are identical, we divide by the factorial of the number of repetitions.

Analysis of 'BALL':
- Total letters: 4
- Some letters are repeated

Formula: n! / (p! × q! × ...)
where p, q, ... are the frequencies of repeated letters

Calculation:
If all letters were distinct: 4! = 24 arrangements

But some letters are repeated, so we have overcounted.
We must divide by 2! for the repeated letters.

Answer = 24 / 2 = 12

Key Principle: Identical objects create duplicate arrangements. We divide by their factorial to remove duplicates.

Why divide?: The repeated letters can be swapped among themselves without creating a new arrangement. We divide to account for this overcounting.

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: 10
- Women available: 8
- Committee size: 7
- 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 (7).

Valid Cases (Men, Women) and Calculation:

(4 Men, 3 Women): C(10,4) × C(8,3) = 210 × 56 = 11760
(5 Men, 2 Women): C(10,5) × C(8,2) = 252 × 28 = 7056
(6 Men, 1 Women): C(10,6) × C(8,1) = 210 × 8 = 1680
(7 Men, 0 Women): C(10,7) × C(8,0) = 120 × 1 = 120

Final Calculation (Sum Rule):
Total ways = (Ways with 4 men) + (Ways with 5 men) + ...
= 11760 + 7056 + 1680 + 120
= 20616

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 6-digit number).

Given:
- Number length: 6 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 5-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 6th digit:
Each can be any digit including 0
Count: 10 choices each

Apply Multiplication Principle:
Total numbers = 9 × 10 × 10 × ... × 10 (5 times)
= 9 × 10^5
= 9 × 100000
= 900000

Alternative Verification:
- Smallest 6-digit number: 100000 = 100000
- Largest 6-digit number: 999999 = 999999
- Total count: 999999 - 100000 + 1 = 900000

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

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: Rank of a word in dictionary order - counting how many words come before it alphabetically.

Given word: TIGER

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: E G I R T

Step-by-Step Calculation:

Position 1 (current letter: T):
Available letters: E G I R T
If we place 'E' here: 24 arrangements possible
If we place 'G' here: 24 arrangements possible
If we place 'I' here: 24 arrangements possible
If we place 'R' here: 24 arrangements possible
Subtotal arrangements before 'T': 96
Position 2 (current letter: I):
Available letters: E G I R
If we place 'E' here: 6 arrangements possible
If we place 'G' here: 6 arrangements possible
Subtotal arrangements before 'I': 12
Position 3 (current letter: G):
Available letters: E G R
If we place 'E' here: 2 arrangements possible
Subtotal arrangements before 'G': 2
Position 4 (current letter: E):
Available letters: E R
Position 5 (current letter: R):
Available letters: R

Final Rank: 111

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: Handshake problem with selective participation.

Given:
- Total: 10 people
- VIPs: 3 (shake with everyone)
- Non-VIPs: 7 (only shake with other non-VIPs)

Step 1 - Total possible handshakes without restrictions:
Total possible = C(10, 2) = 10×9/2 = 45

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 = 7 × 3 = 21

Step 3 - Subtract restricted handshakes:
Actual handshakes = Total possible - Forbidden handshakes
= 45 - 21
= 24

Alternative direct count:
- VIP to VIP: C(3, 2) = 3
- VIP to Non-VIP: 0 (forbidden)
- Non-VIP to Non-VIP: C(7, 2) = 21
Total = 3 + 21 = 24

Verification: Both methods give the same result.

Step-by-Step Solution:

Concept: Permutation with repetition. When some objects are identical, we divide by the factorial of the number of repetitions.

Analysis of 'BALL':
- Total letters: 4
- Some letters are repeated

Formula: n! / (p! × q! × ...)
where p, q, ... are the frequencies of repeated letters

Calculation:
If all letters were distinct: 4! = 24 arrangements

But some letters are repeated, so we have overcounted.
We must divide by 2! for the repeated letters.

Answer = 24 / 2 = 12

Key Principle: Identical objects create duplicate arrangements. We divide by their factorial to remove duplicates.

Why divide?: The repeated letters can be swapped among themselves without creating a new arrangement. We divide to account for this overcounting.

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 12
- Divisors: 2 and 3

Step 1 - Count numbers divisible by 2:
Numbers divisible by 2 = ⌊12/2⌋ = 6
These are: 2, 4, 6, ..., 12

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

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

Step 4 - Apply Inclusion-Exclusion:
Total = (divisible by 2) + (divisible by 3) - (divisible by both)
= 6 + 4 - 2
= 8

Visualization (Venn Diagram concept):
- Circle A: divisible by 2 (6 numbers)
- Circle B: divisible by 3 (4 numbers)
- Intersection: divisible by both (2 numbers)
- Union: 8 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 = 12 - 8 = 4

Step-by-Step Solution:

Concept: Permutations with identical objects. When objects of the same type are indistinguishable, we divide by the factorial of each type's count.

Formula:
$$\frac{n!}{n_1! \cdot n_2! \cdot ... \cdot n_k!}$$
where $n$ is total objects and $n_i$ is the count of type $i$.

Given Data:
- Total objects: 11
- Distribution: Type 1: 2, Type 2: 4, Type 3: 4, Type 4: 1

Step 1 - Total arrangements if all were distinct:
11! = 39916800

Step 2 - Account for identical objects:
11! = 39916800 / 2! = 2 / 4! = 24 / 4! = 24

Final Calculation:
= 34650

Key Principle: Each group of identical objects overcounts by a factor of (count)!. Division corrects this.

Verification: The result is an integer and less than 11! = 39916800.

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: 9
- Group sizes: 6, 2, 1
- 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 6 people from 9: C(9, 6) = 84

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

Continue for all groups:
C(9,6) = 84
C(3,2) = 3
C(1,1) = 1 (last group)

Step 3 - Multiply:
Total ways = 84 × 3 × 1 (last group)
= 252

Simplified formula:
= 9! / (6! × 2! × 1!)
= 362880 / (720 × 2 × 1)
= 252

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 = 9 = 9 ✓

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 = 2 (exact fixed points)

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

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

Step 3 - Apply multiplication principle:
Total = C(7,2) × D(5)
= 21 × 44
= 924

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: Fixing a specific digit at a specific position.

Given:
- Number length: 3
- Digit 7 fixed at position 1
- All digits distinct

Step 1 - Handle position 1:
Position 1 (first digit): Must be 7 (1 choice)
- Remaining 2 positions: choose from remaining 9 digits (0-9 except 7) and arrange
- Ways = P(9, 2) = 72


Calculation: 72

Key Point: When fixing a digit in first position, it cannot be 0.

Step-by-Step Solution:

Concept: Linear permutation of n distinct objects = n! (n factorial)

Analysis:
- We need to arrange 4 distinct objects in a line
- For the first position: 4 choices
- For the second position: 3 choices (one already placed)
- For the third position: 2 choices
- And so on...

Formula Application:
Number of arrangements = 4! = 4 × 3 × 2 × ... × 2 × 1

Calculation:
4! = 24

Key Concept: The factorial function represents the number of ways to arrange n distinct objects in a sequence.

Common Mistake: Don't confuse permutation (arrangement matters) with combination (arrangement doesn't matter).

Step-by-Step Solution:

Concept: Handshake problem with selective participation.

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

Step 1 - Total possible handshakes without restrictions:
Total possible = C(10, 2) = 10×9/2 = 45

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 = 6 × 4 = 24

Step 3 - Subtract restricted handshakes:
Actual handshakes = Total possible - Forbidden handshakes
= 45 - 24
= 21

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

Verification: Both methods give the same result.

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: 7, 3, 1
- 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 7 people from 11: C(11, 7) = 330

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

Continue for all groups:
C(11,7) = 330
C(4,3) = 4
C(1,1) = 1 (last group)

Step 3 - Multiply:
Total ways = 330 × 4 × 1 (last group)
= 1320

Simplified formula:
= 11! / (7! × 3! × 1!)
= 39916800 / (5040 × 6 × 1)
= 1320

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 (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: 8
- Constraint: At least 6 men

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

Valid Cases (Men, Women) and Calculation:

(6 Men, 2 Women): C(8,6) × C(6,2) = 28 × 15 = 420
(7 Men, 1 Women): C(8,7) × C(6,1) = 8 × 6 = 48
(8 Men, 0 Women): C(8,8) × C(6,0) = 1 × 1 = 1

Final Calculation (Sum Rule):
Total ways = (Ways with 6 men) + (Ways with 7 men) + ...
= 420 + 48 + 1
= 469

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: Derangement - permutation where no element appears in its original position. Denoted as D(n) or !n.

Given:
- Number of items: 4
- 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

Answer: D(4) = 9

Intuitive Understanding:
Total arrangements = 4! = 24
Derangements = 9
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 4: 24/e ≈ 9 ≈ 9

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

Step-by-Step Solution (Stars and Bars):

Concept: This problem is equivalent to finding the number of non-negative integer solutions to $x_1 + x_2 + \dots + x_{k} = {n}$. This is a distribution problem of identical items ({n} 'stars') into distinct containers ({k} 'bins') using {k-1} separators ('bars').

Formula: The number of solutions is $\text{C}(n + k - 1, k - 1)$.
- $n$ = number of identical items (stars) = {n}
- $k$ = number of distinct recipients (bins) = {k}

Calculation:
Total arrangements = $\text{C}({n} + {k} - 1, {k} - 1)$
= $\text{C}({n + k - 1}, {k - 1})$
= {answer}

Key Distinction:
- Identical Items, Distinct Boxes (Stars and Bars): $\text{C}(n+k-1, k-1)$
- Distinct Items, Distinct Boxes (Distribution): $k^n$

Verification: This method guarantees that all solutions are non-negative ($x_i \ge 0$).

Step-by-Step Solution:

Concept: Distribution of distinct objects to distinct boxes - each object independently chooses a box.

Given:
- Distinct items: 5
- Distinct boxes: 4
- Empty boxes: Allowed

Strategy: Each item makes an independent choice of which box to go into.

Analysis:
- Item 1 can go into any of 4 boxes: 4 choices
- Item 2 can go into any of 4 boxes: 4 choices
- Item 3 can go into any of 4 boxes: 4 choices
- ...and so on for all 5 items

Formula: (number of boxes)^(number of items) = 4^5

Calculation:
Total ways = 4^5 = 1024

Key Distinction:
This is NOT a permutation or combination problem! It's a direct application of the multiplication principle.

Related Scenarios:
1. No empty boxes allowed (Surjection):
Use Inclusion-Exclusion: 4! × S(5,4)
where S(n,k) is the Stirling number of second kind

2. Identical items, distinct boxes:
This becomes a "stars and bars" problem: C(5+4-1, 4-1)

3. Distinct items, identical boxes (Partition):
Use Stirling numbers: Σ S(5,k) for k=1 to 4

Verification:
- With 1 box: answer should be 1 (all items in one box)
- With 5 boxes, one item: answer should be 5
- Our answer 1024 is reasonable: each item independently chooses from 4 options

Common Error: Don't use factorial or combination formulas here - items are making independent simultaneous choices.

Step-by-Step Solution:

Concept: Permutation with repetition. When some objects are identical, we divide by the factorial of the number of repetitions.

Analysis of 'TREE':
- Total letters: 4
- Some letters are repeated

Formula: n! / (p! × q! × ...)
where p, q, ... are the frequencies of repeated letters

Calculation:
If all letters were distinct: 4! = 24 arrangements

But some letters are repeated, so we have overcounted.
We must divide by 2! for the repeated letters.

Answer = 24 / 2 = 12

Key Principle: Identical objects create duplicate arrangements. We divide by their factorial to remove duplicates.

Why divide?: The repeated letters can be swapped among themselves without creating a new arrangement. We divide to account for this overcounting.

Step-by-Step Solution:

Concept: Distribution of distinct objects to distinct boxes - each object independently chooses a box.

Given:
- Distinct items: 6
- Distinct boxes: 3
- Empty boxes: Allowed

Strategy: Each item makes an independent choice of which box to go into.

Analysis:
- Item 1 can go into any of 3 boxes: 3 choices
- Item 2 can go into any of 3 boxes: 3 choices
- Item 3 can go into any of 3 boxes: 3 choices
- ...and so on for all 6 items

Formula: (number of boxes)^(number of items) = 3^6

Calculation:
Total ways = 3^6 = 729

Key Distinction:
This is NOT a permutation or combination problem! It's a direct application of the multiplication principle.

Related Scenarios:
1. No empty boxes allowed (Surjection):
Use Inclusion-Exclusion: 3! × S(6,3)
where S(n,k) is the Stirling number of second kind

2. Identical items, distinct boxes:
This becomes a "stars and bars" problem: C(6+3-1, 3-1)

3. Distinct items, identical boxes (Partition):
Use Stirling numbers: Σ S(6,k) for k=1 to 3

Verification:
- With 1 box: answer should be 1 (all items in one box)
- With 6 boxes, one item: answer should be 6
- Our answer 729 is reasonable: each item independently chooses from 3 options

Common Error: Don't use factorial or combination formulas here - items are making independent simultaneous choices.