Ononot — By Fermat's Little Theorem, what is a^{p-1} \\pmod p for pri

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

Divisibilityhard

0:00.0

By Fermat's Little Theorem, what is $a^{p-1} \\pmod p$ for prime $p$ not dividing $a$ (k=7)?