MathDB
E 22

Source:

May 25, 2007
modular arithmetic

Problem Statement

Let pp be a prime number. Prove that there exists a prime number qq such that for every integer nn, npāˆ’pn^p -p is not divisible by qq.
Back to ProblemsView on AoPS