- First number
- 12
- Second number
- 18
6
Open with these values6
Result: 6The answer is the greatest common factor: the largest whole number that divides both inputs without a remainder. Euclid finds it in a handful of divisions — 12 and 18 give 6. The least common multiple follows in one line, |a × b| ÷ gcf, and stands in the table below.
Held fixed: First number 12.
| Second number | Result |
|---|---|
| 0 | 12 |
| 5 | 1 |
| 10 | 2 |
| 15 | 3 |
| 18Your value | 6 |
| 20 | 4 |
| 25 | 1 |
| 30 | 6 |
| 35 | 1 |
6
Open with these values4
Open with these values1
Open with these valuesgcf(a, b) by Euclid; lcm = |a × b| ÷ gcf
| a, b | LCM | GCF |
|---|---|---|
| 0, 5 | 0 | 5 |
| 7, 13 | 91 | 1 |
| 8, 12 | 24 | 4 |
| 9, 9 | 9 | 9 |
| 12, 18 | 36 | 6 |
| -12, 18 | 36 | 6 |
It is the largest whole number that divides both inputs without leaving a remainder. For 12 and 18 that number is 6, because 6 is the biggest value that goes into both.
Replace the larger number with the remainder of dividing it by the smaller, and repeat until the remainder is zero. The last non-zero value is the GCF: 18 mod 12 = 6, then 12 mod 6 = 0, so the answer is 6.
They satisfy lcm(a, b) = |a × b| ÷ gcf(a, b), so once you have the GCF the LCM is one multiplication away. For 12 and 18 that is 12 × 18 ÷ 6 = 36. The table below carries the LCM for every row.
Negative inputs are read as their magnitude, so −12 and 18 give the same 6 as 12 and 18. The greatest common factor is never negative.
The GCF of a number and zero is that number, because every integer divides zero. With both inputs zero the answer here is 0, which is the usual convention; the older calculator showed nothing at all.
Information, not professional advice.
Diese Seite gibt es auch auf Deutsch.
Zu Deutsch wechseln