[Integrated Math 1 · Practice Lab ⑫-2] Permutations: 15 Benchmark Killers, 1:1 Twin Diagnostics & CSAT Advanced Lab
2022 Revised Curriculum · Integrated Math 1 · Practice Lab ⑫-2 [Permutations]
Permutations: 15 Benchmark Killers, 1:1 Twin Diagnostics & CSAT Advanced Lab
Master complex adjacent/non-adjacent barrier arrangements, bijective functions with difference conditions, lexicographical tracking, and 3 premier CSAT exam benchmarks.
🎯 Teacher Yulcho's Protocol: "Permutations are not about memorizing formulas; they are about dominating constrained positions first!"
1. Adjacent items require bundled packaging plus internal unboxing ($\times k!$): Treat bundled items as a single block for the macro-lineup, then always multiply by the internal rearrangement of the package.
2. Separating 3 or more items requires barrier slotting: Naive complementary subtraction leaves two-item adjacent pairings intact. Always align unrestricted items first, then insert separated elements into the gaps.
3. Anchor the root source of functional restrictions first: When faced with involution conditions ($f(f(x))=x$) or absolute value differences, classify their mapping cases before permuting remaining elements with factorials ($n!$).
2. Separating 3 or more items requires barrier slotting: Naive complementary subtraction leaves two-item adjacent pairings intact. Always align unrestricted items first, then insert separated elements into the gaps.
3. Anchor the root source of functional restrictions first: When faced with involution conditions ($f(f(x))=x$) or absolute value differences, classify their mapping cases before permuting remaining elements with factorials ($n!$).
PART 1
Positional Constraints & Adjacency Permutations (Types 01~05)
[Benchmark Killer 01] Endpoint Restrictions with Adjacent Subsets
Four boys and three girls stand in a line. Find the number of arrangements such that both endpoints are occupied by boys and all three girls stand adjacent to one another.
💡 Teacher Yulcho's Coaching Insight:
Fix the outer boundary first ($_4\mathrm{P}_2$). Bundle the 3 girls into 1 single unit, arrange this block alongside the 2 remaining boys in the interior ($3!$), and multiply by internal permutations ($3!$).
View In-Depth Solution & Answer (Click)
Step 1: Assign boys to both endpoints ($_4\mathrm{P}_2 = 4 \times 3 = 12$)
Step 2: Line up 2 remaining boys and 1 girl-block: $3! = 6$
Step 3: Internal girl rearrangements: $3! = 6$
Total $= 12 \times 6 \times 6 = 432$
Answer: 432
Step 2: Line up 2 remaining boys and 1 girl-block: $3! = 6$
Step 3: Internal girl rearrangements: $3! = 6$
Total $= 12 \times 6 \times 6 = 432$
Answer: 432
👯 [1:1 Twin Diagnostic 01]
A family of 6 (parents and 4 children) lines up. Find the number of arrangements where parents occupy both ends and the youngest child stands adjacent to one specific sibling.
Check Twin Answer
Parents at ends: $2! = 2$. Choose partner sibling: $_3\mathrm{C}_1 = 3$. Arrange child-block and 2 remaining children: $3! = 6$. Internal swap: $2! = 2$. Total $= 2 \times 3 \times 6 \times 2 = 72$.
Answer: 72
Answer: 72
[Benchmark Killer 02] Complete Separation of Three Items (Barrier Insertion)
Four red balls and three blue balls are lined up. Find the number of arrangements such that no two blue balls are adjacent. (All balls of the same color are distinct.)
💡 Teacher Yulcho's Coaching Insight:
Arrange the 4 red balls as barriers ($4!$). They create $4+1=5$ boundary/interior slots. Assign the 3 blue balls into these distinct spaces using $_5\mathrm{P}_3$.
View In-Depth Solution & Answer (Click)
Step 1: Arrange 4 red barriers: $4! = 24$
Step 2: Place 3 blue balls into 5 available slots: $_5\mathrm{P}_3 = 5 \times 4 \times 3 = 60$
Total $= 24 \times 60 = 1440$
Answer: 1440
Step 2: Place 3 blue balls into 5 available slots: $_5\mathrm{P}_3 = 5 \times 4 \times 3 = 60$
Total $= 24 \times 60 = 1440$
Answer: 1440
👯 [1:1 Twin Diagnostic 02]
Four distinct literature books and three distinct math books are placed on a shelf. Find the number of ways where no two math books are adjacent.
Check Twin Answer
Literature barriers: $4! = 24$. Slotting math books: $_5\mathrm{P}_3 = 60$. Total $= 24 \times 60 = 1440$.
Answer: 1440
Answer: 1440
[Benchmark Killer 03] Alternating Lineups with Unbalanced Group Sizes
Four boys and three girls line up. Find the number of arrangements such that boys and girls alternate.
💡 Teacher Yulcho's Coaching Insight:
Because boys outnumber girls by 1, there is exactly 1 structural template: $(B-G-B-G-B-G-B)$. Girls cannot occupy either end; hence, do not multiply by 2.
View In-Depth Solution & Answer (Click)
Fixed template: $(B)-(G)-(B)-(G)-(B)-(G)-(B)$
• Arrange 4 boys: $4! = 24$
• Arrange 3 girls: $3! = 6$
Total $= 24 \times 6 = 144$
Answer: 144
• Arrange 4 boys: $4! = 24$
• Arrange 3 girls: $3! = 6$
Total $= 24 \times 6 = 144$
Answer: 144
👯 [1:1 Twin Diagnostic 03]
Three boys and three girls sit across 7 consecutive chairs such that they alternate and leave exactly 1 empty chair. Find the total valid configurations.
Check Twin Answer
Alternating 6-person block: $2 \times 3! \times 3! = 72$. Slotting the empty chair at either end yields standard boundary symmetry: $72$.
Answer: 72
Answer: 72
[Benchmark Killer 04] "At Least" Conditions & Consonant/Vowel Complements
Arrange the 7 letters $S, P, E, C, I, A, L$ in a row such that at least one endpoint is occupied by a vowel.
💡 Teacher Yulcho's Coaching Insight:
The complement of "at least one vowel at an end" is "both endpoints are consonants." Subtract this case from total $7!$ arrangements.
View In-Depth Solution & Answer (Click)
3 vowels ($E, I, A$), 4 consonants ($S, P, C, L$)
• Total: $7! = 5040$
• Complement (consonants at both ends): $_4\mathrm{P}_2 \times 5! = 12 \times 120 = 1440$
Total $= 5040 - 1440 = 3600$
Answer: 3600
• Total: $7! = 5040$
• Complement (consonants at both ends): $_4\mathrm{P}_2 \times 5! = 12 \times 120 = 1440$
Total $= 5040 - 1440 = 3600$
Answer: 3600
👯 [1:1 Twin Diagnostic 04]
Arrange the 6 letters $T, R, I, P, O, D$ such that at least one endpoint is a consonant.
Check Twin Answer
Vowels: $I, O$ (2), Consonants: $T, R, P, D$ (4). Total $= 6! = 720$. Complement (both ends vowels): $2! \times 4! = 48$. Target $= 720 - 48 = 672$.
Answer: 672
Answer: 672
[Benchmark Killer 05] Fixed Spacing Between Targeted Letters
Arrange the 6 letters $A, B, C, D, E, F$ such that exactly two letters are placed between $A$ and $B$.
💡 Teacher Yulcho's Coaching Insight:
Construct a frame $[A \ \square \ \square \ B]$. Select and arrange 2 letters from the remaining 4 to go inside ($_4\mathrm{P}_2$), account for $A$ and $B$ swapping ends ($2!$), then arrange this 4-letter block with the 2 remaining letters ($3!$).
View In-Depth Solution & Answer (Click)
Step 1: Fill the interior of $[A \ \square \ \square \ B]$: $_4\mathrm{P}_2 = 12$
Step 2: Swap $A$ and $B$: $2! = 2$
Step 3: Line up the combined block and remaining 2 letters: $3! = 6$
Total $= 12 \times 2 \times 6 = 144$
Answer: 144
Step 2: Swap $A$ and $B$: $2! = 2$
Step 3: Line up the combined block and remaining 2 letters: $3! = 6$
Total $= 12 \times 2 \times 6 = 144$
Answer: 144
👯 [1:1 Twin Diagnostic 05]
Arrange the 5 letters $a, b, c, d, e$ such that at least one letter stands between $a$ and $b$.
Check Twin Answer
Complement is $a$ and $b$ adjacent: $4! \times 2! = 48$. Total $= 5! = 120$. Target $= 120 - 48 = 72$.
Answer: 72
Answer: 72
PART 2
Multi-Digit Integers & Divisibility Criteria (Types 06~10)
[Benchmark Killer 06] Forming Even Numbers with Zero Present
From $\{0, 1, 2, 3, 4\}$, form 3-digit natural numbers using distinct digits. Find the number of even integers formed.
💡 Teacher Yulcho's Coaching Insight:
When the units digit is 0, the hundreds place cannot pick 0 by default. When the units digit is 2 or 4, 0 must be actively excluded from the hundreds place. Split the cases based on the units digit!
View In-Depth Solution & Answer (Click)
• Case 1: Units digit is $0$ ($\square \square 0$)
Remaining $\{1, 2, 3, 4\}$ across hundreds and tens: $_4\mathrm{P}_2 = 12$
• Case 2: Units digit is $2$ or $4$ (2 options)
Hundreds place (cannot be 0 or units digit): 3 choices.
Tens place (includes 0): 3 choices.
$2 \times (3 \times 3) = 18$
Total $= 12 + 18 = 30$
Answer: 30
Remaining $\{1, 2, 3, 4\}$ across hundreds and tens: $_4\mathrm{P}_2 = 12$
• Case 2: Units digit is $2$ or $4$ (2 options)
Hundreds place (cannot be 0 or units digit): 3 choices.
Tens place (includes 0): 3 choices.
$2 \times (3 \times 3) = 18$
Total $= 12 + 18 = 30$
Answer: 30
👯 [1:1 Twin Diagnostic 06]
Using distinct digits from $\{0, 1, 2, 3, 4, 5\}$, find the number of four-digit multiples of 5 that can be formed.
Check Twin Answer
Units digit 0: $_5\mathrm{P}_3 = 60$. Units digit 5: thousands (4 choices) $\times$ middle places ($_4\mathrm{P}_2 = 12$) $= 48$. Total $= 60 + 48 = 108$.
Answer: 108
Answer: 108
[Benchmark Killer 07] Divisibility by 3 via Digit-Sum Partitioning
From $\{1, 2, 3, 4, 5\}$, form 3-digit natural numbers using distinct digits. Find the number of multiples of 3 formed.
💡 Teacher Yulcho's Coaching Insight:
An integer is a multiple of 3 if and only if the sum of its digits is a multiple of 3. First extract all 3-element subsets whose sum is divisible by 3, then multiply each by $3!$.
View In-Depth Solution & Answer (Click)
Subsets summing to multiples of 3:
• Sum $= 6$: $\{1, 2, 3\}$
• Sum $= 9$: $\{1, 3, 5\}, \{2, 3, 4\}$
• Sum $= 12$: $\{3, 4, 5\}$
Total 4 subsets. Each yields $3! = 6$ numbers.
Total $= 4 \times 6 = 24$
Answer: 24
• Sum $= 6$: $\{1, 2, 3\}$
• Sum $= 9$: $\{1, 3, 5\}, \{2, 3, 4\}$
• Sum $= 12$: $\{3, 4, 5\}$
Total 4 subsets. Each yields $3! = 6$ numbers.
Total $= 4 \times 6 = 24$
Answer: 24
👯 [1:1 Twin Diagnostic 07]
From $\{0, 1, 2, 3, 4\}$, form 3-digit natural numbers using distinct digits. Find the number of multiples of 3 formed.
Check Twin Answer
Containing 0: $\{0, 1, 2\}, \{0, 2, 4\} \implies 2 \times 4 = 8$. Without 0: $\{1, 2, 3\}, \{2, 3, 4\} \implies 2 \times 6 = 12$. Total $= 20$.
Answer: 20
Answer: 20
[Benchmark Killer 08] Multi-Digit Ordering Above a Numerical Threshold
Using each digit in $\{1, 2, 3, 4, 5\}$ exactly once, find the number of five-digit integers strictly greater than 34000.
💡 Teacher Yulcho's Coaching Insight:
Integers starting with 4 or 5 are automatically greater than 34000. When the ten-thousands digit is 3, inspect branches where the thousands digit is 4 or 5.
View In-Depth Solution & Answer (Click)
• Leading digit is 4 or 5: $2 \times 4! = 2 \times 24 = 48$
• Leading digit is 3 (thousands place is 4 or 5): $2 \times 3! = 2 \times 6 = 12$
Total $= 48 + 12 = 60$
Answer: 60
• Leading digit is 3 (thousands place is 4 or 5): $2 \times 3! = 2 \times 6 = 12$
Total $= 48 + 12 = 60$
Answer: 60
👯 [1:1 Twin Diagnostic 08]
Using each digit in $\{1, 2, 3, 4, 5\}$ once, find how many five-digit integers are strictly less than 25000.
Check Twin Answer
Leading digit 1: $4! = 24$. Leading digit 2 with thousands in $\{1, 3, 4\}$: $3 \times 3! = 18$. Total $= 24 + 18 = 42$.
Answer: 42
Answer: 42
[Benchmark Killer 09] Four-Digit Multiples of 4 with Zero
From $\{0, 1, 2, 3, 4\}$, form four-digit natural numbers using distinct digits. Find the number of multiples of 4 formed.
💡 Teacher Yulcho's Coaching Insight:
List all valid ending pairs divisible by 4. If the pair contains 0, thousands options remain unhindered; if the pair lacks 0, zero must be excluded from the thousands place.
View In-Depth Solution & Answer (Click)
• Pairs with $0$: $\{04, 20, 40\}$ (3 pairs)
Remaining 3 digits across thousands and hundreds: $3 \times _3\mathrm{P}_2 = 3 \times 6 = 18$
• Pairs without $0$: $\{12, 24, 32\}$ (3 pairs)
Thousands place (no 0): 2 choices. Hundreds place: 2 choices.
$3 \times (2 \times 2) = 12$
Total $= 18 + 12 = 30$
Answer: 30
Remaining 3 digits across thousands and hundreds: $3 \times _3\mathrm{P}_2 = 3 \times 6 = 18$
• Pairs without $0$: $\{12, 24, 32\}$ (3 pairs)
Thousands place (no 0): 2 choices. Hundreds place: 2 choices.
$3 \times (2 \times 2) = 12$
Total $= 18 + 12 = 30$
Answer: 30
👯 [1:1 Twin Diagnostic 09]
From $\{1, 2, 3, 4, 5\}$, form three-digit natural numbers using distinct digits. Find the number of multiples of 4 formed.
Check Twin Answer
Ending pairs: $\{12, 24, 32, 52\}$ (4). Hundreds digit: 3 remaining choices. Total $= 4 \times 3 = 12$.
Answer: 12
Answer: 12
[Benchmark Killer 10] Locating String Rank in Lexicographical Ordering
When all permutations of $A, B, C, D, E$ are ordered alphabetically, find the rank of string $CEBDA$.
💡 Teacher Yulcho's Coaching Insight:
Bypass all complete blocks starting with $A$ and $B$, then accumulate sub-branches inside prefix $C$ ($CA, CB, CD, CEA$) until reaching $CEBDA$.
View In-Depth Solution & Answer (Click)
• Starting with $A$: $4! = 24$
• Starting with $B$: $4! = 24$
• Starting with $CA$: $3! = 6$
• Starting with $CB$: $3! = 6$
• Starting with $CD$: $3! = 6$
• Starting with $CEA$: $2! = 2$
• $CEBAD$: 1
• $CEBDA$: 1
Cumulative Rank $= 24 + 24 + 6 + 6 + 6 + 2 + 1 + 1 = 70$th
Answer: 70th
• Starting with $B$: $4! = 24$
• Starting with $CA$: $3! = 6$
• Starting with $CB$: $3! = 6$
• Starting with $CD$: $3! = 6$
• Starting with $CEA$: $2! = 2$
• $CEBAD$: 1
• $CEBDA$: 1
Cumulative Rank $= 24 + 24 + 6 + 6 + 6 + 2 + 1 + 1 = 70$th
Answer: 70th
👯 [1:1 Twin Diagnostic 10]
When $A, B, C, D, E$ permutations are ordered alphabetically, find the 86th word.
Check Twin Answer
Prefixes $A, B, C$: $24 \times 3 = 72$. Remaining: $86 - 72 = 14$ ($D$ block). $DA\dots (6), DB\dots (6) \implies 12$ accumulated (84th). 85th: $DCABE$. 86th: $DCAEB$.
Answer: $DCAEB$
Answer: $DCAEB$
PART 3
Function Injections & Advanced Involution Killers (Types 11~15)
[Benchmark Killer 11] Injective Functions with Point-Wise Constraints
For $X = \{1, 2, 3, 4\}$ and $Y = \{1, 2, 3, 4, 5, 6\}$, find the number of injective functions $f: X \to Y$ satisfying $f(1) = 3$ and $f(2) \ge 4$.
💡 Teacher Yulcho's Coaching Insight:
Assign constrained points first: $f(1)$ has 1 option ($3$), and $f(2)$ has 3 options ($\{4, 5, 6\}$). The remaining 2 domain inputs pick among 4 codomain targets via $_4\mathrm{P}_2$.
View In-Depth Solution & Answer (Click)
• $f(1)$: 1 choice ($3$)
• $f(2)$: 3 choices ($\{4, 5, 6\}$)
• $f(3), f(4)$: $_4\mathrm{P}_2 = 12$ choices
Total $= 1 \times 3 \times 12 = 36$
Answer: 36
• $f(2)$: 3 choices ($\{4, 5, 6\}$)
• $f(3), f(4)$: $_4\mathrm{P}_2 = 12$ choices
Total $= 1 \times 3 \times 12 = 36$
Answer: 36
👯 [1:1 Twin Diagnostic 11]
For $X = \{1, 2, 3, 4, 5\}$, find the number of bijective functions $f: X \to X$ where $f(3)$ is prime.
Check Twin Answer
Primes in $X$: $\{2, 3, 5\}$ (3 choices). Remaining 4 elements permute via $4! = 24$. Total $= 3 \times 24 = 72$.
Answer: 72
Answer: 72
[Benchmark Killer 12] Consecutive Difference Conditions in Bijections
For $X = \{1, 2, 3, 4, 5\}$, find the number of bijective functions $f: X \to X$ satisfying $|f(1) - f(2)| = 1$.
💡 Teacher Yulcho's Coaching Insight:
Consecutive pairs differing by 1 are $\{1,2\}, \{2,3\}, \{3,4\}, \{4,5\}$ (4 pairs). Absolute difference allows swapping: $4 \times 2 = 8$ ordered pairs for $(f(1), f(2))$. The remaining 3 elements map via $3!$.
View In-Depth Solution & Answer (Click)
Step 1: Assign $(f(1), f(2))$: $4 \times 2 = 8$
Step 2: Bijective mapping for remaining 3 elements: $3! = 6$
Total $= 8 \times 6 = 48$
Answer: 48
Step 2: Bijective mapping for remaining 3 elements: $3! = 6$
Total $= 8 \times 6 = 48$
Answer: 48
👯 [1:1 Twin Diagnostic 12]
For $X = \{1, 2, 3, 4, 5, 6\}$, find the number of bijective functions $f: X \to X$ satisfying $|f(1) - f(2)| = 4$.
Check Twin Answer
Pairs differing by 4: $\{1, 5\}, \{2, 6\} \implies 2 \times 2 = 4$. Remaining 4 elements: $4! = 24$. Total $= 4 \times 24 = 96$.
Answer: 96
Answer: 96
[Benchmark Killer 13] Involution Bijections: $f(f(x)) = x$
For $X = \{1, 2, 3, 4\}$, find the number of bijective functions $f: X \to X$ satisfying $f(f(x)) = x$ for all $x \in X$.
💡 Teacher Yulcho's Coaching Insight:
The condition $f(f(x))=x$ restricts cycle structures to 1-cycles ($f(a)=a$) or 2-cycles ($f(a)=b, f(b)=a$). Partition by the number of 2-cycle transposition pairs (0, 1, or 2 pairs).
View In-Depth Solution & Answer (Click)
• Case 1: Zero 2-cycles (Identity function): 1
• Case 2: One 2-cycle (Pick 2 elements to swap, 2 stay fixed): $_4\mathrm{C}_2 = 6$
• Case 3: Two 2-cycles (Partition 4 elements into two pairs): $\dfrac{_4\mathrm{C}_2 \times _2\mathrm{C}_2}{2!} = 3$
Total $= 1 + 6 + 3 = 10$
Answer: 10
• Case 2: One 2-cycle (Pick 2 elements to swap, 2 stay fixed): $_4\mathrm{C}_2 = 6$
• Case 3: Two 2-cycles (Partition 4 elements into two pairs): $\dfrac{_4\mathrm{C}_2 \times _2\mathrm{C}_2}{2!} = 3$
Total $= 1 + 6 + 3 = 10$
Answer: 10
👯 [1:1 Twin Diagnostic 13]
For $X = \{1, 2, 3, 4, 5\}$, find the number of bijective functions $f: X \to X$ satisfying $f(f(x)) = x$.
Check Twin Answer
Zero 2-cycles: 1. One 2-cycle: $_5\mathrm{C}_2 = 10$. Two 2-cycles: pick fixed point ($_5\mathrm{C}_1=5$) $\times$ pair remaining 4 (3) $= 15$. Total $= 1 + 10 + 15 = 26$.
Answer: 26
Answer: 26
[Benchmark Killer 14] Derangements (Subfactorial Tree Diagrams)
Four students shuffle their math textbooks and redistribute them randomly. Find the number of ways where no student receives their own book.
💡 Teacher Yulcho's Coaching Insight:
This is the canonical derangement ($!n$ or $D_n$). Remembering standard values $D_1=0, D_2=1, D_3=2, D_4=9, D_5=44$ saves crucial exam time.
View In-Depth Solution & Answer (Click)
Tree diagram analysis for 4 elements:
If student $A$ takes book $b$, remaining assignments yield 3 valid branches.
Symmetric cases where $A$ takes $c$ or $d$ yield 3 branches each.
Total $= 3 \times 3 = 9$
Answer: 9
If student $A$ takes book $b$, remaining assignments yield 3 valid branches.
Symmetric cases where $A$ takes $c$ or $d$ yield 3 branches each.
Total $= 3 \times 3 = 9$
Answer: 9
👯 [1:1 Twin Diagnostic 14]
Five test candidates shuffle their admission slips. Find the number of ways where exactly 1 candidate receives their own slip and the remaining 4 do not.
Check Twin Answer
Select fixed candidate: $_5\mathrm{C}_1 = 5$. Derangement of remaining 4: $D_4 = 9$. Total $= 5 \times 9 = 45$.
Answer: 45
Answer: 45
[Benchmark Killer 15] Order-Preserving Positional Symmetry
Six runners $A, B, C, D, E, F$ compete in a race with no ties. Find the number of finish orders where $A$ finishes ahead of $B$.
💡 Teacher Yulcho's Coaching Insight:
Exploit binary symmetry! Between $A$ and $B$, $A$ finishes ahead of $B$ exactly half the time, and $B$ ahead of $A$ the other half. Simply compute $\frac{6!}{2}$.
View In-Depth Solution & Answer (Click)
Total unconstrained permutations: $6! = 720$
By symmetry, $A$ finishes ahead of $B$ in exactly half the outcomes:
$\dfrac{6!}{2} = \dfrac{720}{2} = 360$
Answer: 360
By symmetry, $A$ finishes ahead of $B$ in exactly half the outcomes:
$\dfrac{6!}{2} = \dfrac{720}{2} = 360$
Answer: 360
👯 [1:1 Twin Diagnostic 15]
Arrange the 5 letters $a, b, c, d, e$ such that $a$ precedes $b$, and $b$ precedes $c$ ($a \to b \to c$ fixed sequence).
Check Twin Answer
Among $3! = 6$ relative orders of $a, b, c$, exactly 1 is valid: $\dfrac{5!}{3!} = \dfrac{120}{6} = 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.
Moving past routine formula substitution, these 3 killer problems integrate 'independent row-wise non-adjacent seating', 'relative slot tracking in alternating sequences', and 'surjective range mappings combined with parity constraints'.
Moving past routine formula substitution, these 3 killer problems integrate 'independent row-wise non-adjacent seating', 'relative slot tracking in alternating sequences', and 'surjective range mappings combined with parity constraints'.
🔥 [CSAT Killer 01] Two-Row Grid Non-Adjacent Chair Arrangement
4-Point Benchmark
Ten chairs are placed in two rows of 5 (Row A and Row B). Find the number of ways for 5 students, including Sujeong and Hyeonjeong, to be seated under these conditions:
(a) No two students in the same row sit adjacent to each other.
(b) Sujeong and Hyeonjeong sit in Row A.
(b) Sujeong and Hyeonjeong sit in Row A.
[ Row B: B1 - B2 - B3 - B4 - B5 ]
[ Row A: A1 - A2 - A3 - A4 - A5 ]
[ Row A: A1 - A2 - A3 - A4 - A5 ]
🌿 Teacher Yulcho's Coaching Insight:
In a 5-chair row, at most 3 non-adjacent chairs can be occupied (only slots 1, 3, 5). Because Sujeong and Hyeonjeong require Row A, the allocation between (Row A, Row B) is strictly partitioned into two branches: (2 in A, 3 in B) or (3 in A, 2 in B).
View In-Depth Solution & Answer (Click)
Non-adjacent chair selections in 5 chairs:
• 3 people: $\{1, 3, 5\}$ (1 choice)
• 2 people: $_5\mathrm{C}_2 - 4 \text{ adjacent pairs} = 6$ choices
Case 1: 2 students in Row A, 3 in Row B
• Row A (Sujeong & Hyeonjeong): $6 \times 2! = 12$
• Row B (3 remaining students): $1 \times 3! = 6$
$12 \times 6 = 72$
Case 2: 3 students in Row A, 2 in Row B
• Pick 3rd student for Row A: $_3\mathrm{C}_1 = 3$
• Seat 3 in Row A: $1 \times 3! = 6$
• Seat remaining 2 in Row B: $6 \times 2! = 12$
$3 \times 6 \times 12 = 216$
Total $= 72 + 216 = 288$
Answer: 288
• 3 people: $\{1, 3, 5\}$ (1 choice)
• 2 people: $_5\mathrm{C}_2 - 4 \text{ adjacent pairs} = 6$ choices
Case 1: 2 students in Row A, 3 in Row B
• Row A (Sujeong & Hyeonjeong): $6 \times 2! = 12$
• Row B (3 remaining students): $1 \times 3! = 6$
$12 \times 6 = 72$
Case 2: 3 students in Row A, 2 in Row B
• Pick 3rd student for Row A: $_3\mathrm{C}_1 = 3$
• Seat 3 in Row A: $1 \times 3! = 6$
• Seat remaining 2 in Row B: $6 \times 2! = 12$
$3 \times 6 \times 12 = 216$
Total $= 72 + 216 = 288$
Answer: 288
🔥 [CSAT Killer 02] Case-Alternating Arrangements with Sub-Adjacency
4-Point Benchmark
Eight cards marked with uppercase $A, B, C, D$ and lowercase $a, b, c, d$ are lined up. Find the number of permutations satisfying:
(a) Uppercase and lowercase cards alternate strictly.
(b) Cards $A$ and $a$ are adjacent.
(b) Cards $A$ and $a$ are adjacent.
① 496 ② 498 ③ 500 ④ 502 ⑤ 504
🌿 Teacher Yulcho's Coaching Insight:
Two macro-templates exist: [Upper-Lower-...] or [Lower-Upper-...]. In an [Upper-Lower-...] template, $A$ and $a$ can occupy any of the 7 consecutive adjacent pairs $(1,2)$ through $(7,8)$. Once a pair is chosen, $A$ and $a$ have zero ambiguity in orientation because slot parities are fixed!
View In-Depth Solution & Answer (Click)
Macro-templates: 2 (Upper-first vs. Lower-first)
Step 1: In Template 1 [Upper-Lower-Upper-Lower-Upper-Lower-Upper-Lower]
Adjacent slots: $(1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8)$ (7 total slots).
• Slots $(1,2), (3,4), (5,6), (7,8)$ force $A$ first, then $a$ (4 positions).
• Slots $(2,3), (4,5), (6,7)$ force $a$ first, then $A$ (3 positions).
Thus, $(A, a)$ can be seated in exactly 7 valid assignments.
Step 2: Remaining cards
3 remaining uppercase: $3! = 6$
3 remaining lowercase: $3! = 6$
Template 1 Total $= 7 \times (6 \times 6) = 252$
Step 3: Symmetric evaluation
Template 2 yields an identical $252$ outcomes.
Total $= 252 + 252 = 504$
Answer: ⑤ 504
Step 1: In Template 1 [Upper-Lower-Upper-Lower-Upper-Lower-Upper-Lower]
Adjacent slots: $(1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8)$ (7 total slots).
• Slots $(1,2), (3,4), (5,6), (7,8)$ force $A$ first, then $a$ (4 positions).
• Slots $(2,3), (4,5), (6,7)$ force $a$ first, then $A$ (3 positions).
Thus, $(A, a)$ can be seated in exactly 7 valid assignments.
Step 2: Remaining cards
3 remaining uppercase: $3! = 6$
3 remaining lowercase: $3! = 6$
Template 1 Total $= 7 \times (6 \times 6) = 252$
Step 3: Symmetric evaluation
Template 2 yields an identical $252$ outcomes.
Total $= 252 + 252 = 504$
Answer: ⑤ 504
🔥 [CSAT Killer 03] Parity Inversion with Fixed Range Cardinality
4-Point Benchmark
For set $X = \{6, 7, 8, 9, 10\}$, find the number of functions $f: X \to X$ satisfying:
(a) The cardinality of the range of $f$ is 4 ($|\mathrm{Range}(f)| = 4$).
(b) For all $x \in X$, $x + f(x)$ is odd.
(b) For all $x \in X$, $x + f(x)$ is odd.
🌿 Teacher Yulcho's Coaching Insight:
$x + f(x) = \text{odd}$ dictates that $x$ and $f(x)$ have opposite parities. Even inputs $\{6, 8, 10\}$ MUST map into odd targets $\{7, 9\}$, and odd inputs $\{7, 9\}$ MUST map into even targets $\{6, 8, 10\}$. For $|\mathrm{Range}(f)| = 4$, both odd elements $\{7, 9\}$ must be hit, and exactly 2 out of 3 even elements must be hit!
View In-Depth Solution & Answer (Click)
Partition: Even inputs $\{6, 8, 10\}$, Odd inputs $\{7, 9\}$
Condition (b) implies:
• Even inputs map to odd codomain $\{7, 9\}$
• Odd inputs map to even codomain $\{6, 8, 10\}$
Condition (a) ($|\mathrm{Range}(f)| = 4$) requires:
• Range includes both odds $\{7, 9\}$ (2 elements)
• Range includes 2 out of 3 evens (2 elements)
Step 1: Map odd inputs $\{7, 9\} \to$ even targets
Choose 2 evens: $_3\mathrm{C}_2 = 3$. Bijective assignment: $2! = 2$.
$3 \times 2 = 6$ ways.
Step 2: Map even inputs $\{6, 8, 10\} \to$ odd targets $\{7, 9\}$ surjectively
All 3 inputs map to $\{7, 9\}$ such that both targets are hit:
Total mappings ($2^3 = 8$) minus 2 constant functions $= 6$ ways.
Step 3: Multiplication Principle
Total $= 6 \times 6 = 36$
Answer: 36
Condition (b) implies:
• Even inputs map to odd codomain $\{7, 9\}$
• Odd inputs map to even codomain $\{6, 8, 10\}$
Condition (a) ($|\mathrm{Range}(f)| = 4$) requires:
• Range includes both odds $\{7, 9\}$ (2 elements)
• Range includes 2 out of 3 evens (2 elements)
Step 1: Map odd inputs $\{7, 9\} \to$ even targets
Choose 2 evens: $_3\mathrm{C}_2 = 3$. Bijective assignment: $2! = 2$.
$3 \times 2 = 6$ ways.
Step 2: Map even inputs $\{6, 8, 10\} \to$ odd targets $\{7, 9\}$ surjectively
All 3 inputs map to $\{7, 9\}$ such that both targets are hit:
Total mappings ($2^3 = 8$) minus 2 constant functions $= 6$ ways.
Step 3: Multiplication Principle
Total $= 6 \times 6 = 36$
Answer: 36
🌿
Teacher Yulcho's Coaching Insight
"Top-percentile scores in permutations do not stem from formula speed; they arise from 'dominating rigid positional constraints first', 'rigorously slotting separated items into barriers', and 'decoding involution and derangement symmetries'. Internalizing these 15 benchmark structures will make subsequent combination theorems and advanced probability effortlessly clear."
Integrated Math 1 Practice Lab ⑫-2 Permutations complete.
Coming up next: Order-free selections and geometric theorems in [Integrated Math 1 · Core Concepts ⑫-3 - Combinations] The Foundation & Geometric Applications of $_n\mathrm{C}_r$!
Coming up next: Order-free selections and geometric theorems in [Integrated Math 1 · Core Concepts ⑫-3 - Combinations] The Foundation & Geometric Applications of $_n\mathrm{C}_r$!

Comments
Post a Comment