IMO 2003 Problem 6

Let $p$ be a prime number. Prove that there exists a prime number $q$ such that for every integer $n$ , the number $n^p-p$ is not divisible by $q$ .

Attachments:

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Locator imo/2003/p6 · Tag 28Y6G1CKE8 · Edit this page on GitHub · Keys: j next, k previous