Mathematics · pattern A, Numeric fields
Enter two numbers for their lowest common multiple, with the greatest common factor and the Euclidean algorithm steps that produce it.
LCM(a, b) = |ab| ÷ GCF(a, b)
Computing the GCF first is far quicker than listing multiples, and the relationship between the two is exact.
36
For 12 and 18: GCF 6, LCM 36.
112 = 0 × 18 + 12
Euclid’s algorithm: replace the pair with (divisor, remainder)
218 = 1 × 12 + 6
Euclid’s algorithm: replace the pair with (divisor, remainder)
312 = 2 × 6 + 0
Euclid’s algorithm: replace the pair with (divisor, remainder)
4GCF = 6
the last non-zero remainder is the greatest common factor
Every prime appears in the GCF at its lowest power and in the LCM at its highest, so the two together account for exactly the primes in both numbers. That is why ab = GCF × LCM always holds, and why finding one immediately gives the other.
If the number is not the part you are stuck on, that is what the service is for — a specialist who explains the working, not just the answer.
Arithmetic runs in double-precision floating point, so results beyond about fifteen significant figures are not exact. Where a question wants an exact fraction or surd, keep the exact form rather than a decimal.