Let $p$ be a prime number. If $a \equiv b$ (mod $p$), does that imply $a^{p^n} \equiv b^{p^n}$ (mod $p^n$)?

I think the answer will be yes, and I suspect that the way of proving it will involve writing $a^{p^n}-b^{p^n}$ as a multiple of $(a-b)^n$.

I also noticed that $n<p^n$, and I'm wondering if this will make the proof easier or not.


$a=b+kp$ where $k$ is an integer


$\equiv b^{p^n}\pmod{p^{n+1}}$

  • $\begingroup$ So simple yet so useful! Thank you! $\endgroup$ – Pascal's Wager Nov 8 '18 at 23:45

There is following theorem (Lifting The Exponent Lemma). We will use notation $p^{\alpha}||n$ for positive integer $n$, nonnegative integer $\alpha$ and prime $p$, which equivalent to $p^{\alpha}|n$ and $p^{\alpha+1}\nmid n$.

Theorem. Let $a,b,n$ be a positive integers and $p^{\alpha}||a-b$, $p^{\beta}||n$. Then:

  • if $p>2$ and $\alpha\geq 1$ then $p^{\alpha+\beta}||a^n-b^n$;
  • if $p=2$ and $\alpha\geq 2$ then $2^{\alpha+\beta}||a^n-b^n$.

Note. If $p=2$ and $\alpha=1$ then $2^{\beta+1}||a^n-b^n$.

Your statement is a consequence of this theorem.

Some links about LTE lemma:

What can I do with the lifting the exponent lemma?



Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

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