Greatest Common Divisor (GCD) for 18 45 72 is 9.
GCD: 9
GCD(45, 72) = 9 so the simplest form is (45/9) / (72/9) = 5/8
GCD(27, 72) = 9
The Greatest Common Divisor of 18, 45, 72 is 9.
18 = (3)(3)(2)45 = (3)(3)(5)72 = (3)(3)(2)(2)(2)(3)(3) = 99 is the answer
Greatest Common Divisor (GCD) for 24 56 72 is 8.
The greatest common divisor (GCD) of 45 and 10 is 5.
Euclid's algorithm is a popular algorithm to compute the GCD of two numbers. Algorithm: Gcd(a,b) = Gcd(b, a mod b), where a>=b and Gcd(a,0) = a Say we want to find the GCD of 72 and 105. 105 mod 72 = 33, so GCD(72,105) = GCD(33,72) 72 mod 33 = 6, so GCD(33,72) = GCD(6,33) 33 mod 6 = 3 so GCD(6,33) = GCD(3,6) 6 mod 3 = 0 so GCD(3,6) = GCD(0,3) = 3. So the GCD of 72 and 105 is 3.
GCD(18, 90) = 18
Greatest Common Divisor (GCD) for 45 210 is 15.
Greatest Common Divisor (GCD) for 12 45 is 3.