Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2015-part-04 — 191 problems (EN–VI) Question 24

Math Olympiad Vault · MathNet 2015-part-04 — 191 problems (EN–VI)

Question 24

Let $p$ be a prime satisfying $p \equiv 1 \pmod 4$. Show that there exist infinitely many positive integers $n$ such that $2^n + n^2$ is divisible by $p$.