[Number & Operations · Core Concepts ③ - Least Common Multiple] The Essence of LCM: Common Multiple Invariance, Product Formula (A×B=G×L), Fraction Multipliers & 4 Applications
The Essence of LCM: Common Multiple Invariance, Prime Factorization, Product Formula ($A \times B = G \times L$) & 4 Applications
Governing common multiples via the LCM, prime factor exponent maximization, algebraic proof of $A \times B = G \times L$, brick stacking, and minimal fraction multipliers
"All common multiples are multiples of their LCM, and in exponential form, we collect every prime factor while selecting the larger or equal exponent." Mastering this principle illuminates why $A \times B = G \times L$ holds and makes gear meshing and remainder equations effortless.
The Fundamental Common Multiple Theorem
Control the infinite set of common multiples entirely through their smallest representative.
The common multiples of two or more natural numbers are strictly identical to the multiples of their Least Common Multiple (LCM).
Because common multiples extend infinitely, a "greatest common multiple" does not exist. All common multiples take the form $L, 2L, 3L, \dots$ where $L$ is the LCM.
[2] LCM of Coprime Numbers
If two natural numbers $A, B$ are coprime ($\gcd(A, B) = 1$), they share no prime factors. Thus, their LCM is simply their product $A \times B$.
Example: Since 8 and 9 are coprime, $\text{LCM}(8, 9) = 8 \times 9 = 72$.
View Solution & Answer (Click)
2. Bounds on $k$ ($k \in \mathbb{N}$):
$100 \div 28 \approx 3.57 \implies k \ge 4$
$999 \div 28 \approx 35.67 \implies k \le 35$
3. Total count: $35 - 4 + 1 = 32$.
Answer: 32
Finding LCM via Prime Factorization (Exponent Maximization)
Extract the least common multiple error-free from exponential structures.
Step 1: Fully factorize each number into prime powers.
Step 2: Select every prime factor present in any number, and choose the largest or equal exponent for each base.
Why do we select the larger exponent and all prime bases?
The LCM must be divisible by each individual number. If a number contains $2^3$, the LCM must contain at least $2^3$ to divide evenly. Furthermore, if a prime appears in only one number, that prime must be included so that the LCM remains a multiple of that number.
---
2 ) 12 15 20 (15 brings down)
---
3 ) 6 15 10 (10 brings down)
---
5 ) 2 5 10 (2 brings down)
---
2 1 2 ➔ Divide by 2 once more
$30 = 2^1 \times 3^1 \times 5^1$
$40 = 2^3 \times 5^1$
--------------------------------
LCM $= \mathbf{2^3 \times 3^1 \times 5^1 = 120}$
$\text{LCM} = 2^3 \times 3 \times 5 = 120$
View Solution & Answer (Click)
2. Prime 3: $\max(2, b, 0) = 3 \implies b = 3$.
3. Prime 5: $\max(0, 1, c) = 2 \implies c = 2$.
Sum: $a + b + c = 4 + 3 + 2 = 9$.
Answer: 9
Product Theorem for Two Natural Numbers ($A \times B = G \times L$)
Algebraic proof and constraints of the product identity relating GCD and LCM.
Let natural numbers $A, B$ have GCD $G$. Then $A = Ga, B = Gb$ where $\gcd(a, b) = 1$.
The LCM of $A$ and $B$ is $\mathbf{L = G \times a \times b}$.
Multiplying $A$ and $B$:
$A \times B = (Ga) \times (Gb) = G \times (G \times a \times b)$
Since $(G \times a \times b) = L$, we obtain the identity:
$\mathbf{A \times B = G \times L}$
[2] Crucial Warning: Fails for Three or More Numbers!
The relationship $A \times B \times C = G \times L$ is false because common divisors are duplicated across terms. Use prime factorization structures when analyzing three numbers.
View Solution & Answer (Click)
$A = \frac{18 \times 216}{54} = \frac{216}{3} = 72$.
Answer: 72
3 Core Real-World Application Models for LCM
Standard models for word problems involving phrases like 'at the earliest simultaneous time' or 'smallest solid cube'.
Cube edge length = $\text{LCM}(a, b, c)$
Total bricks $= (L \div a) \times (L \div b) \times (L \div c)$
Simultaneous interval = $\text{LCM}(p, q)$
Total teeth turned = $\text{LCM}(A, B)$
Rotations of gear $= \text{LCM} \div (\text{Own teeth count})$
View Solution & Answer (Click)
2. Brick counts by dimension:
Length: $120 \div 12 = 10$
Width: $120 \div 15 = 8$
Height: $120 \div 8 = 15$
Total bricks: $10 \times 8 \times 15 = 1200$.
Answer: 1200
View Solution & Answer (Click)
2. Rotations of gear $A$: $144 \div 36 = 4$ rotations.
(Gear $B$ completes $144 \div 48 = 3$ rotations.)
Answer: 4 rotations
Equal Remainder Reversals & Integer Fraction Multipliers (GCD & LCM Mixed)
Formulas for finding integers leaving fixed remainders and determining minimal fractions that multiply into natural numbers.
If integer $N$ leaves remainder $r$ when divided by $A$ and $B$, then $N - r$ is a common multiple of $A$ and $B$.
The smallest such natural number $N$ is:
$\mathbf{N = \text{LCM}(A, B) + r}$
[2] Finding the Smallest Irreducible Fraction Multiplying Fractions into Integers
To multiply fractions $\frac{A}{B}$ and $\frac{C}{D}$ by $\frac{y}{x}$ such that both products evaluate to natural numbers:
$\frac{A}{B} \times \frac{y}{x} = \text{Natural Number}, \quad \frac{C}{D} \times \frac{y}{x} = \text{Natural Number}$
1. Numerator $y$: Must cancel denominators $B$ and $D$, so $y$ is a multiple of $B$ and $D$.
2. Denominator $x$: Must be canceled by numerators $A$ and $C$, so $x$ is a divisor of $A$ and $C$.
To make fraction $\frac{y}{x}$ as small as possible, minimize numerator $y$ and maximize denominator $x$:
$\mathbf{\text{Smallest Irreducible Fraction } \frac{y}{x} = \frac{\text{LCM of Denominators}(B, D)}{\text{GCD of Numerators}(A, C)}}$
$\mathbf{N = \text{LCM}(A, B) + r}$ ($N > r$)
$\mathbf{\frac{\text{LCM of Denominators}(B, D)}{\text{GCD of Numerators}(A, C)}}$
View Solution & Answer (Click)
2. General form: $120k + 2$.
For smallest three-digit number ($k = 1$): $120(1) + 2 = 122$.
Answer: 122
View Solution & Answer (Click)
2. Numerator $b = \text{LCM}(12, 15) = 60$.
The smallest irreducible fraction is $\frac{60}{7}$.
Answer: $\frac{60}{7}$

Comments
Post a Comment