Permutation & Combination - Beginner Level: time management BEGINNER

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

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

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

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

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

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

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: 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 (Burnside's Lemma):

Concept: Circular permutations with identical objects and reflection symmetry require Burnside's Lemma.

Given: 2 red beads, 2 blue beads, total = 4 beads.

Formula for binary necklaces (2 colors, equal counts):
$$\text{Necklaces} = \frac{1}{2n} \sum_{d|n} \phi(d) \cdot \frac{(n/d)!}{(a/d)!(b/d)!} + \text{reflection term}$$

For our case:
- n = 4, a = 2, b = 2
- Term 1 (rotations): $\frac{1}{2n} \cdot \frac{n!}{a!b!} = \frac{1}{8} \cdot \frac{24}{22} = 0$
- Term 2 (reflections): 1

Total = 0 + 1 = 1

Alternative known result: For 2 red, 2 blue beads: (2-1)!/2 * something = 1

Key Principle: Burnside's Lemma averages the number of arrangements fixed by each symmetry operation (rotation and reflection).

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: 5 options
- Second choice: 4 options
- Third choice: 5 options

Calculation:
Total ways = 5 × 4 × 5 = 100

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

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

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

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

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

Step 3 - Apply multiplication principle:
Total = C(5,1) × D(4)
= 5 × 9
= 45

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=5:
- D(5,0) = 44
- D(5,1) = 45
- D(5,2) = 20
- ... and so on.

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

Step-by-Step Solution:

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

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

Apply Multiplication Principle:
Total numbers = 9 × 10 × 10 × ... × 10 (4 times)
= 9 × 10^4
= 9 × 10000
= 90000

Alternative Verification:
- Smallest 5-digit number: 10000 = 10000
- Largest 5-digit number: 99999 = 99999
- Total count: 99999 - 10000 + 1 = 90000

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

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: Group division where groups are indistinguishable (no labels like Team A, Team B).

Given:
- Total people: 8
- Group size: 4
- Number of groups: 2

Key Question: Are the groups distinguishable?
- If groups have labels (Team A, Team B): Groups are distinguishable
- If groups have no labels: Groups are indistinguishable (our case)

Strategy for Indistinguishable Groups:

Step 1 - Select first group:
Choose 4 people from 8: C(8,4)
C(8,4) = 8!/[4! × 4!] = 70

Step 2 - Remaining people form second group:
Remaining 4 people automatically form the other group: C(4,4) = 1

Step 3 - Remove overcounting:
Since groups are indistinguishable, we've counted each division twice.
(Selecting ABCD for group 1 and EFGH for group 2 is same as selecting EFGH for group 1 and ABCD for group 2)

Divide by 2! = 2

Calculation:
Total ways = C(8,4) / 2!
= 70 / 2
= 35

General Formula:
For dividing n items into k equal groups of size m each (where n = k×m):
Ways = C(n,m) × C(n-m,m) × ... × C(m,m) / k!
= n! / [(m!)^k × k!]

For our case:
= 8! / [(4!)^2 × 2!]
= 40320 / [24^2 × 2]
= 40320 / [576 × 2]
= 35

Contrast:
- Distinguishable groups (labeled teams): 70 ways
- Indistinguishable groups (unlabeled): 35 ways

Common Error: Forgetting to divide by k! when groups are indistinguishable.

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

Step 1 - Total arrangements if all were distinct:
8! = 40320

Step 2 - Account for identical objects:
8! = 40320 / 3! = 6 / 4! = 24

Final Calculation:
= 280

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 8! = 40320.

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: For necklaces with identical beads, we use Burnside's Lemma.

Given distribution: [2, 2, 2]

Result: 60 distinct necklaces.

Note: Full calculation requires summing over all rotation and reflection symmetries, which is complex for general cases.

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

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

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

Step 3 - Apply multiplication principle:
Total = C(5,1) × D(4)
= 5 × 9
= 45

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=5:
- D(5,0) = 44
- D(5,1) = 45
- D(5,2) = 20
- ... and so on.

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

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: 12
- Group sizes: 7, 3, 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 7 people from 12: C(12, 7) = 792

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

Continue for all groups:
C(12,7) = 792
C(5,3) = 10
C(2,2) = 1 (last group)

Step 3 - Multiply:
Total ways = 792 × 10 × 1 (last group)
= 7920

Simplified formula:
= 12! / (7! × 3! × 2!)
= 479001600 / (5040 × 6 × 2)
= 7920

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

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

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

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

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

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

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

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$): 7
- Step 1: Normal circular arrangements (rotations same) = $(n-1)!$ = 720
- Step 2: Account for reflection (flips) by dividing by 2.

Calculation:
Arrangements = $\frac{(7-1)!}2$
= $\frac{720}2$
= 360

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

Given:
- Total people: 13
- Non-participants: 3
- Participants: 10

Step 1 - Identify participants:
Only 10 people actually shake hands.

Step 2 - Calculate handshakes among participants:
Handshakes = C(10, 2) = 10×9/2

Calculation:
= 10×9/2 = 45
= 45

Key Point: Non-participants don't contribute to any handshake.

Step-by-Step Solution:

Concept: For necklaces with identical beads, we use Burnside's Lemma.

Given distribution: [2, 3, 4]

Result: 20160 distinct necklaces.

Note: Full calculation requires summing over all rotation and reflection symmetries, which is complex for general cases.

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: 8! = 40320 ways
- But in a circle: we fix one person's position as reference
- Remaining 7 people can be arranged in 7! ways

Calculation:
Circular arrangements = (8-1)! = 7! = 5040

Intuition: Fix one person at a position (say 12 o'clock). Now arrange the remaining 7 people in the 7 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: 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