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

Here's what I've done. I don't think I going the right way.

If $x \equiv 1 \pmod {m^k}$, then $x^m \equiv 1^m \equiv 1 \pmod{m^k}$.

$\Rightarrow x^m = 1^m + m^kn$, for some $n \in \Bbb Z$.

$\Rightarrow mx^m = m + m^{k+1}n$.

$\Rightarrow mx^m - m + 1 = 1 + m^{k+1}n$.

$\Rightarrow m(x^m - 1) + 1 = 1 + m^{k+1}n$.

...And I'm lost. Doesn't look like this is going anywhere.

share|cite|improve this question

Suppose that $x\equiv 1 \pmod{m^k}$. Then there exists $n\in\mathbb{Z}$ such that $$x = 1 + nm^k$$ Taking the previous equation to the $m$th power, we have $$x^m = (1+nm^k)^m = \sum_{r=0}^m\binom{m}{r}n^rm^{kr}$$ Where the latter expansion is the binomial theorem. What happens to the terms of the summation when you take the equation mod $m^{k+1}$?

share|cite|improve this answer
I'm assuming the terms cancel leaving $m^{k+1} + 1$? Not quite understanding. – Tejen Shrestha Feb 21 '13 at 0:46
Well, sort of. What is the largest power of $m$ dividing each term of the sum if $r \ge 2$? Then what about $r=1$ and $r=0$? – EuYu Feb 21 '13 at 0:49

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.