LCM( 1165, 290057040 ) = 290057040
Step 1 : Write the given numbers in a horizontal line.
1165 | 290057040 |
Step 2 : Divide the given numbers by smallest prime number. In this example we can divide by 2.
(if any number is not divisible by 2, write it down unchanged)
2 | 1165 | 290057040 |
1165 | 145028520 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
2 | 1165 | 290057040 |
2 | 1165 | 145028520 |
2 | 1165 | 72514260 |
2 | 1165 | 36257130 |
3 | 1165 | 18128565 |
3 | 1165 | 6042855 |
5 | 1165 | 2014285 |
7 | 233 | 402857 |
13 | 233 | 57551 |
19 | 233 | 4427 |
233 | 233 | 233 |
1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1165, 290057040 ) = 2 · 2 · 2 · 2 · 3 · 3 · 5 · 7 · 13 · 19 · 233 = 290057040 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.