Q: What is the GCD for 240 and 900?

Write your answer...

Submit

Related questions

GCD: 20

It is: 65520

It is: 240

The GCD is: 900

The Greatest Common Divisor (GCD) for 180 240 is 60.

The GCF is 20.

The Least Common Multiple (LCM) for 120 240 is 240The Greatest Common Divisor (GCD) for 120 240 is 120

The GCF is 18.

find the G.C.D of 300,450,600 and 900

The Least Common Multiple (LCM) for 240 900 is 3,600.

The Greatest Common Divisor (GCD) for 40 900 is 20.

The Greatest Common Divisor/Denominator is 20

240 120,2 60,2,2 30,2,2,2 15,2,2,2,2 5,3,2,2,2,2 900 450,2 225,2,2 75,3,2,2 25,3,3,2,2 5,5,3,3,2,2

900 450,2 225,2,2 75,3,2,2 25,3,3,2,2 5,5,3,3,2,2 240 120,2 60,2,2 30,2,2,2 15,2,2,2,2 5,3,2,2,2,2

60

The GCF is 60.

48 http://www57.wolframalpha.com/input/?i=GCD%28240+%2C+672%29

gcd

GCD(54, 8) = 2GCD(54, 8) = 2GCD(54, 8) = 2GCD(54, 8) = 2

GCD(14, 34) = 2GCD(14, 34) = 2GCD(14, 34) = 2GCD(14, 34) = 2

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

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.

There are two main methods:Euclid's methodChoose one of the numbers to be the dividend of a division and the other to be the divisor.Perform the divisionIgnore the quotient and keep the remainderIf the remainder is zero, the last divisor is the GCDReplace the dividend by the divisorReplace the divisor by the last remainderRepeat from step 2.It doesn't matter which number is the dividend and which is the divisor of the first division, but if the larger is chosen as the divisor, the first run through the steps above will swap the two over so that the larger becomes the dividend and the smaller the divisor - it is better to choose the larger as the dividend in the first place. Prime factorisationExpress the numbers in their prime factorisations in power format. Multiply the common primes to their lowest power together to get the GCD.The first is limited to two numbers, but the latter can be used to find the gcd of any number of numbers.Examples:GCD of 500 and 240:Euclid's method:500 ÷ 240 = 2 r 20 240 ÷ 20 = 6 r 0gcd = 20Prime factorisation:500 = 22 x 53 240 = 24 x 3 x 5gcd = 22 x 5 = 20

240 = 2 * 2 * 2 * 2 * 3 * 5 = 24 * 3 * 5900 = 2 * 2 * 3 * 3 * 5 * 5 = 22 * 32 * 52

GCD: 75