How many solutions do $x^{p-1} equiv 1 pmod p$ and $x^{p-1} equiv 2 pmod p$ have?
2
This is my first post so I apologize for any kind of error. I'm preparing a magistral degree exam in number theory, and I'm performing some exercise. I'm asking here this question: how can I prove how many solutions there are for $x^{p-1} equiv 1pmod p$ and $x^{p-1} equiv 2 pmod p$ ? Edit: $p$ is an odd prime.
elementary-number-theory modular-arithmetic
share | cite | improve this question
edited Nov 26 at 9:42
Batominovski
33.7k 3 32 92
asked Nov 26 at 9:07
Alessar