« Vrati se
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.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
2091IMO Shortlist 2001 problem N56
2119IMO Shortlist 2002 problem N63
2141IMO Shortlist 2003 problem N310
2174IMO Shortlist 2004 problem N54
2262IMO Shortlist 2007 problem N69
2289IMO Shortlist 2008 problem N65