Prove that gcd(a,b) divides lcm[a,b].
Follow Math Help Forum on Facebook and Google+
Hello, $\displaystyle lcm(a, b) = \frac{|a \times b|}{gcd(a, b)}$. Can you conclude now ?
Originally Posted by tarheelborn Prove that gcd(a,b) divides lcm[a,b]. We know that $\displaystyle a\mid [a,b]$ and $\displaystyle (a,b)\mid a$ and so $\displaystyle (a,b)\mid [a,b]$ Originally Posted by Bacterius Hello, $\displaystyle lcm(a, b) = \frac{|a \times b|}{gcd(a, b)}$. Can you conclude now ? That is kind of taken to not be known.
That is kind of taken to not be known. Sorry, English not being my first language, I don't grasp the meaning of this sentence
Originally Posted by Bacterius Sorry, English not being my first language, I don't grasp the meaning of this sentence It's cool. Clearly the problem is trivial if that fact is known, so it would probably be assumed the OP isn't aware of that fact.
Oh, right. Well, I think you are right, and I actually think that I ruined everything in the sense that this problem was probably given for him to work out this formula ... that will teach me !
View Tag Cloud