3.0 Number Theory

Let \(p\) be a prime number. If \(p\) divides \(n^2 + 1\) for some integer \(n\), prove that \(p \equiv 1 \pmod{4}\) or \(p=2\).

♡ 0 Show solutions

Not logged in? Click here to log in.