[Probability · Core Concepts ① - Counting Principles] The Essence of Events & Counting: Rule of Sum vs Rule of Product, Currency Denominations & Tree Diagrams

 

Probability · Core Concepts ① [Foundations of Counting]

The Essence of Events & Counting: Rule of Sum vs Rule of Product & Tree Diagrams

Mutually Exclusive Choices, Sequential Couplings, Currency Payment Combinations & Grid Routing Invariants

🎯 3 Golden Action Protocols for Fundamental Counting
  • Evaluate Sequential Continuity Rather Than Strict Simultaneity: Even if events do not happen at the exact same physical second, apply the Rule of Product ($m \times n$) whenever choices form an ongoing chain to conclude a single composite trial.
  • Partition Independent Branches into Mutually Exclusive Cases: When choices diverge into separate, self-contained alternatives that cannot occur together ("either this OR that"), compute each path independently and apply the Rule of Sum ($m + n$).
  • Deploy the Complementary Principle for 'At Least' Conditions: When asked to find outcomes containing "at least one...", computing direct cases is cumbersome. Immediately subtract the completely opposite outcome: $\mathbf{\text{Total Outcomes} - \text{Complementary Outcomes}}$.

1. The Core Criteria: Rule of Sum (OR) vs Rule of Product (AND)

The most frequent stumbling block in combinatorics is determining whether to add or multiply possibilities. The mathematical distinction is defined strictly as follows:

Principle Key Conjunction Operation Analytical Criterion
Rule of Sum Either / OR $\mathbf{m + n}$ Events cannot occur simultaneously (Terminal branches)
Rule of Product Both / AND (Sequential) $\mathbf{m \times n}$ Events occur in succession to form a complete pair
[Rule of Sum] Alternative Choices (m + n) Start Event A (m ways) Event B (n ways) OR [Rule of Product] Sequential Coupling (m × n) Step 1 Step 2 Done m ways n ways
✏️ [Standard Example 1] Sum of Two Rolled Dice Multiples
Two distinct fair six-sided dice are rolled simultaneously. Find the number of outcomes where the sum of the two upward-facing numbers is a **multiple of $5$**.
💡 Yul's Pro-Tip: The sum of two dice ranges from minimum $2$ to maximum $12$!
Therefore, the only possible multiples of $5$ are **sum $= 5$** and **sum $= 10$**.
Since these two cases are mutually exclusive, apply the Rule of Sum:
• Sum $= 5$: $(1,4), (2,3), (3,2), (4,1) \implies \mathbf{4\text{ outcomes}}$
• Sum $= 10$: $(4,6), (5,5), (6,4) \implies \mathbf{3\text{ outcomes}}$
Total outcomes: $4 + 3 = \mathbf{7}$.
View Solution & Answer (Click to Expand)
1. Mutually exclusive event partition: Sum is 5 OR sum is 10.
2. Pairs for sum 5: $(1,4), (2,3), (3,2), (4,1)$ (4 pairs).
3. Pairs for sum 10: $(4,6), (5,5), (6,4)$ (3 pairs).
4. Application of Rule of Sum: $4 + 3 = 7$.
Answer: 7

2. Shortest Grid Routing: The Node-Summation Principle

In rectangular grid street networks, determining the number of shortest paths from $A$ to $B$ is accomplished most reliably by successively applying the Rule of Sum to each intersection vertex, bypassing complicated factorials when barriers or ponds obstruct intermediate segments.

A B 1 1 1 1 1 2 3 4 3 6 10 6 + 4 = 10
[Core Invariant 1] 3 Rules for Grid Path Calculation

• Boundary Initialization: Mark $1$ on every vertex directly adjacent along the initial rightward and upward edges from the origin $A$.
• Intersection Summation: The number of paths reaching an intersection is the sum of the paths entering from the left and entering from below.
• Mandatory Waypoints: For routes constrained to pass through a specific point $P$ ($A \to P \to B$), calculate paths from $A \to P$ and from $P \to B$ independently, then multiply using the Rule of Product ($m \times n$).

✏️ [Standard Example 2] Pathways with an Intermediate Waypoint
In a town, there are $3$ distinct roads connecting Home to the Library, and $4$ distinct roads connecting the Library to the School. Find the total number of paths to travel from Home to the School via the Library.
💡 Yul's Pro-Tip: Reaching the Library does not conclude the travel trial!
For each of the $3$ paths to the Library, there are $4$ subsequent paths to the School continuing in succession. Apply the Rule of Product:
Total routes: $3 \times 4 = \mathbf{12}$.
View Solution & Answer (Click to Expand)
1. Sequential trial identification: Leg 1 (Home $\to$ Library) and Leg 2 (Library $\to$ School).
2. Rule of Product calculation: $3 \times 4 = 12$.
Answer: 12

3. Exam Killer: Number of 'Payment Methods' vs 'Payable Amounts'

One of the highest error-rate traps in middle school combinatorics is failing to distinguish between the physical choice of currency notes versus the net numerical sum paid out.

[Core Invariant 2] Payment Methods vs Payable Amounts

• Number of Payment Methods: Tracks which physical bills/coins are tendered. Paying one $100$-won coin versus paying two $50$-won coins count as two distinct methods.
$\implies$ $(n_{100} + 1)(n_{50} + 1)(n_{10} + 1) \cdots - 1$ (subtracting the $0$-won case).

• Number of Payable Amounts: Tracks only the aggregate total value paid. Since one $100$-won coin and two $50$-won coins equal the same numerical sum of $100$, redundant sums must be merged.
$\implies$ [Denomination Breakdown Technique]: If smaller coins can accumulate to equal a larger denomination, convert that larger bill entirely into the smaller denomination and count the resulting methods!

