Permutation & Combination - Beginner-Intermediate Level: shortcut methods BEGINNER-INTERMEDIATE

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 = 6 (total elements)
- k = 1 (exact fixed points)

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

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(6,1) × D(5)
= 6 × 44
= 264

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=6:
- D(6,0) = 265
- D(6,1) = 264
- D(6,2) = 135
- ... and so on.

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

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: 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: 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 10
- Divisors: 2 and 5

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

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

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

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

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

Step-by-Step Solution:

Concept: This problem uses the Fundamental Counting Principle (Multiplication Rule). When making sequential independent choices, multiply the number of options at each step.

Analysis:
- First choice: 3 options
- Second choice: 5 options
- Third choice: 3 options

Calculation:
Total ways = 3 × 5 × 3 = 45

Key Principle: For independent sequential events, multiply the number of choices at each stage.

Verification: Each of the 3 first choices can be paired with each of the 5 second choices (3×5=15), and each of these can be combined with any of the 3 third choices.

Step-by-Step Solution:

Concept: Counting numbers with distinct digits and divisibility constraint.

Given:
- Number length: 4 digits
- Digits must be distinct
- Constraint: Divisible by 6

Step 1 - Determine last digit constraint:
Divisible by 6 means:
Special divisibility rules apply

Step 2 - Count valid numbers:
For divisor 6, the count is 756

Step 3 - Verify distinctness:
All digits in the number are different (no repetition allowed).

Calculation: 756

Key Principle: When forming numbers with distinct digits:
- First digit cannot be 0
- Handle last digit constraints first
- Use permutations for remaining positions

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: Linear permutation of n distinct objects = n! (n factorial)

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

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

Calculation:
5! = 120

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

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
= 220 - 4
= 216

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

Verification: Answer should be less than C(12,3) = 220 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: Combination with mandatory inclusion constraint.

Given:
- Total people: 12
- Committee size: 5
- Must include: 3 specific people

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

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

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

Step 2 - Select Remaining Members:
Choose 2 people from remaining 9 people:
C(9,2) = 36

Calculation:
C(9,2) = (9)! / [2! × (7)!]
= 362880 / [2 × 5040]
= 36

Alternative Approach - Verification:
Think of it as: "We've used 3 spots, now choose 2 more from 9 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: 36 ways

Step-by-Step Solution:

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

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

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

Calculation:
6! = 720

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: 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 8
- Divisors: 3 and 5

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

Step 2 - Count numbers divisible by 5:
Numbers divisible by 5 = ⌊8/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 = ⌊8/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)
= 2 + 1 - 0
= 3

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

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 = 2 (items to select)

Calculation:
C(8,2) = 8! / [2! × 6!]
= 8! / [2 × 720]
= 40320 / [2 × 720]
= 28

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

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

Step 1 - Total arrangements if all were distinct:
9! = 362880

Step 2 - Account for identical objects:
9! = 362880 / 4! = 24 / 3! = 6 / 2! = 2

Final Calculation:
= 1260

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 9! = 362880.

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: Partitioning into groups of specified sizes. When group sizes are different, groups are automatically distinguishable by size.

Given:
- Total people: 11
- Group sizes: 10, 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 10 people from 11: C(11, 10) = 11

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

Continue for all groups:
C(11,10) = 11
C(1,1) = 1 (last group)

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

Simplified formula:
= 11! / (10! × 1!)
= 39916800 / (3628800 × 1)
= 11

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: 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: 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: 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.

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

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
= 220 - 4
= 216

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

Verification: Answer should be less than C(12,3) = 220 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