GCD Calculator

    Find the greatest common divisor

    Formula

    GCD via Euclidean algorithm

    Repeatedly divide larger by smaller, take remainder until 0.

    Examples

    GCD(48, 36)

    = 12

    Frequently Asked Questions

    About GCD

    Find the greatest common divisor of two numbers.