LCM( 1766, 542048976 ) = 542048976
Step 1 : Write the given numbers in a horizontal line.
| 1766 | 542048976 |
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 | 542048976 |
| 883 | 271024488 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
| 2 | 1766 | 542048976 |
| 2 | 883 | 271024488 |
| 2 | 883 | 135512244 |
| 2 | 883 | 67756122 |
| 3 | 883 | 33878061 |
| 3 | 883 | 11292687 |
| 3 | 883 | 3764229 |
| 7 | 883 | 1254743 |
| 7 | 883 | 179249 |
| 29 | 883 | 25607 |
| 883 | 883 | 883 |
| 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 1766, 542048976 ) = 2 · 2 · 2 · 2 · 3 · 3 · 3 · 7 · 7 · 29 · 883 = 542048976 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.