How do you justify the GCD?

Anonymous

∙ 10y ago

Updated: 8/21/2019

GCD is simply a mathematical operator. You can define any operator on one or more inputs. That is their definition - they do not require justification.

Wiki User

∙ 10y ago

What else can I help you with?

What is the gcd of 125 and 225?

GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25

What is Euclid's Algorithm?

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.

What is the GCD of 375 and 225?

GCD: 75

What is the GCD of 360 and 364?

GCD: 4

What is the GCD for 5767 and 4453?

GCD: 73

What is the GCD of 13 and 75?

GCD: 1

What is the gcd of 33 and 70?

GCD: 1

What is the gcd of 1296 and 1944?

GCD: 648

What is the gcd of 18 and 21?

GCD: 3

What is the gcd of 42 and 63?

GCD: 21

What is the gcd of 18 and 32?

GCD: 2

What is then GCD of 20 and 65?

GCD: 5