Permutation & Combination - Beginner-Intermediate Level: conceptual clarity BEGINNER-INTERMEDIATE

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:

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: Permutation with fixed position constraint.

Strategy: Fix the restricted position, then arrange remaining elements.

Given:
- Total people: 7
- Constraint: One specific person must be first

Step 1 - Fix First Position:
First position has only 1 choice (the specific person)

Step 2 - Arrange Remaining:
Remaining 6 people can be arranged in 6! ways

Calculation:
Total arrangements = 1 × 6!
= 720
= 2160

Alternative Approach:
Total arrangements without restriction = 7! = 5040
Fraction with specific person first = 5040 / 7 = 2160

Key Principle: Fixing one position reduces the problem to arranging (n-1) elements.

Step-by-Step Solution:

Concept: Handshake problem with selective participation.

Given:
- Total: 8 people
- VIPs: 3 (shake with everyone)
- Non-VIPs: 5 (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 = 5 × 3 = 15

Step 3 - Subtract restricted handshakes:
Actual handshakes = Total possible - Forbidden handshakes
= 28 - 15
= 13

Alternative direct count:
- VIP to VIP: C(3, 2) = 3
- VIP to Non-VIP: 0 (forbidden)
- Non-VIP to Non-VIP: C(5, 2) = 10
Total = 3 + 10 = 13

Verification: Both methods give the same result.

Step-by-Step Solution:

Concept: This is a combination problem because the order of selection doesn't matter.

Formula: C(n,r) = n! / [r!(n-r)!]

Given:
- n = 6 (total items)
- r = 4 (items to select)

Calculation:
C(6,4) = 6! / [4! × 2!]
= 6! / [24 × 2]
= 720 / [24 × 2]
= 15

Alternative Method (using simplified calculation):
C(6,4) = (6 × 5 × ... × 3) / 4!

Key Distinction:
- Use COMBINATION when order doesn't matter (selecting)
- Use PERMUTATION when order matters (arranging)

Verification: The answer must be less than 6! since we're selecting, not arranging.

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: 6
- Group sizes: 5, 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 5 people from 6: C(6, 5) = 6

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

Continue for all groups:
C(6,5) = 6
C(1,1) = 1 (last group)

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

Simplified formula:
= 6! / (5! × 1!)
= 720 / (120 × 1)
= 6

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

Step-by-Step Solution:

Concept: Combination with mandatory inclusion constraint.

Given:
- Total people: 12
- 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: 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 3 people from remaining 10 people:
C(10,3) = 120

Calculation:
C(10,3) = (10)! / [3! × (7)!]
= 3628800 / [6 × 5040]
= 120

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

Related Problem Types:

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

2. At least one specific person:
Total ways - Ways without that person
= C(12,5) - C(12-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: 120 ways

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: 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: 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 (Sum Rule):

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

Given:
- Men available: 9
- 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(9,6) × C(6,2) = 84 × 15 = 1260
(7 Men, 1 Women): C(9,7) × C(6,1) = 36 × 6 = 216
(8 Men, 0 Women): C(9,8) × C(6,0) = 9 × 1 = 9

Final Calculation (Sum Rule):
Total ways = (Ways with 6 men) + (Ways with 7 men) + ...
= 1260 + 216 + 9
= 1485

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 (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 3 men

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

Valid Cases (Men, Women) and Calculation:

(3 Men, 5 Women): C(8,3) × C(6,5) = 56 × 6 = 336
(4 Men, 4 Women): C(8,4) × C(6,4) = 70 × 15 = 1050
(5 Men, 3 Women): C(8,5) × C(6,3) = 56 × 20 = 1120
(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 3 men) + (Ways with 4 men) + ...
= 336 + 1050 + 1120 + 420 + 48 + 1
= 2975

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:

Concept: This is a combination problem because the order of selection doesn't matter.

Formula: C(n,r) = n! / [r!(n-r)!]

Given:
- n = 8 (total items)
- r = 4 (items to select)

Calculation:
C(8,4) = 8! / [4! × 4!]
= 8! / [24 × 24]
= 40320 / [24 × 24]
= 70

Alternative Method (using simplified calculation):
C(8,4) = (8 × 7 × ... × 5) / 4!

Key Distinction:
- Use COMBINATION when order doesn't matter (selecting)
- Use PERMUTATION when order matters (arranging)

Verification: The answer must be less than 8! since we're selecting, not arranging.

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: 10
- Distribution: Type 1: 2, Type 2: 2, Type 3: 4, Type 4: 2

Step 1 - Total arrangements if all were distinct:
10! = 3628800

Step 2 - Account for identical objects:
10! = 3628800 / 2! = 2 / 2! = 2 / 4! = 24 / 2! = 2

Final Calculation:
= 18900

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 10! = 3628800.

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: 6
- 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
D(6) = (6-1)[D(5) + D(4)] = 5 × [44 + 9] = 265

Answer: D(6) = 265

Intuitive Understanding:
Total arrangements = 6! = 720
Derangements = 265
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 6: 720/e ≈ 265 ≈ 265

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

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: 9
- 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 9 points: C(9,3)
C(9,3) = 9! / [3! × 6!] = 84

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
= 84 - 4
= 80

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

Verification: Answer should be less than C(9,3) = 84 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: 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: Permutation with repetition. When some objects are identical, we divide by the factorial of the number of repetitions.

Analysis of 'BOOK':
- 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 11
- Divisors: 3 and 2

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

Step 2 - Count numbers divisible by 2:
Numbers divisible by 2 = ⌊11/2⌋ = 5
These are: 2, 4, 6, ..., 10

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

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

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