| 2 | 25 | 50 | 100 |
| 5 | 25 | 25 | 50 |
| 5 | 5 | 5 | 10 |
| 1 | 1 | 2 |
LCM = 2 x 5 x 5 x 1 x 1 x 2 = 100
Find the smallest number which can divide at least 2 input numbers.
Candidate dividers are: (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47)
| Let's try with 2 | |
|---|---|
| Is 25 divisible by 2 | No |
| Is 50 divisible by 2 | Yes |
| Is 100 divisible by 2 | Yes |
2 numbers {50, 100} are divisable by 2.Therefore 2 is our divisor.
Divide the input numbers which are divisible by our selected divisor 2.
| 2 | 25 | 50 | 100 |
| 25 | 25 | 50 |
Find the smallest number which can divide at least 2 input numbers.
Candidate dividers are: (2, 3, 5, 7, 11, 13, 17, 19, 23)
| Let's try with 2 | |
|---|---|
| Is 25 divisible by 2 | No |
| Is 25 divisible by 2 | No |
| Is 50 divisible by 2 | Yes |
Only one numbers {50} is divisable by 2.Therefore 2 is not our divisor.
| Let's try with 3 | |
|---|---|
| Is 25 divisible by 3 | No |
| Is 25 divisible by 3 | No |
| Is 50 divisible by 3 | No |
No number is divisable by 3.Therefore 3 is not our divisor.
| Let's try with 5 | |
|---|---|
| Is 25 divisible by 5 | Yes |
| Is 25 divisible by 5 | Yes |
| Is 50 divisible by 5 | Yes |
3 numbers {25, 25, 50} are divisable by 5.Therefore 5 is our divisor.
Divide the input numbers which are divisible by our selected divisor 5.
| 2 | 25 | 50 | 100 |
| 5 | 25 | 25 | 50 |
| 5 | 5 | 10 |
Find the smallest number which can divide at least 2 input numbers.
Candidate dividers are: (2, 3, 5)
| Let's try with 2 | |
|---|---|
| Is 5 divisible by 2 | No |
| Is 5 divisible by 2 | No |
| Is 10 divisible by 2 | Yes |
Only one numbers {10} is divisable by 2.Therefore 2 is not our divisor.
| Let's try with 3 | |
|---|---|
| Is 5 divisible by 3 | No |
| Is 5 divisible by 3 | No |
| Is 10 divisible by 3 | No |
No number is divisable by 3.Therefore 3 is not our divisor.
| Let's try with 5 | |
|---|---|
| Is 5 divisible by 5 | Yes |
| Is 5 divisible by 5 | Yes |
| Is 10 divisible by 5 | Yes |
3 numbers {5, 5, 10} are divisable by 5.Therefore 5 is our divisor.
Divide the input numbers which are divisible by our selected divisor 5.
| 2 | 25 | 50 | 100 |
| 5 | 25 | 25 | 50 |
| 5 | 5 | 5 | 10 |
| 1 | 1 | 2 |
Find the smallest number which can divide at least 2 input numbers.
Candidate dividers are: ()
No divisor found. We should calculate LCM Now.
| 2 | 25 | 50 | 100 |
| 5 | 25 | 25 | 50 |
| 5 | 5 | 5 | 10 |
| 1 | 1 | 2 |
Multiply divisors (2, 5, 5) and remaining numbers (1, 1, 2) to get the lcm.
LCM = 2 x 5 x 5 x 1 x 1 x 2 = 100