GCD and LCM

Greatest Common Denominator and Least Common Multiple

GCD (Greatest Common Denominator)

How to find the greatest common denominator (gcd) of two numbers quickly?

Euclid's method of finding GCD

Time Complexity: $O(log(min(a, b)))$

Space Complexity: $O(1)$

int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

Euclid's algorithm works because it leverages two fundamental properties of the greatest common divisor (GCD):

• If dis a divisor of two numbers aand b, for a >= b, then dis also a divisor of a−kb for any integer k.

  • This is true because d is still a factor of a and b , which can be taken out from each expression

• This implies that the GCD of aand bis the same as the GCD of band $a\mod b$

LCM (Least Common Multiple)

To find the LCM, there is a math formula that relates LCM to GCD, which makes calculation easy.

$$LCM(a, b) = \frac {|a\times b|}{ GCD(a, b)}$$

int lcm(int a, int b) {
    return (a / gcd(a, b)) * b;
}

Here is a great proof by ChatGPT that explains why:

ChatGPT - LCM GCD Formula ProofChatGPT