Study guides

☆☆

Q: If the GCD of two number is 16 and product of the number is 3584 find the LCM?

Write your answer...

Submit

Still have questions?

Related questions

if the gcd and lcm are given and one of the numbers are also given,multiply the gcd and lcm and divide them by the given number

Just write a function that finds gcd of two numbers, then you are almost done: int gcd (int a, int b); int gcd3 (int a, int b, int c) { return gcd (gcd (a, b), c); }

800

The greatest common denominator (GCD) refers to a denominator that is COMMON to two or more numbers. You have only one number in the question! The greatest denominator of any number is itself.

The greatest common denominator (GCD) refers to a denominator that is COMMON to two or more numbers. You have only one number in the question! The greatest denominator of any number is itself.

Divide the larger number by the smaller one and then replace the larger by the remainder. Repeat until a remainder is 0 or both numbers are 1. In the first case, the non-zero number is the GCD, in the other case, the numbers are coprme: GCD = 1. Thus GCD(85, 102) 102 = 1*85 + R = 17 so GCD(85, 17) 85 = 5*17 + R = 0 so GCD(0, 17) therefore 17. = GCD[85, (102-85)] = GCD(85, 17)

47 is a prime number and 35 is smaller that 47 so their gcd is 1. Therefore their lcm is the product 35 * 47 which is 1645

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.

use slide

int gcd(int x,int y) { if(y==0) return x; return gcd(y,x%y); }

I think you mean either the GCD or the LCM? Not sure which since they are relatively prime, the LCM will the the product of the three numbers and the GCD is 1

A calculator is not the thing you need to find the greatest common divisor. There are several online sites that use JavaScript to help you. Google GCD.

People also asked