Difference between revisions of "2003 IMO Problems/Problem 6"

Revision as of 09:28, 2 March 2024

2003 IMO Problems/Problem 6

Problem

p is a prime number. Prove that for every p there exists a q for every positive integer n, so that $n^p-p$ can't be divided by q.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Let N be $1 + p + p^2 + ... + p^{p-1}$ which equals $\frac{p^p-1}{p-1}$ $N\equiv{p+1}\pmod{p^2}$ Which means there exists q which is a prime factor of n that doesn't satisfy $q\equiv{1}\pmod{p^2}$ . \\unfinished

@@ Line 2: / Line 2: @@
 == Problem ==
-p is not a prime number. Prove that for every p there exists a q for every positive integer n, so that <math>n^p-p</math> can't be divided by q.
+p is a prime number. Prove that for every p there exists a q for every positive integer n, so that <math>n^p-p</math> can't be divided by q.
 == Solution ==

2003 IMO (Problems) • Resources
Preceded by Problem 5	1 • 2 • 3 • 4 • 5 • 6	Followed by Last Problem
All IMO Problems and Solutions

Page

Toolbox

Search

Difference between revisions of "2003 IMO Problems/Problem 6"

Revision as of 09:28, 2 March 2024

Contents

2003 IMO Problems/Problem 6

Problem

Solution

See Also