Home > Just Math
| Proof needed (Posted on 2012-03-30) |
 |
Prove that for each prime p, there exists a prime q such that
n^p − p is not divisible by q for any positive integer n.
Source: IMO 2003
|
No Solution Yet
|
Submitted by Ady TZIDON
|
|
Rating: 4.0000 (1 votes)
|
|
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (13)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
