MathDB

22

Part of PEN E Problems

Problems(1)

E 22

Source:

5/25/2007
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.
modular arithmetic