Least Common Multiple (LCM) of 13 and 130
The least common multiple (LCM) of 13 and 130 is 130.
What is the Least Common Multiple (LCM)?
The LCM of two integers is the smallest positive integer that is divisible by both numbers. It is often used to find common denominators and solve problems involving periodic events.
Formula for LCM
The LCM of two numbers can be calculated using their GCD:
LCM(a, b) = |a × b| ÷ GCD(a, b)
How to Calculate the LCM of 13 and 130?
First, calculate the GCD of 13 and 130 using the Euclidean algorithm. Then use the formula above to find the LCM.
Step-by-Step GCD Calculation
| Step | Calculation |
|---|---|
| 1 | 13 ÷ 130 = 0 remainder 13 |
| 2 | 130 ÷ 13 = 10 remainder 0 |
Examples of LCM Calculations
| Numbers | LCM |
|---|---|
| 58 and 116 | 116 |
| 38 and 103 | 3914 |
| 112 and 18 | 1008 |
| 173 and 107 | 18511 |
| 82 and 156 | 6396 |