All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Proof needed (Posted on 2012-03-30) Difficulty: 3 of 5
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: ( Back to comment list | You must be logged in to post comments.)
solution Comment 2 of 2 |
Solution at

  Posted by Benny on 2012-03-31 18:56:17
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information