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

MathNet 2019-part-03 — 184 problems (EN–VI) Question 2

Math Olympiad Vault · MathNet 2019-part-03 — 184 problems (EN–VI)

Question 2

Let $p$ be a prime number.

Prove that there exists a prime number $q$ such that $n^{p} \not\equiv p \pmod{q}$ for every $n \in \mathbb{Z}$.