Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Find all integers $k>2$ such that $5\equiv k \bmod k^2$.

I ended up with quardratic formula. Is it right?

share|cite|improve this question


so $$k|k-5$$



And since we stipulate $k>2$, we only need check $k=5$.

share|cite|improve this answer

If $k>5$, then $k^2 > k - 5 > 0$, so $k-5$ can't be divisible by $k^2$; so the proposition is false. Since you were asked for integers $>2$, the only possibilities are 3, 4 and 5. A quick check reveals that 3 and 4 don't work, but 5 does; so the only possible value is $k=5$.

share|cite|improve this answer
Why $k>5$ while it's true for $k>2$? – Gigili Jan 30 '12 at 7:12
Because I needed $k>5$ for the main part of the proof - if I don't know $k-5>0$ I can't show that it's not a multiple of $k^2$. That's why I dealt with $k=3,4,5$ as special cases. – user22805 Jan 30 '12 at 8:11
@Gigili: Because David wants to eliminate all values of $k$ greater than $5$ by showing that they can’t possibly be solutions to the congruence. Once they’ve been eliminated, he can go on to consider the other possible values of $k$ individually. Since there are only three of them, $3,4$, and $5$, this is easy. – Brian M. Scott Jan 30 '12 at 9:20

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.