Difference between revisions of "2001 IMO Shortlist Problems/N4"
(New page: == Problem == Let <math>p \geq 5</math> be a prime number. Prove that there exists an integer <math>a</math> with <math>1 \leq a \leq p - 2</math> such that neither <math>a^{p - 1} - 1</ma...) |
(No difference)
|
Revision as of 18:57, 20 August 2008
Problem
Let be a prime number. Prove that there exists an integer with such that neither nor is divisible by .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.