[Integrated Math 1 · Core Concepts ⑫-1] Principles of Counting: Addition vs. Multiplication, System Ordered Pairs, Tree Diagrams & Payment Methods
The Logic Behind Counting: Addition vs. Multiplication Principles, Ordered Pairs in Systems, Tree Diagrams & Payment Methods
Beyond inequalities to the foundational pillars of advanced probability: Ending brute-force enumeration via structured tree diagrams, parameter-led ordered pair branches, network paths & currency conversion techniques.
While elementary counting relied on counting on fingers, high school combinatorics demands structural elegance. Elite students rely on two decisive criteria: "When do we add ($+$), and when do we multiply ($\times$)?"
From tree diagrams that capture chaotic conditions without omission, to partitioning equations and inequalities by the largest coefficient, to network paths and currency conversions, let us unlock these core principles with absolute mathematical clarity!
Definition of Events & The Addition Principle
A repeatable experiment or observation is a 'trial', and its outcome is an 'event'.
If two events $A$ and $B$ are mutually exclusive (cannot occur simultaneously), and event $A$ occurs in $m$ ways while event $B$ occurs in $n$ ways:
$$\mathbf{n(A \text{ or } B) = m + n}$$ • Keywords: "or", "either", "selective alternatives" (Choosing branch $A$ completely precludes branch $B$).
• 🚨 When Events Overlap (Principle of Inclusion-Exclusion):
If events $A$ and $B$ can occur at the same time, the common outcomes ($A \cap B$) are counted twice and must be subtracted:
$$\mathbf{n(A \cup B) = n(A) + n(B) - n(A \cap B)}$$
View Solution & Answer (Click)
• Multiples of 5 (Set $B$): $n(B) = 100 \div 5 = 20$
• Multiples of 15 (Set $A \cap B$): $n(A \cap B) = 100 \div 15 = 6$
Applying inclusion-exclusion:
$n(A \cup B) = 33 + 20 - 6 = 47$
Answer: 47
View Solution & Answer (Click)
1) $z = 1$: $2x + y = 12$
• For $x = 1, 2, 3, 4, 5$, $y = 10, 8, 6, 4, 2 \implies 5$ pairs
2) $z = 2$: $2x + y = 9$
• For $x = 1, 2, 3, 4$, $y = 7, 5, 3, 1 \implies 4$ pairs
3) $z = 3$: $2x + y = 6$
• For $x = 1, 2$, $y = 4, 2 \implies 2$ pairs
4) $z = 4$: $2x + y = 3$
• For $x = 1$, $y = 1 \implies 1$ pair
Since these cases are mutually exclusive (Addition Rule):
$\text{Total} = 5 + 4 + 2 + 1 = 12$
Answer: 12
View Solution & Answer (Click)
1) $y = 1$: $2x + 3 \le 12 \implies 2x \le 9 \implies x \le 4.5$
Natural numbers $x \in \{1, 2, 3, 4\} \implies 4$ pairs
2) $y = 2$: $2x + 6 \le 12 \implies 2x \le 6 \implies x \le 3$
Natural numbers $x \in \{1, 2, 3\} \implies 3$ pairs
3) $y = 3$: $2x + 9 \le 12 \implies 2x \le 3 \implies x \le 1.5$
Natural numbers $x \in \{1\} \implies 1$ pair
4) $y \ge 4$: $2x + 12 \le 12 \implies 2x \le 0$ (no natural solutions)
Total ordered pairs $= 4 + 3 + 1 = 8$
Answer: 8
The Multiplication Principle & The Power of Tree Diagrams
When two events occur sequentially in time or pair up simultaneously in space, we apply multiplication.
If event $A$ can occur in $m$ ways, and for each of these ways event $B$ can occur in $n$ ways:
$$\mathbf{n(A \text{ and } B \text{ in succession}) = m \times n}$$ • Keywords: "and", "simultaneously", "consecutively", "followed by"
• The Systematic Power of Tree Diagrams:
When complex constraints lack simple formulas (e.g., derangements where no one receives their own item, tournament tiebreakers), a tree diagram systematically lists all possibilities without duplication or omission.
View Solution & Answer (Click)
• 1st bracket: 3 choices
• 2nd bracket: 2 choices
• 3rd bracket: 4 choices
$\text{Total Terms} = 3 \times 2 \times 4 = 24$
Answer: 24
View Solution & Answer (Click)
• If $B$ takes $A$: $C$ takes $D$, $D$ takes $C \implies (B, A, D, C)$ (1 way)
• If $B$ takes $C$: $C$ takes $D$, $D$ takes $A \implies (B, C, D, A)$ (1 way)
• If $B$ takes $D$: $C$ takes $A$, $D$ takes $C \implies (B, D, A, C)$ (1 way)
Thus, when $A$ takes $B$, there are exactly 3 valid assignments.
By symmetry, $A$ can take $B, C,$ or $D$ (3 symmetric cases).
$\text{Total Derangements} = 3 \times 3 = 9$
Answer: 9
Three Benchmark Counting Models for High-Scoring Exams
Master the integration of addition and multiplication across divisors, network paths, and currency systems.
• Number of Positive Divisors: $\mathbf{(a + 1)(b + 1)(c + 1)}$
• Sum of Positive Divisors: $\mathbf{S = (1 + p + \dots + p^a)(1 + q + \dots + q^b)(1 + r + \dots + r^c)}$
• (2) Consecutive linked path segments $\implies$ Multiplication Principle
• Number of Distinct Amounts (Overlapping Values): Convert higher denominations into smaller equivalent coins (Forced Currency Conversion) when smaller coins can fully substitute a larger bill!
View Solution & Answer (Click)
• $a = (3 + 1)(2 + 1)(1 + 1) = 4 \times 3 \times 2 = 24$.
• Even divisors must include at least one factor of 2 (choices: $2^1, 2^2, 2^3 \implies 3$ choices):
$b = 3 \times (2 + 1)(1 + 1) = 3 \times 3 \times 2 = 18$.
$a + b = 24 + 18 = 42$.
Answer: 42
View Solution & Answer (Click)
(i) Via $B$ ($A \to B \to C$): $3 \times 4 = 12$ ways.
(ii) Via $D$ ($A \to D \to C$): $2 \times 3 = 6$ ways.
$\text{Total Paths} = 12 + 6 = 18$.
Answer: 18
(1) The number of ways to pay.
(2) The number of distinct amounts that can be paid.
View Solution & Answer (Click)
$(1 + 1)(3 + 1)(4 + 1) - 1 = 2 \times 4 \times 5 - 1 = 39$ ways.
(2) Number of Distinct Amounts:
Three 500-won coins (1,500 won) can substitute for the 1,000-won bill, causing overlapping amounts.
Convert the 1,000-won bill into two 500-won coins.
Equivalent purse: five 500-won coins, four 100-won coins.
$\text{Distinct Amounts} = (5 + 1)(4 + 1) - 1 = 6 \times 5 - 1 = 29$ amounts.
Answer: (1) 39 ways, (2) 29 amounts
Three Critical Pitfalls in Counting Problems
Coming up next: Map coloring region partition, 3D network paths, and multi-tier currency conversion in [Integrated Math 1 · Practice Lab ⑫-1] Principles of Counting: 15 Benchmark Killers & 1:1 Twin Diagnostics!

Comments
Post a Comment