LCM( 16, 64, 132 ) = 2112
Step 1 : Write the given numbers in a horizontal line.
16 | 64 | 132 |
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 | 16 | 64 | 132 |
8 | 32 | 66 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
2 | 16 | 64 | 132 |
2 | 8 | 32 | 66 |
2 | 4 | 16 | 33 |
2 | 2 | 8 | 33 |
2 | 1 | 4 | 33 |
2 | 1 | 2 | 33 |
3 | 1 | 1 | 33 |
11 | 1 | 1 | 11 |
1 | 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 16, 64, 132 ) = 2 · 2 · 2 · 2 · 2 · 2 · 3 · 11 = 2112 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.