[Probability · Practice Lab ① - Counting Principles] 15 Ultra-Challenging Middle School Killers & 1:1 Diagnostic Twins (Sum vs Product Rule, Currency Denominations, Grid Walkways & 4-Item Tree Diagrams)

 

Probability · Practice Lab ① [Counting Principles Masterclass]

15 Ultra-Challenging Counting Killers & 1:1 Diagnostic Twins

Sum vs Product Rules, Currency Denominations vs Values, Grid Pathways & 4-Item Tree Diagrams

🎯 3 Action Protocols for Core Counting Principles
  • Distinguish Terminal Branches from Sequential Couplings: Add possibilities ($m + n$) when events are mutually exclusive and decision branches terminate; multiply ($m \times n$) when an event continues sequentially to complete the composite trial.
  • Inspect Currency Redundancy to Determine Denomination Breakdown: If smaller coin multiples can construct higher denomination notes, break down the higher bills into smaller denominations before applying combinations.
  • Deploy Tree Diagram Symmetry on Invariant Constrained Permutations: When formal formulas fail (such as derangements where nobody receives their own item), count the branches stemming from the first choice and scale by symmetry.

PART 1. Sum & Product Rule Fundamentals (01~05)

[Challenge Problem 01] Excluding Common Multiples in the Rule of Sum
A card is drawn from a deck of $100$ cards numbered $1$ through $100$. Find the number of outcomes where the card is a **multiple of $4$ or a multiple of $6$**.
💡 Yul's Pro-Tip: Subtract the least common multiple ($12$) to eliminate double counting!
• Multiples of $4$: $\lfloor 100 / 4 \rfloor = \mathbf{25}$
• Multiples of $6$: $\lfloor 100 / 6 \rfloor = \mathbf{16}$
• Common multiples ($12$): $\lfloor 100 / 12 \rfloor = \mathbf{8}$
Rule of Sum: $25 + 16 - 8 = \mathbf{33}$.
View Solution & Answer (Click to Expand)
1. Multiples of 4: 25. Multiples of 6: 16.
2. Common multiples of LCM(4, 6) = 12: 8.
3. Net outcomes: $25 + 16 - 8 = 33$.
Answer: 33
👯 [1:1 Diagnostic Twin 01]

From cards numbered $1$ through $50$, find the number of ways to pick a multiple of $3$ or a multiple of $5$.

Check Twin Answer
Multiples of 3: 16. Multiples of 5: 10. Multiples of 15: 3.
$16 + 10 - 3 = 23$.
Answer: 23
[Challenge Problem 02] Sequential Meal Combinations via Rule of Product
A restaurant offers $4$ main entrees, $3$ drinks, and $2$ desserts. Find the total number of distinct set meal combinations selecting one of each category.
💡 Yul's Pro-Tip: The event is complete only when all three choices are coupled sequentially: $4 \times 3 \times 2 = \mathbf{24}$.
View Solution & Answer (Click to Expand)
Entrees(4) $\times$ Drinks(3) $\times$ Desserts(2) $= 24$.
Answer: 24
👯 [1:1 Diagnostic Twin 02]

Choosing $1$ top from 5 options, $1$ bottom from 4 options, and $1$ cap from 2 options produces how many outfits?

Check Twin Answer
$5 \times 4 \times 2 = 40$.
Answer: 40
[Challenge Problem 03] Absolute Dice Difference Thresholds
Two distinct fair six-sided dice are rolled simultaneously. Find the number of outcomes where the absolute difference of the two numbers is **at least $4$**.
💡 Yul's Pro-Tip: Partition into difference $4$ and difference $5$:
• Difference $4$: $(1,5), (2,6), (5,1), (6,2) \implies \mathbf{4}$
• Difference $5$: $(1,6), (6,1) \implies \mathbf{2}$
Sum: $4 + 2 = \mathbf{6}$.
View Solution & Answer (Click to Expand)
$|a - b| = 4 \implies 4$ pairs.
$|a - b| = 5 \implies 2$ pairs.
$4 + 2 = 6$.
Answer: 6
👯 [1:1 Diagnostic Twin 03]

