Yep. 6 = 2 * 3 24 = 2 * 2 * 2 * 3 gcd(6,24) = 2 * 3 = 6
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(6, 84) = 6
The GCD of 6, 12 is 6.
The gcd is 3.
6 = 2*3108 = 22*34gcd: 2*3 = 6
GCD: 6
The Greatest Common Divisor (GCD) for 6 8 is 2.
GCD(24, 90) = 6
The GCD of 48, 90 is 6.
GCD(66, 90) = 6
GCD: 3