LCM & GCF Formulas
GCF using Euclidean algorithm: gcd(a, b) = gcd(b, a mod b)
LCM(a, b) = |a × b| / GCF(a, b)
For two numbers: LCM × GCF = a × b
LCM & GCF Calculator
Enter numbers separated by commas to find their LCM and GCF.
LCM
0
GCF (GCD)
0
LCM × GCF
0
Product of Numbers
0
Prime Factorizations
Step-by-Step (Euclidean Algorithm)
Was this calculator helpful?
Thanks for your feedback!
What would make it better?