GCD: 14
The GCD of 14, 42 is 14.
GCD(42, 65) = 1
GCD: 21
GCD: 14
The Greatest Common Divisor (GCD) for 42 56 is 14.
Greatest Common Divisor (GCD) for 30 42 is 6.
GCD: 6
GCD(5, 28) = 140
The GCD of 18, 28 is 2.
since 14 = 14 x 1 and 56 = 14 x 4 the answer is 14, since it divides evenly into both and clearly nothing larger will.There is a clever algorithm that can help you work this out in the general case:GCD(14, 56) = GCD(14, 56 - 14) = GCD(14, 42)This step (subtract the smaller from the larger) relies on the fact that any number that divides both 14 and 56 also divides 56 - 14.Repeat this:GCD(14, 42) = GCD(14, 42 - 14) = GCD(14, 28)GCD(14, 28) = GCD(14, 28 - 14) = GCD(14, 14)which is clearly 14.This is called Euclid's Algorithm.
The greatest number that both 42 and 56 are divisible by is their greatest common divisor (GCD). To find the GCD, we can list the factors of each number: the factors of 42 are 1, 2, 3, 6, 7, 14, 21, and 42; the factors of 56 are 1, 2, 4, 7, 8, 14, 28, and 56. The largest common factor is 14, so the GCD of 42 and 56 is 14.
Greatest Common Divisor (GCD) for 8 28 is 4.