IMO Shortlist 2003 problem N6


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 8,0
Dodao/la: arhiva
2. travnja 2012.
LaTeX PDF
Let p be a prime number. Prove that there exists a prime number q such that for every integer n, the number n^p-p is not divisible by q.
Izvor: Međunarodna matematička olimpijada, shortlist 2003