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.

Ask a New Question or answer this question.

Similar Questions

Let P(x) be a nonconstant polynomial, where all the coefficients are nonnegative integers. Prove that there exist infinitely
1. 4 answers
The product of two consecutive positive integers is added to the larger of the two integers. Prove that the result is always a
1. 4 answers
the non-decreasing sequence of odd integers {a1, a2, a3, . . .} = {1,3,3,3,5,5,5,5,5,...} each positive odd integer k appears k
1. 1 answer
Which statement is true about the relationships between the number sets?(1 point)Responses Whole numbers include all positive
1. 5 answers

more similar questions