Ononot — Let p be an odd prime. Determine the number of solutions to

Guest Session: 1 Question Remaining. Create Account to save progress.

Modular Arithmetichard

0:00.0

Let $p$ be an odd prime. Determine the number of solutions to the congruence $x^k \equiv 1 \pmod{p}$ where $k$ is a divisor of $p-1$ .