Home
Book
Learn
Library
Practice
Contact
Log In
MOD
Problem - 2233
Prove that for every prime $p$, there exists an integer $x$, such that $x^8 \equiv 16 \pmod{p}$
report an error