The LCM of two or more positive integers is the smallest positive integer divisible by every given number. For example, the multiples of 4 are 4, 8, 12, 16, 20 and so on, while the multiples of 6 are 6, 12, 18, 24 and so on. Their smallest positive common multiple is 12. The LCM can be calculated by listing multiples, using prime factorization or applying the relationship between GCD and LCM. When prime factorization is used, every prime factor is selected with its greatest exponent among the given numbers. The LCM is especially useful when determining when repeating events occur together.
Least Common Multiple (LCM)
The Least Common Multiple (LCM) is the smallest positive integer that is a multiple of two or more given integers. It is useful for working with common denominators, repeating schedules and recurring events.
| Name | Expression | Description |
|---|---|---|
LCM Definition | LCM(a,b) = least positive common multiple of a and b | The LCM is the smallest positive integer divisible by both numbers. |
Prime Factorization Method | LCM(a,b) = product of all prime factors raised to their maximum exponents | Select every distinct prime factor appearing in either factorization and use its greatest exponent. |
GCD Relationship | LCM(a,b) = (a × b)/GCD(a,b) | For positive integers a and b, the LCM can be calculated by dividing their product by their GCD. |
Multiple-Integer LCM | LCM(a,b,c) = LCM(LCM(a,b),c) | The LCM of several integers can be calculated successively. |
Explanation
Variables
| Symbol | Meaning |
|---|---|
a | The first positive integer. |
b | The second positive integer. |
c | An additional positive integer. |
p | A distinct prime factor appearing in a factorization. |
e | The greatest exponent of a prime factor among the given integers. |
Example or application
A worked example has not yet been added.
Definition
The Least Common Multiple of two or more positive integers is the smallest positive integer that is divisible by every given integer.
Purpose
The LCM is used to find the smallest shared multiple, establish common denominators and solve problems involving repeated events or cycles.
Importance
It is essential for fraction addition and subtraction, scheduling, periodic events, number theory and calculations involving different units or intervals.
Key Concepts
| Name | Description |
|---|---|
Multiple | A number obtained by multiplying a given integer by another integer. |
Common Multiple | A number that is a multiple of every given integer. |
Least Common Multiple | The smallest positive number shared by the multiple sets of all given integers. |
Prime Factorization Method | A method of calculating LCM by selecting every required prime factor with its greatest exponent. |
Repeated Events | Events that occur at regular intervals and can happen together again after a time determined by their LCM. |
Characteristics
The LCM is a positive integer for positive input integers.
The LCM is divisible by every given integer.
The LCM is the smallest positive common multiple.
The LCM is never smaller than the largest input integer.
Every positive integer has infinitely many positive multiples.
Every positive common multiple is a multiple of the LCM.
The LCM can be calculated through listing multiples, prime factorization or the GCD relationship.
Types
| Name | Description |
|---|---|
LCM of Two Integers | The smallest positive common multiple of two positive integers. |
LCM of Multiple Integers | The smallest positive integer divisible by every integer in a given set. |
LCM Using Multiples | A method that lists multiples until the first shared positive multiple is found. |
LCM Using Prime Factorization | A method that selects all distinct prime factors with their maximum exponents. |
LCM Using GCD | A method that calculates the LCM from the product of two integers divided by their GCD. |
Components
| Name | Description |
|---|---|
Input Integers | The positive integers whose common multiple is being calculated. |
Multiples | The values generated by multiplying each input integer by positive integers. |
Common Multiples | The values shared by all multiple sequences. |
Least Common Multiple | The smallest positive value among the common multiples. |
Prime Factors | The prime factors used to construct the LCM through prime factorization. |
Properties
| Name | Expression | Description |
|---|---|---|
Commutative Property | LCM(a,b) = LCM(b,a) | Changing the order of the integers does not change the LCM. |
Identity with One | LCM(a,1) = a | The LCM of a positive integer and 1 is the integer itself. |
Equal Numbers | LCM(a,a) = a | The LCM of two equal positive integers is that integer. |
Divisibility | a | LCM(a,b) and b | LCM(a,b) | The LCM is divisible by each input integer. |
Coprime Numbers | If GCD(a,b) = 1, then LCM(a,b) = ab | The product of two coprime positive integers is their LCM. |
Scaling Property | LCM(ka,kb) = k × LCM(a,b), for k > 0 | Multiplying both positive integers by the same positive integer multiplies their LCM by that integer. |
Examples
| Problem | Solution | Explanation |
|---|---|---|
Find the LCM of 4 and 6 using multiples. | Multiples of 4: 4, 8, 12, 16, 20, 24. Multiples of 6: 6, 12, 18, 24. Therefore, LCM = 12. | The smallest positive number appearing in both multiple sequences is 12. |
Find the LCM of 12 and 18 using prime factorization. | 12 = 2^2 × 3 and 18 = 2 × 3^2. LCM = 2^2 × 3^2 = 36. | Select each distinct prime factor using the greatest exponent appearing in either factorization. |
Find the LCM of 15 and 20 using GCD. | GCD(15,20) = 5. LCM = (15 × 20)/5 = 60. | Divide the product of the two numbers by their greatest common divisor. |
Two bells ring at intervals of 6 minutes and 8 minutes. If they ring together now, after how many minutes will they ring together again? | LCM(6,8) = 24 minutes. | The least common multiple gives the smallest positive time interval that is divisible by both repeating intervals. |
Applications
Finding common denominators for fractions.
Adding and subtracting fractions with different denominators.
Determining when repeating events occur together.
Solving scheduling and periodic-event problems.
Converting measurements to common units.
Calculating repeated cycles in mathematics and science.
Prerequisites
Understanding of factors and multiples.
Knowledge of prime and composite numbers.
Understanding of prime factorization.
Basic multiplication and division.
Familiarity with GCD and common multiples.
Learning Objectives
Define the least common multiple.
Identify common multiples of positive integers.
Calculate LCM using multiple listing.
Calculate LCM using prime factorization.
Calculate LCM using the GCD relationship.
Find the LCM of three or more integers.
Apply LCM to recurring-event problems.
Common Mistakes
Choosing any common multiple instead of the least one.
Using the smallest exponent in prime factorization instead of the greatest.
Confusing LCM with GCD.
Multiplying the input numbers without checking whether they share factors.
Forgetting that the LCM must be divisible by every input number.
Using the GCD formula incorrectly.
Practice Questions
Find the LCM of 8 and 12.
Calculate the LCM of 18 and 24 using prime factorization.
Find the LCM of 15, 20 and 30.
Calculate the LCM of 21 and 28 using their GCD.
Two lights flash every 10 seconds and 15 seconds. When will they flash together again?
Explain why the LCM of two coprime integers equals their product.
Key Takeaway
The LCM is the smallest positive integer divisible by every given integer. It can be calculated through multiple listing, prime factorization or the relationship between GCD and LCM.
Related Topics
SCI-MAT-002-044
SCI-MAT-002-045
SCI-MAT-002-046
SCI-MAT-002-047
SCI-MAT-002-049
SCI-MAT-002-050
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory