GCD and LCM Calculator

    Find the greatest common divisor and least common multiple for two to six nonzero integers, with Euclidean algorithm steps and prime factorization.

    GCD and LCM with steps

    English search intent for this page combines GCD, GCF, HCF, and LCM terminology. Users usually want both answers, a quick check, and enough steps to understand the Euclidean algorithm and prime-factor method.

    For two nonzero integers, GCD and LCM are tied through the product of the two numbers.

    1. Enter two to six nonzero integers.
    2. Use the Euclidean algorithm steps to verify the GCD.
    3. Use prime factorization to see why the LCM includes the highest exponent of each prime.

    GCD, GCF, HCF, and LCM terminology

    TermMeaning
    GCDGreatest common divisor
    GCFGreatest common factor, the same idea as GCD for positive integers
    HCFHighest common factor, common in UK-style wording
    LCMLeast common multiple
    For more than two numbers, the calculator combines values pair by pair from left to right.

    Frequently Asked Questions

    Sources and References

    Calculations are based on the listed reference sources. Links open in a new tab.

    Updated:

    Related Tools