When rolling two dice, find the number of outcomes where the difference is at most $3$.

Check Twin Answer
Subtract the complementary event: $36 - 6 = 30$.
Answer: 30
[Challenge Problem 04] Distinct Terms in Polynomial Expansions
Find the number of distinct terms generated when expanding the algebraic expression $(a + b + c)(x + y + z + w)$.
💡 Yul's Pro-Tip: Since the sets of variables are disjoint, no terms can be combined:
$3 \times 4 = \mathbf{12}$.
View Solution & Answer (Click to Expand)
First group (3) $\times$ Second group (4) $= 12$.
Answer: 12
👯 [1:1 Diagnostic Twin 04]

Find the number of terms in the expansion of $(a + b)(x + y)(p + q + r)$.

Check Twin Answer
$2 \times 2 \times 3 = 12$.
Answer: 12
[Challenge Problem 05] Prime Factorization & Divisor Parity Counting
For the integer $360$, find: (1) the number of odd positive divisors, and (2) the number of positive divisors that are multiples of $3$.
💡 Yul's Pro-Tip: Factor: $360 = 2^3 \times 3^2 \times 5^1$.
• Odd divisors omit factor $2$: $(2 + 1)(1 + 1) = \mathbf{6}$.
• Multiples of $3$ factor out $3$: $3 \times (2^3 \times 3^1 \times 5^1) \implies (3 + 1)(1 + 1)(1 + 1) = \mathbf{16}$.
View Solution & Answer (Click to Expand)
1. Odd divisors: $3 \times 2 = 6$.
2. Multiples of 3: $4 \times 2 \times 2 = 16$.
Answer: Odd: 6, Multiples of 3: 16
👯 [1:1 Diagnostic Twin 05]

For $180 = 2^2 \times 3^2 \times 5^1$, find the number of even positive divisors.

Check Twin Answer
Total divisors: $3 \times 3 \times 2 = 18$. Odd divisors: $3 \times 2 = 6$.
Even divisors $= 18 - 6 = 12$.
Answer: 12

PART 2. Payment Methods vs Payment Amounts (06~10)

[Challenge Problem 06] Payment Methods & Amounts Without Overlap
You have two $1000$-won bills, one $500$-won coin, and three $100$-won coins. Find the number of payment methods $a$ and distinct payable amounts $b$ (excluding paying $0$ won).
💡 Yul's Pro-Tip: Three $100$-won coins cannot make $500$, and one $500$ cannot make $1000$. There is zero amount overlap!
$a = b = (2 + 1)(1 + 1)(3 + 1) - 1 = 3 \times 2 \times 4 - 1 = \mathbf{23}$.
View Solution & Answer (Click to Expand)
No redundant values exist between denominations.
$a = b = 3 \times 2 \times 4 - 1 = 23$.
Answer: $a = 23, b = 23$
👯 [1:1 Diagnostic Twin 06]

With two $500$-won coins and two $100$-won coins, find the number of payment methods and payable amounts.

Check Twin Answer
$(2 + 1)(2 + 1) - 1 = 8$.
Answer: Methods: 8, Amounts: 8
[Challenge Problem 07] Denomination Breakdown for Value Overlaps
With two $100$-won coins, three $50$-won coins, and two $10$-won coins, find the number of **distinct payable amounts** (excluding paying $0$ won).
💡 Yul's Pro-Tip: Three $50$-won coins exceed $100$, creating overlap!
Break the two $100$-won coins into four $50$-won coins. The wallet now holds seven $50$-won coins and two $10$-won coins:
$(7 + 1)(2 + 1) - 1 = 8 \times 3 - 1 = \mathbf{23}$.
View Solution & Answer (Click to Expand)
1. Replace $100$-won coins with four $50$-won coins $\implies$ seven $50$-won, two $10$-won.
2. Distinct amounts: $(7 + 1)(2 + 1) - 1 = 23$.
Answer: 23
👯 [1:1 Diagnostic Twin 07]

Find payable amounts with one $1000$-won bill, two $500$-won coins, and four $100$-won coins.

