Reference: gcd
gcd(m, n) returns the greatest common divisor of the integers m and n, that is the greatest number that divides both m and n. Example: gcd(8, 20) = 4. If gcd(m, n) = 0, m and n are said to be coprime, or relatively prime.
gcd(m, n) returns the greatest common divisor of the integers m and n, that is the greatest number that divides both m and n. Example: gcd(8, 20) = 4. If gcd(m, n) = 0, m and n are said to be coprime, or relatively prime.