Free LCM and GCD (HCF) calculator. Find Least Common Multiple and Greatest Common Divisor of multiple numbers with step-by-step solution. Fast, accurate mathematical calculators that show step-by-step working. TekPulse's LCM & GCD Calculator is completely free — no signup, no ads in results, and no data stored on our servers.
GCD(a,b) via Euclidean algorithm (repeated remainder) | LCM(a,b) = |a × b| ÷ GCD(a,b)
The Euclidean algorithm computes GCD by repeatedly replacing the pair (a, b) with (b, a mod b) until the remainder is zero — the last non-zero value is the GCD. For more than two numbers, GCD and LCM are computed pairwise/cumulatively across the list. LCM is then derived from the identity that the product of two numbers equals the product of their GCD and LCM. The tool also shows the prime factorization of each number as a cross-check.
Example: GCD(48, 180): 180 mod 48 = 36 → 48 mod 36 = 12 → 36 mod 12 = 0 → GCD = 12. LCM(48,180) = (48 × 180) ÷ 12 = 720.
Help others discover this free tool. Share it or embed it on your website.
Free to embed with attribution link to tekpulse.in
Was this tool helpful?