Study guides

☆☆

Q: The product of 2 numbers is 1600 and their gcd is 2 what is the LCM?

Write your answer...

Submit

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

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

(start) [calculate gcd] [calculate product] [divide] (stop)

If you have the gcd or the LCM of two numbers, call them a and b, you can use the relationship that gcd(a,b) = (a multiplied by b) divided by LCM (a,b) where LCM or gcd (a,b) means the LCM or a and b. This means the gcd multiplied by the LCM is the same as the product of two numbers. Let's assume you have neither. There are several ways to do this. One way to approach both problems at once is to factor each number into primes. You can use these prime factorizations to find both the LCM and gcd To compute the Greatest common divisor, list the common prime factors and raise each to the least multiplicities that occurs among the several whole numbers. To compute the least common multiple, list all prime factors and raise each to the greatest multiplicities that occurs among the several whole numbers.

If we multiply the gcd and the LCM, we get the numbers.Call the numbers a and b. So 16(LCM)=ab3584=ab let's all the LCM, x 16x=a(3584/a)using the information above.x= 1/16(3584)or x=224 So the LCM is 224 we can just say the (gcd)LCM=ab=3584, so just divide 3584 by 16.

You need at least two numbers to find either of those.

GCD = 39 LCM = 1,755

no

If you have two numbers m and n and their gcd (or gcf), g then their LCM = m*n/g so LCM = 72*252/36 = 2*252 = 504.

The GCD is: 1The LCM is: 780

The GCD is 125 The LCM is 546,875

First, calculate the greatest common divisor (gcd) of both numbers. The following recursive function achieves that: int gcd (int a, int b) { if (!a || !b) return 0; if (a==b) return a; // base case if (a>b) return gcd(a-b, b); return gcd(a, b-a); } Now we can compute the lcm from the gcd: int lcm (int a, int b) { return (a / gcd(a, b)) * b; }

The following function will return the GCD or LCM of two arguments (x and y) depending on the value of the fct argument (GCD or LCM). enum FUNC {GCD, LCM}; int gcd_or_lcm(FUNC fct, int x, int y) { int result = 0; switch (fct) { case (GCD): result = gcd (x, y); break; case (LCM): result = lcm (x, y); break; } return result; }

You can just use the GCD of any two of your numbers and find the GCD of it with your third number. Same for LCM. public class Lcmgcd { private static int gcd(int a, int b) { return (b == 0) ? a: gcd(b, a%b); } private static int lcm(int a, int b) { return a * b / gcd(a, b); } public static void main(String[] args) { int[] n = {12, 16, 28}; System.out.println("GCD: " + gcd(n[2], gcd(n[0], n[1])) + "\tLCM: " + lcm(n[1],lcm(n[2],n[0]))); } }

Only if they're the same number. The LCM and GCF of 10 and 10 is 10.

GCD: 1 LCM: 360

For this you will need a couple of helper algorithms. The first is the GCD (greatest common divisor) which is expressed as follows:procedure GCD (a, b) isinput: natural numbers a and bwhile ab doif a>blet a be a-belselet b be b-aend ifend whilereturn aThe second algorithm is the LCM (least common multiple) of two numbers:procedure LCM (a, b) isinput: natural numbers a and b return (a*b) / GCD (a, b)Now that you can calculate the GCD and LCM of any two natural numbers, you can calculate the LCM of any three natural numbers as follows:procedure LCM3 (a, b, c) isinput: natural numbers a, b and c return LCM (LCM (a, b), c)Note that the LCM of three numbers first calculates the LCM of two of those numbers (a and b) and then calculates the LCM of that result along with the third number (c). That is, if the three numbers were 8, 9 and 21, the LCM of 8 and 9 is 72 and the LCM of 72 and 21 is 504. Thus the LCM of 8, 9 and 21 is 504.

Answer: 42 An online GCD/LCM calculator can be found in the "related links" section, below.

GCD(40, 4900) = 20 LCM(40, 4900) = 9800

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

Short answer: Yes. Long answer: Explanation: lcm means least common multiple, gcd means greatest common divisor, |a| means the absolute of a, a / b means a divided by b, a * b means a multiplied by b Premise: Let a and b be a natural numbers, i.e. a ⋲ IN, b ⋲ IN. 1: It is known that lcm(a, b) = (|a| * |b|) / gcd(a, b) 2: Also the gcd of two numbers is at least 1, or in math: ∀ a ⋲ IN: gcd(a, b) >= 1. 3: From 1 and 2 we can conclude: lcm(a, b) = |a| * |b| / gcd(a, b) <= |a| * |b| 4: From 3 and the premise we can conclude (because ∀ a ⋲ IN: |a| = a): lcm(a, b) <= a * b 5: Now the product of two natural numbers (like a and b) is a natural number as well, or in math: ∀ a ⋲ IN, b ⋲ IN: a * b ⋲ IN 6: From 2 and 5 we can finally conclude, that: ∀ a ⋲ IN, b ⋲ IN ∃ c ⋲ IN: lcm(a, b) <= c

The GCF is 33.The LCM is 1485.

GCD: 1 LCM: 99

GCD: 1 LCM: 525

The LCM is 144. The GCF is 6.