LCM( 480, 336, 512 ) = 53760
Step 1 : Write the given numbers in a horizontal line.
480 | 336 | 512 |
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 | 480 | 336 | 512 |
240 | 168 | 256 |
Step 3 : Continue dividing by prime numbers till we get 1 in all columns.
2 | 480 | 336 | 512 |
2 | 240 | 168 | 256 |
2 | 120 | 84 | 128 |
2 | 60 | 42 | 64 |
2 | 30 | 21 | 32 |
2 | 15 | 21 | 16 |
2 | 15 | 21 | 8 |
2 | 15 | 21 | 4 |
2 | 15 | 21 | 2 |
3 | 15 | 21 | 1 |
5 | 5 | 7 | 1 |
7 | 1 | 7 | 1 |
1 | 1 | 1 |
Step 4 : Multiply numbers in first column to get LCM.
LCM( 480, 336, 512 ) = 2 · 2 · 2 · 2 · 2 · 2 · 2 · 2 · 2 · 3 · 5 · 7 = 53760 .
This solution can be visualized using a Venn diagram.
The LCM is equal to the product of all the numbers on the diagram.