Greatest Common Factor
GCF/GCD of any list of integers — plus LCM.
Numbers
Result
Algorithm
Euclidean
gcd(a, b) = gcd(b, a mod b)
Relation
lcm(a, b) = |a·b| / gcd(a, b)
Last updated:
GCF/GCD of any list of integers — plus LCM.
Last updated: