Greatest common divisor

Features of the greatest commno divisor

• GCD(a,a) = a - idempotent
• GCD(a,b) = GCD(b,a) - commutativeness
• GCD(a,GCD(b,c)) = GCD(GCD(a,b),c) - associativity
• GCD(a,b) . lcm(a,b) = a . b (lcm is least common multiple)

Instructions:

The greatest common divisor (labeled as GCD) of the two integers is the largest number that divides both integers completely, ie. the largest number by which both integers are divisible.

For example: GCD(48,90) = 6