2003 IMO Problems/Problem 6
2003 IMO Problems/Problem 6
Problem
Let be a prime number. Prove that there exists a prime number such that for every integer , the number is not divisible by .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
Let N be which equals Which means there exists q which is a prime factor of n that doesn't satisfy . \\unfinished
See Also
2003 IMO (Problems) • Resources | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Problem |
All IMO Problems and Solutions |