For a prime $p=4k+1$, the numbers $x=\pm(2k)!$ solve $x^2+1\equiv 0 \pmod p$ · Prove2Me

P

Initializing...

For a prime $p=4k+1$, the numbers $x=\pm(2k)!$ solve $x^2+1\equiv 0 \pmod p$ · Prove2Me