GCF & LCM
Find the greatest common factor and least common multiple.
How this works
Euclid’s algorithm finds the GCF; LCM = a × b ÷ GCF.
Example
Using the example inputs, greatest common factor is 12.
- First integer
- 24
- Second integer
- 36
- Greatest common factor
- 12
Scope and assumptions
Positive whole-number inputs only within the displayed range. Lists positive integer divisors and the greatest common divisor / least common multiple; it is not a symbolic factorization tool.