Check Twin Answer
Break $1000$ won into two $500$s $\implies$ four $500$s and four $100$s.
$(4 + 1)(4 + 1) - 1 = 24$.
Answer: 24
[Challenge Problem 08] Diophantine Systems for Exact Sums
Find the number of ways to pay exactly $250$ won using $10$-won, $50$-won, and $100$-won coins, using **at least one of each coin**.
💡 Yul's Pro-Tip: Simplify equation: $x + 5y + 10z = 25$ for positive integers $x, y, z \ge 1$.
• $z = 1$: $x + 5y = 15 \implies y \in \{1, 2\} \implies \mathbf{2}$ solutions.
• $z \ge 2$: $x + 5y \le 5$, impossible for $x, y \ge 1$. Result is **$2$**.
View Solution & Answer (Click to Expand)
For $z=1$, $(x, y) = (10, 1)$ or $(5, 2)$.
Answer: 2
👯 [1:1 Diagnostic Twin 08]

Find the number of ways to pay 300 won with 10-won, 50-won, and 100-won coins, using at least one of each.

Check Twin Answer
$x + 5y + 10z = 30$.
$z=1 \implies y \in \{1,2,3\}$ (3). $z=2 \implies y=1$ (1).
$3 + 1 = 4$.
Answer: 4
[Challenge Problem 09] Two-Variable Stamp Purchases Without Change
Find the number of ways to purchase exactly $3400$ won worth of $300$-won and $500$-won stamps, buying **at least one of each kind**.
💡 Yul's Pro-Tip: Simplify: $3x + 5y = 34$. Since $5y$ ends in $0$ or $5$:
• $y = 2 \implies 3x = 24 \implies x = 8$
• $y = 5 \implies 3x = 9 \implies x = 3$
Only **$2$** valid pairs exist.
View Solution & Answer (Click to Expand)
Valid integer pairs: $(8, 2)$ and $(3, 5)$.
Answer: 2
👯 [1:1 Diagnostic Twin 09]

Buying 400-won notebooks and 700-won pens for exactly 3700 won (at least one of each) yields how many options?

Check Twin Answer
$4x + 7y = 37 \implies y = 3, x = 4$. Exactly 1 way.
Answer: 1
[Challenge Problem 10] Coin Flips Without Three Consecutive Heads
A coin is tossed $4$ times. Find the number of outcomes where **heads does not appear $3$ or more times consecutively**.
💡 Yul's Pro-Tip: Subtract consecutive cases from total $2^4 = 16$:
• Four heads: (H, H, H, H) $\implies 1$
• Three consecutive heads: (H, H, H, T), (T, H, H, H) $\implies 2$
$16 - (1 + 2) = \mathbf{13}$.
View Solution & Answer (Click to Expand)
Complement: 3 ways.
$16 - 3 = 13$.
Answer: 13
👯 [1:1 Diagnostic Twin 10]

Tossing a coin 4 times, find outcomes with at least one head.

Check Twin Answer
$16 - 1 = 15$.
Answer: 15

PART 3. Grid Routing & Tree Diagrams (11~15)

[Challenge Problem 11] Mandated Intermediate Waypoint Grid Routing
Find the number of shortest paths from $A$ to $B$ passing through intermediate waypoint $P$, where $A \to P$ spans $2\times 1$ blocks and $P \to B$ spans $2\times 2$ blocks.
💡 Yul's Pro-Tip: Rule of Product coupling: $(A \to P) \times (P \to B) = 3 \times 6 = \mathbf{18}$.
View Solution & Answer (Click to Expand)
$3 \times 6 = 18$.
Answer: 18
👯 [1:1 Diagnostic Twin 11]

If there are 4 paths from $A$ to $P$ and 3 paths from $P$ to $B$, find the paths from $A$ to $B$ through $P$.

