Least Common Multiple (LCM): The smallest positive integer that is divisible by two or more numbers.
Listing Multiples Method: Find multiples of each number and identify the smallest common multiple.
- List multiples of the first number
- List multiples of the second number
- Identify common multiples
- Select the smallest common multiple
6, 12, 18, 24, 30, 36, 42, 48...
8, 16, 24, 32, 40, 48, 56...
Common multiples: 24, 48, 72...
The smallest common multiple is 24
The LCM of 6 and 8 is 24.
• Multiples: Find numbers that are divisible by each original number
• Commonality: Look for multiples shared by all numbers
• Least Value: Select the smallest common multiple
Prime Factorization Method: Find prime factorization of each number and multiply all prime factors with highest exponents.
12 = 2² × 3 = 2 × 2 × 3
18 = 2 × 3² = 2 × 3 × 3
Prime factors present: 2 and 3
Highest exponent of 2: max(2,1) = 2
Highest exponent of 3: max(1,2) = 2
LCM = 2² × 3² = 4 × 9 = 36
36 ÷ 12 = 3 (whole number)
36 ÷ 18 = 2 (whole number)
✓ Both divisions result in whole numbers
The LCM of 12 and 18 is 36.
• Prime Factorization: Express each number as product of primes
• All Primes: Include every prime that appears in any factorization
• Highest Exponents: Use maximum exponent for each prime
LCM of Multiple Numbers: The smallest positive integer that is divisible by all given numbers.
10 = 2 × 5
15 = 3 × 5
25 = 5²
Prime factors present: 2, 3, and 5
Highest exponent of 2: max(1,0,0) = 1
Highest exponent of 3: max(0,1,0) = 1
Highest exponent of 5: max(1,1,2) = 2
LCM = 2¹ × 3¹ × 5² = 2 × 3 × 25 = 150
150 ÷ 10 = 15 (whole number)
150 ÷ 15 = 10 (whole number)
150 ÷ 25 = 6 (whole number)
✓ All divisions result in whole numbers
The LCM of 10, 15, and 25 is 150.
• All Numbers: Include primes from ALL factorizations
• Highest Exponents: Use maximum exponent across all factorizations
• Verification: LCM must be divisible by all original numbers
Least Common Multiple (LCM): The smallest positive integer that is divisible by two or more numbers.
Multiple: A number that can be divided by another number without remainder.
Prime Factorization: Expressing a number as a product of prime numbers.
GCF-LCM Relationship: LCM(a,b) × GCF(a,b) = a × b.
- Listing Multiples: For small numbers, list multiples and find the smallest common one
- Prime Factorization: Find prime factors of each number and multiply all primes with highest exponents
- GCF Relationship: Use LCM(a,b) = (a×b)/GCF(a,b) when GCF is known
- Verification: Check that LCM is divisible by all original numbers
• All Primes Required: Include every prime that appears in any factorization
• Highest Exponents: Use maximum exponent for each prime
• Verification: LCM must be divisible by each original number
• Minimum Value: LCM cannot be smaller than the largest number
GCF-LCM Relationship: LCM(a,b) × GCF(a,b) = a × b, so LCM(a,b) = (a×b)/GCF(a,b).
Prime factorization of 24: 2³ × 3
Prime factorization of 36: 2² × 3²
GCF = 2² × 3¹ = 4 × 3 = 12
LCM(24, 36) = (24 × 36) ÷ GCF(24, 36)
LCM(24, 36) = (24 × 36) ÷ 12
24 × 36 = 864
864 ÷ 12 = 72
72 ÷ 24 = 3 (whole number)
72 ÷ 36 = 2 (whole number)
✓ Both divisions result in whole numbers
The LCM of 24 and 36 is 72.
• GCF-LCM Formula: LCM(a,b) = (a×b)/GCF(a,b)
• Relationship: LCM × GCF = a × b
• Verification: LCM must be divisible by both original numbers
Application Problem: Real-world scenario requiring LCM to find when cycles align.
We need to find when both buses will be at the station simultaneously
This occurs at the LCM of their return intervals
Prime factorization of 15: 3 × 5
Prime factorization of 20: 2² × 5
Prime factors present: 2, 3, and 5
Highest exponent of 2: max(0,2) = 2
Highest exponent of 3: max(1,0) = 1
Highest exponent of 5: max(1,1) = 1
LCM = 2² × 3¹ × 5¹ = 4 × 3 × 5 = 60
After 60 minutes:
Bus A returns: 60 ÷ 15 = 4 times (at 15, 30, 45, 60 min)
Bus B returns: 60 ÷ 20 = 3 times (at 20, 40, 60 min)
Both buses are at the station at 60 minutes
Both buses will return to the station at the same time after 60 minutes.
• Real-world Application: LCM finds when repeating events align
• Cycle Alignment: Events repeat at LCM of their periods
• Verification: Check that LCM is divisible by both periods
Least Common Multiple (LCM): The smallest positive integer that is divisible by two or more numbers.
Lowest Common Multiple: Alternative name for LCM, used in some regions.
Coprime Numbers: Numbers whose GCF is 1 (no common factors other than 1).
GCF-LCM Relationship: LCM(a,b) × GCF(a,b) = a × b.
- For Small Numbers: Use listing multiples method
- For Medium Numbers: Use prime factorization method
- When GCF Known: Use GCF relationship method
- For Multiple Numbers: Apply method iteratively
• All Primes Required: Include every prime that appears in any factorization
• Highest Exponents: Use maximum exponent for each prime
• Verification: LCM must be divisible by each original number
• Minimum Value: LCM cannot be smaller than the largest number
• Relationship: GCF(a,b) × LCM(a,b) = a × b