Least Common Multiple (LCM): The smallest positive number that is a multiple of two or more numbers
- List multiples of first number: Write several multiples of the first number
- List multiples of second number: Write several multiples of the second number
- Identify common multiples: Find numbers that appear in both lists
- Select the least: Choose the smallest common multiple
6 × 2 = 12
6 × 3 = 18
6 × 4 = 24
6 × 5 = 30
6 × 6 = 36
6 × 7 = 42
6 × 8 = 48
Multiples of 6: {6, 12, 18, 24, 30, 36, 42, 48, ...}
8 × 2 = 16
8 × 3 = 24
8 × 4 = 32
8 × 5 = 40
8 × 6 = 48
8 × 7 = 56
8 × 8 = 64
Multiples of 8: {8, 16, 24, 32, 40, 48, 56, 64, ...}
{6, 12, 18, 24, 30, 36, 42, 48, ...}
{8, 16, 24, 32, 40, 48, 56, 64, ...}
Common multiples: {24, 48, ...}
The smallest number in {24, 48, ...} is 24
24 ÷ 6 = 4 ✓
24 ÷ 8 = 3 ✓
The LCM of 6 and 8 is 24.
• Multiple identification: Find numbers divisible by both original numbers
• Common multiple principle: LCM must be a multiple of all original numbers
• Verification: Check that LCM is divisible by both numbers
Prime factorization method: Finding LCM by taking the highest power of all prime factors
12 = 2² × 3¹
12 ÷ 2 = 6
6 ÷ 2 = 3
3 ÷ 3 = 1
18 = 2¹ × 3²
18 ÷ 2 = 9
9 ÷ 3 = 3
3 ÷ 3 = 1
12 = 2² × 3¹
18 = 2¹ × 3²
All primes: 2 and 3
For 2: max(2, 1) = 2
For 3: max(1, 2) = 2
LCM = 2² × 3² = 4 × 9 = 36
36 ÷ 12 = 3 ✓
36 ÷ 18 = 2 ✓
The LCM of 12 and 18 is 36.
• Prime factorization: Express each number as product of primes
• Complete coverage: Include all primes from both numbers
• Highest power rule: Take maximum exponent for each prime
LCM of multiple numbers: The smallest number that is a multiple of all given numbers
8 = 2³
12 = 2² × 3¹
18 = 2¹ × 3²
8 = 2³
12 = 2² × 3¹
18 = 2¹ × 3²
All primes: 2 and 3
For 2: max(3, 2, 1) = 3
For 3: max(0, 1, 2) = 2
LCM = 2³ × 3² = 8 × 9 = 72
72 ÷ 8 = 9 ✓
72 ÷ 12 = 6 ✓
72 ÷ 18 = 4 ✓
The LCM of 8, 12, and 18 is 72.
• Extension principle: Same method applies to multiple numbers
• Complete coverage: Include all primes from ANY number
• Maximum exponent: Take largest power among all numbers
Least Common Multiple (LCM): The smallest positive integer that is a multiple of two or more numbers
Multiple: A number that can be divided evenly by another number
Common multiple: A multiple that two or more numbers share
Prime factorization: Expressing a number as a product of prime numbers
- Choose method: Decide between listing or prime factorization
- Find multiples: Either list multiples or find prime factorization
- Identify commonality: Find multiples shared by all numbers
- Select minimum: Choose the smallest common multiple
- Verify: Ensure the LCM is divisible by all original numbers
• LCM(a,b) ≥ max(a,b): LCM is never smaller than the largest number
• LCM(a,a) = a: Number with itself has LCM equal to itself
• LCM(a,1) = a: Any number with 1 has LCM equal to itself
• LCM relationship: LCM(a,b) × GCF(a,b) = a × b
• Coprime numbers: If GCF(a,b) = 1, then LCM(a,b) = a × b
Real-world application: Using LCM to find when simultaneous events occur again
Prime factorization method:
12 = 2² × 3¹
18 = 2¹ × 3²
Common primes: 2 and 3
Highest powers: 2² and 3²
LCM = 2² × 3² = 4 × 9 = 36
Both buses return at different intervals
We need to find when they'll coincide again
Bus A returns every 12 minutes
Bus B returns every 18 minutes
Find LCM(12, 18) to find when both return together
12 = 2² × 3¹
18 = 2¹ × 3²
All primes: 2 and 3
For 2: max(2, 1) = 2
For 3: max(1, 2) = 2
LCM = 2² × 3² = 4 × 9 = 36
36 ÷ 12 = 3 (Bus A returns 3 times)
36 ÷ 18 = 2 (Bus B returns 2 times)
Both buses will return to the station at the same time after 36 minutes.
• Scheduling problem: LCM finds when cyclical events align
• Simultaneous occurrence: LCM gives time for next coincidence
• Verification: Check that LCM is divisible by both intervals
Advanced application: Using LCM for optimal distribution problems
15 = 3¹ × 5¹
20 = 2² × 5¹
25 = 5²
All primes: 2, 3, 5
Highest powers: 2², 3¹, 5²
LCM = 2² × 3¹ × 5² = 4 × 3 × 25 = 300
15 = 3¹ × 5¹
20 = 2² × 5¹
25 = 5²
All primes in any number: 2, 3, 5
For 2: max(0, 2, 0) = 2
For 3: max(1, 0, 0) = 1
For 5: max(1, 1, 2) = 2
LCM = 2² × 3¹ × 5² = 4 × 3 × 25 = 300
LCM tells us the total number of items in all bags
But for the number of bags, we need GCF: GCF(15, 20, 25) = 5
So we can make 5 identical bags with 3, 4, 5 of each item respectively
The LCM of 15, 20, and 25 is 300. The smallest number of identical gift bags that can be created is 5 bags, each containing 3, 4, and 5 of each item type respectively.
• Three-number LCM: Same method extends to multiple numbers
• Distribution application: LCM gives total for equal distribution
• Bag creation: GCF determines number of identical bags
Least Common Multiple (LCM): The smallest positive integer that is a multiple of two or more numbers
Multiple: A number that can be divided evenly by another number (b is a multiple of a if b ÷ a is a whole number)
Common multiple: A multiple that two or more numbers share
Coprime numbers: Two numbers whose GCF is 1 (they share no common factors except 1)
- Identify the numbers: Determine which numbers to find LCM for
- Choose method: Select listing or prime factorization based on number size
- Execute method: Either list multiples or find prime factorizations
- Find commonality: Identify multiples shared by all numbers
- Select minimum: Choose the smallest common multiple
- Verify result: Ensure LCM is divisible by all original numbers
• Size requirement: LCM is never smaller than the largest number
• Upper bound: LCM is at most the product of all numbers
• Self-property: LCM(a, a) = a
• Unity property: LCM(a, 1) = a
• Prime property: If p is prime and p doesn't divide a, then LCM(p, a) = p × a
• Relationship: LCM(a, b) × GCF(a, b) = a × b