[Algebra · Core Concepts ⑦] The Foundations of Counting Principles: Addition vs. Multiplication, Divisor Sums & Multiples, Payment Methods vs. Total Values & Network Paths
The Foundations of Counting Principles: Addition vs. Multiplication & 5 Essential Core Frameworks
Expansion Terms, Divisor Counts & Sums, Currency Exchange Reductions, Network Routing & Constrained Mappings
- Decide Addition ($+$) vs. Multiplication ($\times$) by Stage Completion: If Event $A$ completely terminates the trial with no shared outcomes, apply the Addition Principle ($A + B$). If Event $A$ leaves the trial incomplete, requiring Event $B$ to follow sequentially, apply the Multiplication Principle ($A \times B$).
- For Distinct Payable Amounts, Check if Smaller Denominations Cover Larger Ones: If the total sum of a smaller denomination can equal or exceed the value of a single larger denomination, decompose (exchange) the larger bills into the smaller unit to prevent duplicate counting.
- Prioritize Constrained Slots in Network Routes and Mappings: Always anchor the most restrictive requirements first—such as mandatory waypoints, closed roads, or specific function values—before multiplying the unconstrained choices.
1. Addition Principle vs. Multiplication Principle: Tree Diagram Branching
Do not rely merely on semantic keywords like "or" versus "and." Instead, examine the trial's state: Has the overall selection concluded, or is it an ongoing sequence of interdependent stages?
2. [Type 1] Distinct Terms in Polynomial Expansions
View Solution & Answer (Click to Expand)
2. Terms from $(p + q)(x + y)$: $2 \times 2 = 4$.
3. Since all terms are mutually distinct: $9 + 4 = 13$.
Answer: $13$
Find the number of distinct terms when expanding $(a + b)(p + q + r)(x + y)$.
Check Diagnostic Answer
Answer: $12$
3. [Type 2] Number of Divisors, Multiple Restrictions & Divisor Sums
(1) The total number of positive divisors
(2) The number of even divisors (multiples of 2)
(3) The number of divisors that are multiples of 3
(4) The number of divisors that are multiples of 6
(5) The sum of all positive divisors
View Solution & Answer (Click to Expand)
(2) Even Divisors (Exponent of 2 is in $\{1, 2, 3, 4\}$): $4 \times 3 \times 2 = 24$.
(3) Multiples of 3 (Exponent of 3 is in $\{1, 2\}$): $5 \times 2 \times 2 = 20$.
(4) Multiples of 6 (Exponents: 2 in $\{1, 2, 3, 4\}$, 3 in $\{1, 2\}$): $4 \times 2 \times 2 = 16$.
(5) Divisor Sum: $(1 + 2 + 4 + 8 + 16)(1 + 3 + 9)(1 + 5) = 31 \times 13 \times 6 = 2418$.
Answer: (1) 30 / (2) 24 / (3) 20 / (4) 16 / (5) 2418
For $540 = 2^2 \times 3^3 \times 5^1$, find the number of odd divisors and the number of multiples of 6.
Check Diagnostic Answer
Multiples of 6: $2 \times 3 \times 2 = 12$.
Answer: 8 odd divisors, 12 multiples of 6
4. [Type 3] Payment Methods vs. Payable Amounts (Currency Reductions)
(1) The number of different payment methods
(2) The number of distinct payable amounts
View Solution & Answer (Click to Expand)
(2) Payable Amounts:
Exchange the $10 bill into two $5 bills $\implies$ five $5 bills and four $1 bills.
Payable amounts $= (5 + 1)(4 + 1) - 1 = 6 \times 5 - 1 = 29$.
Answer: (1) 39 / (2) 29
With two $5 bills and three $1 bills, find the number of payment methods $a$ and payable amounts $b$.
Check Diagnostic Answer
$a = (2 + 1)(3 + 1) - 1 = 11$. $b = a = 11$.
Answer: a = 11, b = 11
5. [Type 4] Network Routing: Waypoints, Round-Trips & Non-Crossing Paths
(1) Find the number of paths from $A$ to $D$.
(2) For a round trip from $A$ to $D$ and back to $A$, find the number of routes such that no road used on the forward journey is reused on the return trip.
View Solution & Answer (Click to Expand)
(2) Round trip without path reuse:
- Different intermediate towns: $A \to B \to D \to C \to A$: $3 \times 2 \times 3 \times 2 = 36$.
$A \to C \to D \to B \to A$: $2 \times 3 \times 2 \times 3 = 36$.
- Same intermediate towns: $A \to B \to D \to B \to A$: $3 \times 2 \times (2 - 1) \times (3 - 1) = 12$.
$A \to C \to D \to C \to A$: $2 \times 3 \times (3 - 1) \times (2 - 1) = 12$.
Total $= 36 + 36 + 12 + 12 = 96$.
Answer: (1) 12 / (2) 96
From $A$ to $B$ there are 2 paths, $B$ to $C$ has 4 paths, and a direct express road connects $A$ to $C$. Find all possible paths from $A$ to $C$.
Check Diagnostic Answer
Answer: $9$
6. [Type 5] Counting Functions under Range & Inequality Constraints
(1) $f(1) = 3$
(2) $f(1) \ge 4$ and $f$ is an injective (one-to-one) function
View Solution & Answer (Click to Expand)
(2) $f(1) \in \{4, 5, 6\}$ (3 choices). For an injective function:
$f(2)$ has 5 choices, $f(3)$ has 4 choices, $f(4)$ has 3 choices.
Count $= 3 \times (5 \times 4 \times 3) = 3 \times 60 = 180$.
Answer: (1) 216 / (2) 180
For $X = \{1, 2, 3\}$ and $Y = \{1, 2, 3, 4, 5\}$, find the number of injective functions such that $f(2) = 4$.
Check Diagnostic Answer
$1 \times 4 \times 3 = 12$.
Answer: $12$
When you identify stage boundaries, handle currency reductions cleanly, and isolate constraints before counting unconstrained variables, challenging questions become direct and manageable.

Comments
Post a Comment