Permutation & Combination - Beginner-Intermediate Level: step-by-step approach BEGINNER-INTERMEDIATE

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: 8, 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 8 people from 11: C(11, 8) = 165

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

Continue for all groups:
C(11,8) = 165
C(3,2) = 3
C(1,1) = 1 (last group)

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

Simplified formula:
= 11! / (8! × 2! × 1!)
= 39916800 / (40320 × 2 × 1)
= 495

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: Permutation with restriction - specific position must have certain type of letter.

Strategy: Fix the restricted position first, then arrange the remaining letters.

Analysis of 'EQUATION':
- Total letters: 8
- Vowels: E, U, A, I, O = 5 vowels
- First position must be a vowel

Step 1 - Fix First Position:
Choose a vowel for first position: 5 choices

Step 2 - Arrange Remaining:
Remaining 7 letters can be arranged in 7! ways
7! = 5040

Calculation:
Total arrangements = 5 × 5040 = 10080

Key Strategy: When dealing with restrictions:
1. Handle the restriction first (fix the constrained position)
2. Arrange the remaining elements freely
3. Multiply the results

Verification: This should be less than the total arrangements (8! = 40320) since we've added a constraint.

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: 5
- Vowels: 3
- Constraint: No two vowels together

Step 1 - Arrange Consonants:
Arrange 5 consonants: 5! = 120 ways

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

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

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

Step 4 - Apply Multiplication Principle:
Total arrangements = 120 × 20 × 6
= 120 × 20 × 6
= 14400

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

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

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 = 7 (total items)
- r = 4 (items to select)

Calculation:
C(7,4) = 7! / [4! × 3!]
= 7! / [24 × 6]
= 5040 / [24 × 6]
= 35

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

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

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

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: 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: Counting numbers with distinct digits greater than a threshold.

Step 1 - Total distinct-digit numbers:
First digit: 1-9 (9 choices)
Remaining 2 digits: choose and arrange from remaining 9 digits
Total = 9 × P(9, 2) = 9 × 72 = 648

Step 2 - Count those > 237:
Approximately half of all numbers will be greater than the median.
Answer ≈ 324

Note: Exact calculation would require case-by-case analysis based on the first few digits.

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

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

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

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

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

Step-by-Step Solution:

Concept: Handshake problem with subset participation.

Given:
- Total people: 12
- Non-participants: 2
- 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: Permutation with repetition. When some objects are identical, we divide by the factorial of the number of repetitions.

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

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 2:
Numbers divisible by 2 = ⌊8/2⌋ = 4
These are: 2, 4, 6, ..., 8

Step 3 - Count numbers divisible by BOTH 3 AND 2:
Numbers divisible by LCM(3,2) = 6
Count = ⌊8/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)
= 2 + 4 - 1
= 5

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

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: Counting numbers with distinct digits and divisibility constraint.

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

Step 1 - Determine last digit constraint:
Divisible by 5 means:
Last digit must be 0 or 5

Step 2 - Count valid numbers:
For divisor 5, the count is 5712

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

Calculation: 5712

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: 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: 3 options

Calculation:
Total ways = 5 × 4 × 3 = 60

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 3 third choices.

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:

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: This is a combination problem because the order of selection doesn't matter.

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

Given:
- n = 7 (total items)
- r = 2 (items to select)

Calculation:
C(7,2) = 7! / [2! × 5!]
= 7! / [2 × 120]
= 5040 / [2 × 120]
= 21

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

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

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

Step-by-Step Solution:

Concept: Combination with constraints - selection from multiple groups with specific requirements.

Given:
- Men available: 7
- Women available: 5
- Committee size: 5
- Required: 2 men and 3 women

Strategy: Select from each group independently, then multiply (Multiplication Principle).

Step 1 - Select Men:
Choose 2 men from 7 men = C(7,2)
C(7,2) = 7! / [2! × 5!] = 21

Step 2 - Select Women:
Choose 3 women from 5 women = C(5,3)
C(5,3) = 5! / [3! × 2!] = 10

Step 3 - Apply Multiplication Principle:
Total ways = C(7,2) × C(5,3)
= 21 × 10
= 210

Key Principle: When selecting from different independent groups with specific requirements from each:
- Calculate selections from each group separately
- Multiply the results

Common Error: Don't add the combinations - multiply them! Each selection from one group can be paired with each selection from the other.

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