LCM( 1766, 878493168 ) = 878493168
Step 1 : Write the given numbers in a horizontal line.
1766 | 878493168 |
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 | 878493168 |
883 | 439246584 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
2 | 1766 | 878493168 |
2 | 883 | 439246584 |
2 | 883 | 219623292 |
2 | 883 | 109811646 |
3 | 883 | 54905823 |
3 | 883 | 18301941 |
3 | 883 | 6100647 |
7 | 883 | 2033549 |
7 | 883 | 290507 |
47 | 883 | 41501 |
883 | 883 | 883 |
1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1766, 878493168 ) = 2 · 2 · 2 · 2 · 3 · 3 · 3 · 7 · 7 · 47 · 883 = 878493168 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.