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

The statement in the title seems obviously true to me, but I can't quite prove it. Any suggestions would be appreciated.

share|cite|improve this question

Hint $\ $ By Euclid's Lemma $\rm\ (b,a)=1,\,\ b\:|\:ak\:\Rightarrow\:b\:|\:k\:\Rightarrow\: b \le k < a$

share|cite|improve this answer

If $ka$ is a multiple of $b, ka=bc$ for some integer $c$.

$\implies c=\frac{ka}{b} \implies b\mid k$ as $(a,b)=1$

But as $a<b$ and $k<a\implies k<b, b$ can not divide $k$.

share|cite|improve this answer
I also just realized that my statement follows from the fact lcm(a, b) = ab. – DDD Oct 9 '12 at 6:02
@DDD, ya, so $k$ can not be $<b$. – lab bhattacharjee Oct 9 '12 at 6:36

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.