Ask a New Question

Asked by Christian

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.
5 years ago

Answers

Answered by oobleck
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.
5 years ago

Related Questions

Prove that sin(n+1)A-sin(n-1)A/cos(n+1)A+2cosnA+cos(n-1)A = tanA/2 prove that any odd positive integer of 8q+1,where q is any integer? Prove that |x+y+z| is less than or equal to |x|+|y|+|z|. Please try to show working and explain Prove that: x - tan^-1(x) = tan^-1{(tanx - x)/(xtanx + 1)} plz help Prove that x=2 in 3^x + 4^x = 5^x? prove that for any positive integer n, the value of 3^2n+2 - 8n-9 is divisible by 64 Write positive a positive paragraph about not allowing toxic people coming in your way.m and pushin... Prove that the sum of 3/4 and sqrt 10 is irrational. Show your work, and in 2 sentences, explain why... Prove that the sum of 3/4 in radical 10 is irrational show your work Positive Impact: One positive impact of synthetic fertilizers on society is their ability to provide...
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use