11340 45*252 = 11340 20*567 = 11340 42*270 = 11340
GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25
GCD: 20
GCD: 73
GCD: 21
A mathemtical trick is to note that all three numbers are divisible by '9'. How do we known this?? Because the sum of the digits in each number adds to '9'. Hence 189, 567, 2187) 189 ; 1 + 8 + 9 = 18 = 1 + 8 = 9 567 ; 5 + 6 + 7 = 18 = 1 + 8 = 9 2187 [ 2 + 1 + 8 + 7 = 18 = 1 + 8 = 9 189/9 = 21 567/ 9 = 63 2187/9 = 243 All three sub-answer will divide by '3' Hence 7,9,81 ( There are NO common factors ) Hence 9 x 3 = 27 is the GCF. NB THis mathemtical 'trick' can only be done with '9'. !!!!!
11340 45*252 = 11340 20*567 = 11340 42*270 = 11340
The Greatest Common Divisor/Denominator is 9
6
GCD: 27 LCM: 270
270=2x33x5 360=23x32x5 so gcd(270,360) = 2x32x5
GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25 GCD(125, 225) = 25
1 and 567 are a factor pair of 567 since 1 x 567= 567 3 and 189 are a factor pair of 567 since 3 x 189= 567 7 and 81 are a factor pair of 567 since 7 x 81= 567 9 and 63 are a factor pair of 567 since 9 x 63= 567 21 and 27 are a factor pair of 567 since 21 x 27= 567
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.
The Greatest Common Divisor (GCD) for 540 567 is 27
443 + 567 = 1,010
GCD: 75