Library / /47 of 151

, 2015

Number theory Difficulty 6.0 National Olympiad Find the answer Hungary

Find all primes $p$ and positive integers $n$ for which the numbers ${(k+1)}^n-2k^n$ ( $k=1,2,\ldots,p$ ) form a complete residue system modulo $p$ .
(5 pont)

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.