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