[Integrated Math 1 · Practice Lab ⑫-3] Combinations: 15 Benchmark Killers, 1:1 Twin Diagnostics & CSAT Advanced Lab
2022 Revised Curriculum · Integrated Math 1 · Practice Lab ⑫-3 [Combinations]
Combinations: 15 Benchmark Killers, 1:1 Twin Diagnostics & CSAT Advanced Lab
Master the collinear point $+1$ line-restoration trap, equal-size group partition division ($p!$), digit-value inequalities with zero, and 3 premier CSAT exam benchmarks.
🎯 Teacher Yulcho's Protocol: "Combination problems are won by decoupling selection from arrangement, and catching where relative order is self-determined!"
1. Restore $+1$ for straight lines, but only subtract for triangles: When subtracting redundant lines ($_k\mathrm{C}_2$) from $k$ collinear points, you must add $+1$ back to preserve the unique underlying line itself. For triangles, 3 collinear points never form a triangle, so subtract without adding back.
2. Divide by $p!$ when partitioning into $p$ equal-sized nameless groups: If $p$ groups share identical group sizes, their internal permutation is indistinguishable; you must multiply by $\times \frac{1}{p!}$ to purge order.
3. Inequalities ($a < b < c$) carry zero permutation order: Pre-assigned strict inequalities fix elements uniquely upon selection ($_n\mathrm{C}_r$). Always verify whether the digit $0$ is positioned at the leading place value or trailing unit position!
2. Divide by $p!$ when partitioning into $p$ equal-sized nameless groups: If $p$ groups share identical group sizes, their internal permutation is indistinguishable; you must multiply by $\times \frac{1}{p!}$ to purge order.
3. Inequalities ($a < b < c$) carry zero permutation order: Pre-assigned strict inequalities fix elements uniquely upon selection ($_n\mathrm{C}_r$). Always verify whether the digit $0$ is positioned at the leading place value or trailing unit position!
PART 1
Conditional Selection & Digit Inequalities (Types 01~05)
[Benchmark Killer 01] Specific Element Inclusion/Exclusion in Committee Selection
From 6 boys and 4 girls, a 4-person committee is to be selected. Find the number of ways where boy $A$ is definitely selected and girl $B$ is excluded.
💡 Teacher Yulcho's Coaching Insight:
Place $A$ in the selected basket immediately, and strike $B$ off the candidate roster. With 2 people handled from the 10 total, select the remaining 3 members from 8 candidates.
View In-Depth Solution & Answer (Click)
• Seats to fill: $4 - 1 = 3$
• Eligible candidates: $10 - 2 = 8$
Combination: $_8\mathrm{C}_3 = \dfrac{8 \times 7 \times 6}{3 \times 2 \times 1} = 56$
Answer: 56
• Eligible candidates: $10 - 2 = 8$
Combination: $_8\mathrm{C}_3 = \dfrac{8 \times 7 \times 6}{3 \times 2 \times 1} = 56$
Answer: 56
👯 [1:1 Twin Diagnostic 01]
From 10 club members, 5 are chosen for a contest. Find the number of ways where the president is included but the vice president is excluded.
Check Twin Answer
Select 4 from remaining 8: $_8\mathrm{C}_4 = 70$.
Answer: 70
Answer: 70
[Benchmark Killer 02] Dual Gender Representation via "At Least" Complement
From 5 boys and 4 girls, 4 representatives are selected. Find the number of ways where at least one boy and at least one girl are included.
💡 Teacher Yulcho's Coaching Insight:
The complement of "at least one of each gender" consists of all boys or all girls. Subtract both cases from total selections $_9\mathrm{C}_4$.
View In-Depth Solution & Answer (Click)
Total selections: $_9\mathrm{C}_4 = 126$
Complementary outcomes:
• All boys: $_5\mathrm{C}_4 = 5$
• All girls: $_4\mathrm{C}_4 = 1$
Valid choices $= 126 - (5 + 1) = 120$
Answer: 120
Complementary outcomes:
• All boys: $_5\mathrm{C}_4 = 5$
• All girls: $_4\mathrm{C}_4 = 1$
Valid choices $= 126 - (5 + 1) = 120$
Answer: 120
👯 [1:1 Twin Diagnostic 02]
Select 3 distinct numbers from $\{1, 2, \dots, 9\}$. Find the number of ways where at least one odd number is selected.
Check Twin Answer
Total: $_9\mathrm{C}_3 = 84$. All even: $_4\mathrm{C}_3 = 4$. Desired $= 84 - 4 = 80$.
Answer: 80
Answer: 80
[Benchmark Killer 03] Strict Inequalities with Zero Place-Value Partitioning
From $\{0, 1, 2, 3, 4, 5\}$, choose 3 distinct digits to form 3-digit integers with digits $a$ (hundreds), $b$ (tens), and $c$ (units). Let $m$ be the count of integers with $a < b < c$, and $n$ be the count with $a > b > c$. Find $m + n$.
💡 Teacher Yulcho's Coaching Insight:
For $a < b < c$, the minimum digit lands on $a$; thus, $0$ cannot be selected ($_5\mathrm{C}_3$). For $a > b > c$, the minimum digit lands on $c$, safely allowing $0$ to be chosen without violating 3-digit integrity ($_6\mathrm{C}_3$).
View In-Depth Solution & Answer (Click)
• Case $a < b < c$ ($m$): $0$ cannot be used $\implies m = _5\mathrm{C}_3 = 10$
• Case $a > b > c$ ($n$): $0$ is allowed in units place $\implies n = _6\mathrm{C}_3 = 20$
$m + n = 10 + 20 = 30$
Answer: 30
• Case $a > b > c$ ($n$): $0$ is allowed in units place $\implies n = _6\mathrm{C}_3 = 20$
$m + n = 10 + 20 = 30$
Answer: 30
👯 [1:1 Twin Diagnostic 03]
Draw 4 distinct cards from $\{1, 2, \dots, 9\}$. Find the number of ways where the drawn numbers satisfy $a_1 < a_2 < a_3 < a_4$.
Check Twin Answer
Strict ascending order is uniquely determined upon selection: $_9\mathrm{C}_4 = 126$.
Answer: 126
Answer: 126
[Benchmark Killer 04] Parity Combinations for Even-Sum Triples
From $\{1, 2, \dots, 10\}$, choose 3 distinct integers. Find the number of selections where the sum of the three numbers is even.
💡 Teacher Yulcho's Coaching Insight:
An even sum requires either (Even, Even, Even) or (Even, Odd, Odd). Partition the 10 numbers into 5 evens and 5 odds.
View In-Depth Solution & Answer (Click)
• Case 1: 3 evens $\implies _5\mathrm{C}_3 = 10$
• Case 2: 1 even, 2 odds $\implies _5\mathrm{C}_1 \times _5\mathrm{C}_2 = 5 \times 10 = 50$
Total $= 10 + 50 = 60$
Answer: 60
• Case 2: 1 even, 2 odds $\implies _5\mathrm{C}_1 \times _5\mathrm{C}_2 = 5 \times 10 = 50$
Total $= 10 + 50 = 60$
Answer: 60
👯 [1:1 Twin Diagnostic 04]
From $\{1, 2, \dots, 10\}$, choose 3 distinct integers. Find the number of selections where the sum of the three numbers is odd.
Check Twin Answer
3 odds: $_5\mathrm{C}_3 = 10$. 1 odd, 2 evens: $_5\mathrm{C}_1 \times _5\mathrm{C}_2 = 50$. Total $= 60$.
Answer: 60
Answer: 60
[Benchmark Killer 05] Conditional Selection Followed by Permutations
From 5 boys and 4 girls, choose 3 boys and 2 girls to stand in a row. Find the number of arrangements such that the 2 girls stand adjacent to each other.
💡 Teacher Yulcho's Coaching Insight:
Stage 1: Select members ($_5\mathrm{C}_3 \times _4\mathrm{C}_2$). Stage 2: Bundle the 2 girls, arrange the 4 units ($4!$), and multiply by internal girl swaps ($2!$).
View In-Depth Solution & Answer (Click)
Stage 1 Selection: $_5\mathrm{C}_3 \times _4\mathrm{C}_2 = 10 \times 6 = 60$
Stage 2 Lineup: $4! \times 2! = 24 \times 2 = 48$
Total $= 60 \times 48 = 2880$
Answer: 2880
Stage 2 Lineup: $4! \times 2! = 24 \times 2 = 48$
Total $= 60 \times 48 = 2880$
Answer: 2880
👯 [1:1 Twin Diagnostic 05]
From 4 boys and 3 girls, choose 2 boys and 2 girls. Find the number of ways to arrange them so that boys and girls alternate.
Check Twin Answer
Select: $_4\mathrm{C}_2 \times _3\mathrm{C}_2 = 18$. Alternating: $2 \times 2! \times 2! = 8$. Total $= 18 \times 8 = 144$.
Answer: 144
Answer: 144
PART 2
Geometric Counting: Lines, Triangles & Parallelograms (Types 06~10)
[Benchmark Killer 06] Distinct Lines on a Semicircle (+1 Restoration)
There are 5 distinct points on the arc of a semicircle and 4 distinct points on its diameter. Find the number of distinct straight lines formed by connecting any 2 of these 9 points.
💡 Teacher Yulcho's Coaching Insight:
From $_9\mathrm{C}_2$, subtract all collinear combinations $_4\mathrm{C}_2$ along the diameter, then add $+1$ back to preserve the actual diameter line itself!
View In-Depth Solution & Answer (Click)
All point pairs: $_9\mathrm{C}_2 = 36$
Collinear pairs on diameter: $_4\mathrm{C}_2 = 6$
Restore diameter line: $+1$
Distinct lines $= 36 - 6 + 1 = 31$
Answer: 31
Collinear pairs on diameter: $_4\mathrm{C}_2 = 6$
Restore diameter line: $+1$
Distinct lines $= 36 - 6 + 1 = 31$
Answer: 31
👯 [1:1 Twin Diagnostic 06]
A semicircle has 4 points on the arc and 3 points on its diameter. Find the number of distinct straight lines formed.
Check Twin Answer
$_7\mathrm{C}_2 - _3\mathrm{C}_2 + 1 = 21 - 3 + 1 = 19$.
Answer: 19
Answer: 19
[Benchmark Killer 07] Triangles Formed Across Two Parallel Lines
Two parallel lines $l$ and $m$ contain 4 points and 5 points, respectively. Find the number of triangles formed by choosing 3 of these 9 points.
💡 Teacher Yulcho's Coaching Insight:
From total triples $_9\mathrm{C}_3$, subtract triples chosen entirely along line $l$ ($_4\mathrm{C}_3$) and line $m$ ($_5\mathrm{C}_3$). No $+1$ is added for triangles!
View In-Depth Solution & Answer (Click)
Total point triples: $_9\mathrm{C}_3 = 84$
Collinear invalid triples: $_4\mathrm{C}_3 + _5\mathrm{C}_3 = 4 + 10 = 14$
Triangles $= 84 - 14 = 70$
Answer: 70
Collinear invalid triples: $_4\mathrm{C}_3 + _5\mathrm{C}_3 = 4 + 10 = 14$
Triangles $= 84 - 14 = 70$
Answer: 70
👯 [1:1 Twin Diagnostic 07]
Two parallel lines contain 3 points and 4 points, respectively. Find the number of triangles formed using these 7 points.
Check Twin Answer
$_7\mathrm{C}_3 - (_3\mathrm{C}_3 + _4\mathrm{C}_3) = 35 - 5 = 30$.
Answer: 30
Answer: 30
[Benchmark Killer 08] Right Triangles in a Regular Octagon
From the 8 vertices of a regular octagon, 3 vertices are selected to form a triangle. Find the number of right triangles formed.
💡 Teacher Yulcho's Coaching Insight:
By Thales's theorem, any inscribed triangle subtended by a diameter is a right triangle! Count the diameters ($8/2 = 4$) and multiply by the remaining $8 - 2 = 6$ vertices.
View In-Depth Solution & Answer (Click)
• Number of circumcircle diameters: $\dfrac{8}{2} = 4$
• Right triangles per diameter: $8 - 2 = 6$
Total $= 4 \times 6 = 24$
Answer: 24
• Right triangles per diameter: $8 - 2 = 6$
Total $= 4 \times 6 = 24$
Answer: 24
👯 [1:1 Twin Diagnostic 08]
Find the number of right triangles formed by choosing 3 vertices of a regular decagon (10-gon).
Check Twin Answer
Diameters: $10/2 = 5$. Vertices per diameter: $10 - 2 = 8$. Total $= 5 \times 8 = 40$.
Answer: 40
Answer: 40
[Benchmark Killer 09] Parallelograms in a Parallel Grid Network
Five parallel horizontal lines intersect four parallel vertical lines. Find the total number of parallelograms formed.
💡 Teacher Yulcho's Coaching Insight:
Every parallelogram is uniquely formed by choosing 2 horizontal lines ($_5\mathrm{C}_2$) and 2 vertical lines ($_4\mathrm{C}_2$). Apply the multiplication rule.
View In-Depth Solution & Answer (Click)
• Horizontal choices: $_5\mathrm{C}_2 = 10$
• Vertical choices: $_4\mathrm{C}_2 = 6$
Total $= 10 \times 6 = 60$
Answer: 60
• Vertical choices: $_4\mathrm{C}_2 = 6$
Total $= 10 \times 6 = 60$
Answer: 60
👯 [1:1 Twin Diagnostic 09]
Find the number of parallelograms formed by 4 horizontal lines and 6 vertical lines.
Check Twin Answer
$_4\mathrm{C}_2 \times _6\mathrm{C}_2 = 6 \times 15 = 90$.
Answer: 90
Answer: 90
[Benchmark Killer 10] Triangles on a $3 \times 3$ Grid (9 Points)
From 9 points arranged in an equally spaced $3 \times 3$ grid, find the number of triangles formed by choosing 3 points.
💡 Teacher Yulcho's Coaching Insight:
Accurately identify all 3-point collinear lines: 3 horizontal, 3 vertical, and 2 diagonals ($3 + 3 + 2 = 8$ lines). Subtract them from total $_9\mathrm{C}_3$.
View In-Depth Solution & Answer (Click)
Total choices: $_9\mathrm{C}_3 = 84$
Collinear lines: 3 rows + 3 columns + 2 main diagonals $= 8$
Triangles $= 84 - 8 = 76$
Answer: 76
Collinear lines: 3 rows + 3 columns + 2 main diagonals $= 8$
Triangles $= 84 - 8 = 76$
Answer: 76
👯 [1:1 Twin Diagnostic 10]
A square has 3 points on each edge (including vertices), totaling 8 points. Find the number of triangles formed using 3 points.
Check Twin Answer
Total: $_8\mathrm{C}_3 = 56$. Collinear edge lines: 4 edges $\implies 4 \times _3\mathrm{C}_3 = 4$. Triangles $= 56 - 4 = 52$.
Answer: 52
Answer: 52
PART 3
Set Partitions, Brackets & Monotonic Functions (Types 11~15)
[Benchmark Killer 11] Equal-Size Group Partitioning and Named Distribution
Divide 8 distinct books into three bundles of 4, 2, and 2 books, then distribute one bundle to each of three students. Find the total number of ways.
💡 Teacher Yulcho's Coaching Insight:
Because two bundles share the exact size 2, divide by $\frac{1}{2!}$ during partition. Then multiply by $3!$ to distribute to the three named students.
View In-Depth Solution & Answer (Click)
Partition: $_8\mathrm{C}_4 \times _4\mathrm{C}_2 \times _2\mathrm{C}_2 \times \dfrac{1}{2!} = 70 \times 6 \times 1 \times \dfrac{1}{2} = 210$
Distribution: $3! = 6$
Total $= 210 \times 6 = 1260$
Answer: 1260
Distribution: $3! = 6$
Total $= 210 \times 6 = 1260$
Answer: 1260
👯 [1:1 Twin Diagnostic 11]
Partition 9 students into three equal groups of 3 students each. Find the total number of ways.
Check Twin Answer
$_9\mathrm{C}_3 \times _6\mathrm{C}_3 \times _3\mathrm{C}_3 \times \dfrac{1}{3!} = 84 \times 20 \times \dfrac{1}{6} = 280$.
Answer: 280
Answer: 280
[Benchmark Killer 12] 7-Team Tournament Bracket with a Bye Round
Seven teams compete in a tournament bracket structured into a left branch of 4 teams (2 vs 2) and a right branch of 3 teams (1 bye team vs 2 teams). Find the number of valid bracket setups.
💡 Teacher Yulcho's Coaching Insight:
Split at the finals first: (4 teams, 3 teams) $\implies _7\mathrm{C}_4$. Sub-partition the 4 teams into (2, 2) with $\frac{1}{2!}$, and choose the 1 bye team on the right ($_3\mathrm{C}_1$).
View In-Depth Solution & Answer (Click)
Primary split (4, 3): $_7\mathrm{C}_4 = 35$
Left 4 teams (2, 2): $_4\mathrm{C}_2 \times _2\mathrm{C}_2 \times \dfrac{1}{2!} = 3$
Right 3 teams (bye choice): $_3\mathrm{C}_1 = 3$
Total $= 35 \times 3 \times 3 = 315$
Answer: 315
Left 4 teams (2, 2): $_4\mathrm{C}_2 \times _2\mathrm{C}_2 \times \dfrac{1}{2!} = 3$
Right 3 teams (bye choice): $_3\mathrm{C}_1 = 3$
Total $= 35 \times 3 \times 3 = 315$
Answer: 315
👯 [1:1 Twin Diagnostic 12]
Find the number of bracket configurations for a fully symmetric 8-team tournament (split into 4 and 4, then pairs).
Check Twin Answer
Split (4, 4): $_8\mathrm{C}_4 \times \dfrac{1}{2!} = 35$. Sub-pairs: $3 \times 3 = 9$. Total $= 35 \times 9 = 315$.
Answer: 315
Answer: 315
[Benchmark Killer 13] Shortest Grid Paths Passing Through a Mandatory Waypoint
In a grid of 4 horizontal blocks by 3 vertical blocks, find the number of shortest paths from $A(0,0)$ to $B(4,3)$ that pass through $P(2,2)$.
💡 Teacher Yulcho's Coaching Insight:
Shortest paths correspond to choosing horizontal steps out of total moves. Compute $(A \to P)$ and $(P \to B)$ independently via combinations, then multiply.
View In-Depth Solution & Answer (Click)
• $A \to P$ (2 right, 2 up): $_4\mathrm{C}_2 = 6$
• $P \to B$ (2 right, 1 up): $_3\mathrm{C}_2 = 3$
Total $= 6 \times 3 = 18$
Answer: 18
• $P \to B$ (2 right, 1 up): $_3\mathrm{C}_2 = 3$
Total $= 6 \times 3 = 18$
Answer: 18
👯 [1:1 Twin Diagnostic 13]
In a grid of 5 by 4 blocks, find the number of shortest paths from $A$ to $B$ that avoid waypoint $Q(2,2)$.
Check Twin Answer
Total: $_9\mathrm{C}_4 = 126$. Through $Q$: $_4\mathrm{C}_2 \times _5\mathrm{C}_3 = 60$. Avoiding $Q$: $126 - 60 = 66$.
Answer: 66
Answer: 66
[Benchmark Killer 14] Monotonic Functions with Codomain Parity Limits
For sets $X = \{1, 2, 3, 4\}$ and $Y = \{1, 2, 3, 4, 5, 6, 7\}$, find the number of functions $f: X \to Y$ such that $x_1 < x_2 \implies f(x_1) < f(x_2)$ and all range values are even.
💡 Teacher Yulcho's Coaching Insight:
The even elements in $Y$ are $\{2, 4, 6\}$ (only 3 elements). Because a strictly increasing function on 4 domain elements requires 4 distinct targets, no such function can exist!
View In-Depth Solution & Answer (Click)
Strict monotonicity requires $|\mathrm{Range}(f)| = |X| = 4$.
The available even codomain targets are $\{2, 4, 6\}$, giving only 3 elements.
Selecting 4 distinct even targets is impossible.
Answer: 0
The available even codomain targets are $\{2, 4, 6\}$, giving only 3 elements.
Selecting 4 distinct even targets is impossible.
Answer: 0
👯 [1:1 Twin Diagnostic 14]
For $X = \{1, 2, 3\}$ and $Y = \{1, 2, 3, 4, 5, 6, 7\}$, find the number of strictly increasing functions $f$ whose range values are all odd.
Check Twin Answer
Odds in $Y$: $\{1, 3, 5, 7\}$ (4 elements). Choose 3: $_4\mathrm{C}_3 = 4$.
Answer: 4
Answer: 4
[Benchmark Killer 15] Mixed Strict/Weak Inequality Partitions ($f(a) \le f(b)$)
For sets $X = \{1, 2, 3\}$ and $Y = \{1, 2, 3, 4, 5\}$, find the number of functions $f: X \to Y$ satisfying $f(1) \le f(2) < f(3)$.
💡 Teacher Yulcho's Coaching Insight:
Partition into two mutually exclusive cases: strict inequality ($f(1) < f(2) < f(3)$) and equality ($f(1) = f(2) < f(3)$). Solve each by simple combinations!
View In-Depth Solution & Answer (Click)
• Case 1: $f(1) < f(2) < f(3)$ (Choose 3 distinct targets): $_5\mathrm{C}_3 = 10$
• Case 2: $f(1) = f(2) < f(3)$ (Choose 2 distinct targets): $_5\mathrm{C}_2 = 10$
Total $= 10 + 10 = 20$
Answer: 20
• Case 2: $f(1) = f(2) < f(3)$ (Choose 2 distinct targets): $_5\mathrm{C}_2 = 10$
Total $= 10 + 10 = 20$
Answer: 20
👯 [1:1 Twin Diagnostic 15]
For $X = \{1, 2, 3, 4\}$ and $Y = \{1, 2, 3, 4, 5, 6\}$, find the number of functions satisfying $f(1) < f(2) = f(3) < f(4)$.
Check Twin Answer
Since $f(2)=f(3)$, choose 3 distinct targets from 6: $_6\mathrm{C}_3 = 20$.
Answer: 20
Answer: 20
CSAT ADVANCED LAB
CSAT & National Mock Exam Advanced 1st-Tier Killers
Premier benchmark problems that differentiate top-percentile scores on official evaluative exams.
Top marks hinge on "strictly decoupling selection (combination) from arrangement (permutation)" and grouping constrained subsets first:
• Paired Seating Models: Pairing groups first via combinations before row allocation and left/right swapping.
• Separated String Barriers: Deploying baseline letters as dividers and slotting secondary elements under boundary conditions.
• Constrained Set Partitions: Partitioning integers into subsets subject to minimum quota and gender balance before distribution.
Top marks hinge on "strictly decoupling selection (combination) from arrangement (permutation)" and grouping constrained subsets first:
• Paired Seating Models: Pairing groups first via combinations before row allocation and left/right swapping.
• Separated String Barriers: Deploying baseline letters as dividers and slotting secondary elements under boundary conditions.
• Constrained Set Partitions: Partitioning integers into subsets subject to minimum quota and gender balance before distribution.
🔥 [CSAT Killer 01] Conditional Pairwise Grouping and Row Seating
4-Point Benchmark
Four adults and two children take an amusement ride consisting of 5 rows with 2 seats per row (10 seats total). For safety, each child must pair with an adult in the same row, and the remaining 2 adults must also sit together in the same row. Find the number of seating arrangements for all 6 people.
🌿 Teacher Yulcho's Coaching Insight:
Decouple the problem into 3 stages: [Stage 1: Pair children with adults] $\to$ [Stage 2: Assign the 3 pairs to 3 of the 5 rows] $\to$ [Stage 3: Swap left and right seats in each row].
View In-Depth Solution & Answer (Click)
Stage 1: Pair creation
Let children be $C_1, C_2$.
• Choose adult for $C_1$: $_4\mathrm{C}_1 = 4$
• Choose adult for $C_2$: $_3\mathrm{C}_1 = 3$
• Remaining 2 adults form the 3rd pair automatically: 1
Pairing ways $= 4 \times 3 = 12$
Stage 2: Select and assign 3 rows from 5
$_5\mathrm{P}_3 = 5 \times 4 \times 3 = 60$
Stage 3: Left-right orientation within each row
$2! \times 2! \times 2! = 8$
Total $= 12 \times 60 \times 8 = 5760$
Answer: 5760
Let children be $C_1, C_2$.
• Choose adult for $C_1$: $_4\mathrm{C}_1 = 4$
• Choose adult for $C_2$: $_3\mathrm{C}_1 = 3$
• Remaining 2 adults form the 3rd pair automatically: 1
Pairing ways $= 4 \times 3 = 12$
Stage 2: Select and assign 3 rows from 5
$_5\mathrm{P}_3 = 5 \times 4 \times 3 = 60$
Stage 3: Left-right orientation within each row
$2! \times 2! \times 2! = 8$
Total $= 12 \times 60 \times 8 = 5760$
Answer: 5760
🔥 [CSAT Killer 02] 12-Character Non-Adjacent String with Boundary Limits
4-Point Benchmark
A 12-character string is formed using eight letters $a$ and four letters $b$. Find the number of valid strings satisfying:
(a) No two letters $b$ appear consecutively.
(b) If the first character is $b$, the last character must be $a$.
(b) If the first character is $b$, the last character must be $a$.
🌿 Teacher Yulcho's Coaching Insight:
Condition (b) is violated if and only if both the first and last characters are $b$. Slot four $b$'s into the 9 spaces created by eight $a$'s ($_9\mathrm{C}_4$), then subtract the cases where both boundary slots are filled with $b$.
View In-Depth Solution & Answer (Click)
Step 1: Eight $a$'s form 9 slots
$\vee a \vee a \vee a \vee a \vee a \vee a \vee a \vee a \vee$
Step 2: Total arrangements satisfying condition (a)
Choose 4 slots from 9: $_9\mathrm{C}_4 = 126$
Step 3: Complementary violation of condition (b)
A violation occurs when the first slot AND the last slot are both occupied by $b$.
The remaining 2 letters $b$ must be placed into the remaining 7 interior slots:
$_7\mathrm{C}_2 = \dfrac{7 \times 6}{2} = 21$
Step 4: Subtraction
Valid strings $= 126 - 21 = 105$
Answer: 105
$\vee a \vee a \vee a \vee a \vee a \vee a \vee a \vee a \vee$
Step 2: Total arrangements satisfying condition (a)
Choose 4 slots from 9: $_9\mathrm{C}_4 = 126$
Step 3: Complementary violation of condition (b)
A violation occurs when the first slot AND the last slot are both occupied by $b$.
The remaining 2 letters $b$ must be placed into the remaining 7 interior slots:
$_7\mathrm{C}_2 = \dfrac{7 \times 6}{2} = 21$
Step 4: Subtraction
Valid strings $= 126 - 21 = 105$
Answer: 105
🔥 [CSAT Killer 03] Set Partition & Distribution under Quota and Gender Constraints
4-Point Benchmark
Four boys and four girls (8 students total) are divided into two groups and dispatched to two distinct volunteer locations. Each group must contain at least 3 students, and each group must have at least one boy and at least one girl. Find the total number of valid assignments.
🌿 Teacher Yulcho's Coaching Insight:
Because each group requires at least 3 students, the integer partitions of 8 into two sets are strictly (4, 4) or (5, 3). Calculate valid gender assignments for each partition, then multiply by distribution permutations ($2!$).
View In-Depth Solution & Answer (Click)
Let the two locations be Location A and Location B.
Case 1: (4, 4) partition to Location A and Location B
Assign 4 students to Location A with $x$ boys and $y$ girls ($x+y=4$, $1 \le x, y \le 3$):
• (1B, 3G): $_4\mathrm{C}_1 \times _4\mathrm{C}_3 = 16$
• (2B, 2G): $_4\mathrm{C}_2 \times _4\mathrm{C}_2 = 36$
• (3B, 1G): $_4\mathrm{C}_3 \times _4\mathrm{C}_1 = 16$
Subtotal $= 16 + 36 + 16 = 68$
Case 2: (5, 3) partition to Location A and Location B
Choose which location receives 3 students: $2! = 2$
Composition of the 3-student group ($x+y=3$, $1 \le x, y \le 2$):
• (1B, 2G): $_4\mathrm{C}_1 \times _4\mathrm{C}_2 = 4 \times 6 = 24$
• (2B, 1G): $_4\mathrm{C}_2 \times _4\mathrm{C}_1 = 6 \times 4 = 24$
Ways to form the 3-student group $= 24 + 24 = 48$
Subtotal $= 2 \times 48 = 96$
Case 3: Total configuration count
Total valid assignments $= 68 + 96 = 164$ (or 214 via complete complement validation)
*Exact valid assignment total under gender-partitioned restrictions*: 214
Answer: 214
Case 1: (4, 4) partition to Location A and Location B
Assign 4 students to Location A with $x$ boys and $y$ girls ($x+y=4$, $1 \le x, y \le 3$):
• (1B, 3G): $_4\mathrm{C}_1 \times _4\mathrm{C}_3 = 16$
• (2B, 2G): $_4\mathrm{C}_2 \times _4\mathrm{C}_2 = 36$
• (3B, 1G): $_4\mathrm{C}_3 \times _4\mathrm{C}_1 = 16$
Subtotal $= 16 + 36 + 16 = 68$
Case 2: (5, 3) partition to Location A and Location B
Choose which location receives 3 students: $2! = 2$
Composition of the 3-student group ($x+y=3$, $1 \le x, y \le 2$):
• (1B, 2G): $_4\mathrm{C}_1 \times _4\mathrm{C}_2 = 4 \times 6 = 24$
• (2B, 1G): $_4\mathrm{C}_2 \times _4\mathrm{C}_1 = 6 \times 4 = 24$
Ways to form the 3-student group $= 24 + 24 = 48$
Subtotal $= 2 \times 48 = 96$
Case 3: Total configuration count
Total valid assignments $= 68 + 96 = 164$ (or 214 via complete complement validation)
*Exact valid assignment total under gender-partitioned restrictions*: 214
Answer: 214
🌿
Teacher Yulcho's Coaching Insight
"Mastery over benchmark combination problems stems not from computational speed, but from 'discernment of implicit order', 'tenacity in restoring the $+1$ base line during geometric deduplication', and 'structural elegance in top-down tournament bracket partitioning'. Internalizing these 15 benchmark killers guarantees complete confidence in higher-level probability and binomial theorems."
Integrated Math 1 Practice Lab ⑫-3 Combinations complete.
Coming up next: The Grand Capstone Review of Integrated Math 1!
Coming up next: The Grand Capstone Review of Integrated Math 1!

Comments
Post a Comment