LCM( 1766, 16402608 ) = 16402608
Step 1 : Write the given numbers in a horizontal line.
1766 | 16402608 |
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 | 1766 | 16402608 |
883 | 8201304 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
2 | 1766 | 16402608 |
2 | 883 | 8201304 |
2 | 883 | 4100652 |
2 | 883 | 2050326 |
3 | 883 | 1025163 |
3 | 883 | 341721 |
3 | 883 | 113907 |
43 | 883 | 37969 |
883 | 883 | 883 |
1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1766, 16402608 ) = 2 · 2 · 2 · 2 · 3 · 3 · 3 · 43 · 883 = 16402608 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.