0
Since 3 divides both 240 and 285, it is tempting to start with 3 as a common divisor of both 240 and 285. However, since 3 and 5 both divide 285, and 30 divides 240, we probably should start with 15. Fifteen divides into 240 16 times with no remainder. Fifteen also divides into 285 19 times. Since 16 and 19 are relatively prime to each other, 15 is the greatest common divisor of 240 and 285.
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What is gcd of 240 and 6552?
It is: 65520
What is the GCD of 16 and 24 and 30?
It is: 240
What is the LCM of 240 and 285?
The least common multiple (LCM) of 240 and 285 is 4560.
What is the GCD for 240 and 900?
The greatest common factor of 240 and 900 is 60.
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 gcd of 240 and 6552?
It is: 65520
What is the LCM of 240 and 285?
The least common multiple (LCM) of 240 and 285 is 4560.
What is the GCD of 16 and 24 and 30?
It is: 240
What is the GCD for 240 and 900?
The greatest common factor of 240 and 900 is 60.
What is the greatest common divisor of 180 and 240?
The Greatest Common Divisor (GCD) for 180 240 is 60.
What is the least common multiple of 240 and 285?
The LCM is: 4,560
What is the greatest common divisor of 240 and 285?
The GCF is 15.
What is the least common multiple and greastest common divisor of 120 and 240?
The Least Common Multiple (LCM) for 120 240 is 240The Greatest Common Divisor (GCD) for 120 240 is 120
Find the greatest common factor of 240 and 672?
48 http://www57.wolframalpha.com/input/?i=GCD%28240+%2C+672%29
How many minutes are there in 4hours and 3 quarter?
(60 × 4) + 45 = 285 minutes Method: There are 60 minutes in 1 hour: 60 minutes x 4 hours equals 240 minutes. There are 45 minutes in 3 quarters of 1 hour. Therefore, add 240 and 45 which equals 285 minutes.
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.
