Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose $a,b\in\mathbb{Z}$. Then $a = \operatorname{lcm}(a,b)$ if and only if $b\mid a$

Unsure of how to approach this problem.

share|cite|improve this question

$\newcommand{\lcm}{\operatorname{lcm}}$ By definition $\lcm(a,b)=bk$ for some $k\in\Bbb Z$. So if $bk=a$ then $b\mid a$ by definition.

Conversely, $b\mid a$ implies $\lcm(a,b)\le a$ and $a\mid a$ implies $\lcm(a,b)\ge a$.

share|cite|improve this answer

Hint $\,\ b\mid a \iff a,b\mid a \iff {\rm lcm}(a,b)\mid a\iff {\rm lcm}(a,b) = a$

share|cite|improve this answer

As shown in this answer, $$ \lcm(a,b)\gcd(a,b)=ab $$ Thus, we have that $$ \gcd(a,b)=b $$ This means that $b$ is a divisor of $a$; i.e. $b\mid a$.

share|cite|improve this answer
I see that, nowadays, Bezout is deleted. This is much healthier! – Bill Dubuque Jul 17 '14 at 23:44
@BillDubuque: ah, but I do use properties of Euclidean Division in the cited answer; very similar to your Bezout. – robjohn Jul 17 '14 at 23:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.