Ask a New Question

Prove that for all positive integers “a” and “b”, GCD(a,b) = LCM(a,b) iff a = b. Can someone explain me how to prove this? I'm confused. This is for Discrete Math.

1 answer

well, you can start off by noting that
LCM(a,b) = ab / GCD(a,b)
see where that takes you.

Also, see what happens if a=b.

Similar Questions

1)prove that if x is rational and x not equal to 0, then 1/x is rational.2) prove that there is a positive integers that equals
1. 1 answer
Let P(x) be a nonconstant polynomial, where all the coefficients are nonnegative integers. Prove that there exist infinitely
1. 4 answers
Pick 2 consecutive, positive integers and call them a and b. Prove that a/2 + b/2 >/= 1.what does it mean by consecutive and
1. 1 answer
If P(e)gives the profit from selling e number of eggs, which of the following is the most appropriate domain for the function?
1. 1 answer

more similar questions