Check Twin Answer
$4 \times 3 = 12$.
Answer: 12
[Challenge Problem 12] Bypassing a Blocked Intersection via Grid Addition
In a $3\times 2$ grid network, intersection $X$ is under construction. Find the number of shortest paths from $A$ to $B$ without passing through $X$, given total paths is $10$ and paths through $X$ is $3$.
A B X (Blocked) 3 Columns 2 Rows
💡 Yul's Pro-Tip: Complementary subtraction: $10 - 3 = \mathbf{7}$.
View Solution & Answer (Click to Expand)
Total paths: $10$. Paths via $X$: $3$. Remaining: $10 - 3 = 7$.
Answer: 7
👯 [1:1 Diagnostic Twin 12]

If a grid has 15 total paths and 4 pass through a blocked corner, find the paths avoiding that corner.

Check Twin Answer
$15 - 4 = 11$.
Answer: 11
[Challenge Problem 13] 4-Item Derangement Tree Diagram
Four students $A, B, C, D$ each pick a nametag at random. Find the number of outcomes where **none of the four students receives their own nametag**.
💡 Yul's Pro-Tip: The 4-item derangement constant is $3 \times 3 = \mathbf{9}$.
Student $A$ selects from $b, c, d$ ($3$ ways). Each choice branches symmetrically into $3$ valid derangements: $(b,a,d,c), (b,c,d,a), (b,d,a,c)$.
View Solution & Answer (Click to Expand)
$3 \times 3 = 9$.
Answer: 9
👯 [1:1 Diagnostic Twin 13]

Among 4 students, only student $A$ gets their own nametag while the remaining 3 get someone else's.

Check Twin Answer
Student $A$ is fixed (1). Remaining 3-item derangement has 2 branches.
$1 \times 2 = 2$.
Answer: 2
[Challenge Problem 14] Best-of-3 Series Tournament Tree Diagrams
Teams $A$ and $B$ play a best-of-3 playoff series (first to win $2$ games wins the series). Assuming no ties, find all distinct sequence outcomes where **Team $A$ wins the championship**.
💡 Yul's Pro-Tip: Terminate branches as soon as 2 wins are accumulated:
• Concluded in 2 games: $(A, A) \implies \mathbf{1}$
• Concluded in 3 games: $(A, B, A), (B, A, A) \implies \mathbf{2}$
Sum: $1 + 2 = \mathbf{3}$.
View Solution & Answer (Click to Expand)
Outcomes: $AA, ABA, BAA$. Total: $3$.
Answer: 3
👯 [1:1 Diagnostic Twin 14]

Find the total number of match outcomes possible in the entire best-of-3 tournament.

Check Twin Answer
Team $A$ wins: 3. Team $B$ wins: 3.
$3 + 3 = 6$.
Answer: 6
[Challenge Problem 15] Round-Trip Pathway Combinations Without Retracing
There are $3$ roads between Village $A$ and Village $B$, and $4$ roads between Village $B$ and Village $C$. For a round trip from $A \to B \to C \to B \to A$, find the number of routes **without using any road more than once**.
Town A Town B Town C 3 Roads 4 Roads Outbound: 3 × 4 = 12 Return: 3 × 2 = 6 (Distinct)
💡 Yul's Pro-Tip: Deduct $1$ road on each return leg:
• Outbound ($A \to B \to C$): $3 \times 4 = \mathbf{12}$
• Return ($C \to B \to A$): $(4 - 1) \times (3 - 1) = 3 \times 2 = \mathbf{6}$
Round trip total: $12 \times 6 = \mathbf{72}$.
View Solution & Answer (Click to Expand)
1. Outbound: $3 \times 4 = 12$.
2. Inbound: $(4 - 1) \times (3 - 1) = 6$.
3. Product: $12 \times 6 = 72$.
Answer: 72
👯 [1:1 Diagnostic Twin 15]

Under the same network, find the round-trip routes if previously used roads may be reused.

Check Twin Answer
$12 \times 12 = 144$.
Answer: 144
🌿 Yul's Masterclass Perspective
"Mastery of counting principles does not rely on memorizing complex permutation symbols—it is built on the twin pillars of the sum and product rules, commanding symmetry and tree branching with absolute logical clarity."

You have commanded all 15 core counting killers and their diagnostic twins.

In the next session, we advance to [Probability · Core Concepts ②] Permutations (Arranging in a Line) & Combinations (Selecting Representatives).

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)