✏️ [Standard Example 3] Payment Methods vs Amounts with 100, 50, and 10 Won Coins
You have one $100$-won coin, three $50$-won coins, and two $10$-won coins. Using any number of these coins (excluding paying $0$ won), find:
(1) The number of different payment methods
(2) The number of different payable amounts
💡 Yul's Pro-Tip:
(1) Methods: Multiply $(count + 1)$ for each coin (including using $0$) and subtract $1$:
$(1 + 1)(3 + 1)(2 + 1) - 1 = 2 \times 4 \times 3 - 1 = \mathbf{23\text{ methods}}$.

(2) Amounts: Three $50$-won coins exceed $100$ won, creating value overlaps! (Two $10$-won coins cannot make $50$, so $10$-won coins remain separate).
Convert the one $100$-won coin into **two $50$-won coins**.
The wallet now effectively holds **five $50$-won coins and two $10$-won coins**!
Payable amounts $= (5 + 1)(2 + 1) - 1 = 6 \times 3 - 1 = \mathbf{17\text{ amounts}}$.
View Solution & Answer (Click to Expand)
1. Methods: $(1+1)(3+1)(2+1) - 1 = 24 - 1 = 23$.
2. Amounts: Break down one $100$-won into two $50$-wons $\implies 3 + 2 = 5$ fifty-won coins, $2$ ten-won coins.
Total amounts: $(5+1)(2+1) - 1 = 18 - 1 = 17$.
Answer: (1) 23  |  (2) 17

4. When Formulas Fail: The 3 Core Scenarios Demanding a Tree Diagram

Simple multiplication and addition formulas function only when the number of remaining branches at each stage remains invariant. Whenever previous selections restrict or alter the available options of subsequent steps, sketching a Tree Diagram is the only guaranteed route to complete accuracy.

[Core Invariant 3] 3 Signals to Deploy a Tree Diagram

• Signal 1 [Derangements / Secret Santas]: Situations where no element occupies its original position (e.g., $i$-th person cannot pick item $i$).
• Signal 2 [Non-Consecutive / Precedence Constraints]: Situations where immediate prior results restrict the next choice (e.g., coins avoiding 3 consecutive heads).
• Signal 3 [Early-Termination Tournament Series]: Situations where the total number of trials varies dynamically (e.g., best-of-3 series ending in either 2 or 3 games).

A's Hat B's Hat C's Hat D's Hat Outcome b a c d d c (b,a,d,c) d a (b,c,d,a) a c (b,d,a,c) A selects b (3 ways) × (A selecting c or d: 2 ways) = Total 9 ways!
✏️ [Standard Example 4] 4 Students Swapping Hats (4-Item Derangement)
Four students $A, B, C, D$ place their hats into a box and each randomly draws one hat. Find the number of outcomes where **all $4$ students wear somebody else's hat**.
💡 Yul's Pro-Tip: Memorize the standard derangement constants!
• 2 people: $\mathbf{1\text{ way}}$
• 3 people: $\mathbf{2\text{ ways}}$
• 4 people: Student $A$ selects one of 3 other hats ($b, c, d$). Each choice generates exactly 3 valid branches.
Therefore: $3 \times 3 = \mathbf{9\text{ ways}}$! (For reference, 5 people yields $\mathbf{44\text{ ways}}$).
View Solution & Answer (Click to Expand)
1. Choice for $A$: can take $b, c,$ or $d$ ($3$ choices).
2. Fixing $A = b$: valid remaining branches are $(b,a,d,c), (b,c,d,a), (b,d,a,c)$ ($3$ branches).
3. By symmetry, $A=c$ and $A=d$ produce identical trees: $3 \times 3 = 9$.
Answer: 9

5. ⚠️ Three Traps That Cost 10 Points on Combinatorics Exams

🚨 [Trap 1] Treating Physically Identical Dice as Mathematically Indistinguishable
• Critical Mistake: Reading "two identical dice are rolled" and treating $(1,2)$ and $(2,1)$ as a single merged outcome.
• Fact Check: In combinatorics and probability, identical physical items are treated as distinguishable trials (Die 1 vs Die 2). There are strictly $6 \times 6 = 36$ equally likely outcomes.
🚨 [Trap 2] Forgetting to Deduct the 0-Won Outcome in Payment Combinations
• Critical Mistake: Calculating $(a+1)(b+1)(c+1) = 24$ and writing $24$ as the final answer.
• Fact Check: The case where zero units of every coin are selected represents paying $0$ won, which problem statements explicitly forbid. You must always remember the **$- 1$**.
🚨 [Trap 3] Failing to Deduct Common Multiples in Rule of Sum Applications
• Critical Mistake: Adding $10$ multiples of 2 and $6$ multiples of 3 to claim $16$ outcomes on cards $1 \sim 20$.
• Fact Check: Multiples of $6$ ($6, 12, 18$) are counted in both sets. You must subtract the 3 common multiples: $10 + 6 - 3 = \mathbf{13}$.
🌿 Yul's Masterclass Perspective
"Counting is not the brute force calculation of tally marks; it is the art of partitioning possibilities without overlap and without omission."

You have commanded the essential architecture: sum vs product rules, grid node summations, currency denomination breakdowns, and derangement tree diagrams.

Put these conceptual tools into practice with [Probability · Practice Lab ① - Counting Principles] 15 Ultra-Challenging Middle School Killers & 1:1 Diagnostic Twins.

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)