Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this community
If $a$ and $b$ are not divisible by prime $p$, prove that if $a^p \equiv b^p \pmod p$, then $a \equiv b \pmod p$
I know the answer is related to Fermat's Little Theorem. If $a^{p-1} \equiv 1 \pmod p$, then $a^p \equiv a \pmod p$, but I'm not sure how to apply that to both $a$ and $b$ in the original question.
Just apply Fermat's little theorem twice: $$ a\equiv a^p\equiv b^p\equiv b\mod p$$ The two "outer" equivalences are Fermat's little theorem. By the way, this argument still works if $a$ and $b$ are divisible by $p$.
