Maths Olympiad Prep

Library / /99 of 151

, 2021

Number theory Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

Let p3p\ge 3 be a prime number and 0rp30\le r\le p-3. Let x1,x2,,xp1+rx_1, x_2, \ldots, x_{p-1+r} be integer numbers satisfying j=1p1+rxjkr (mod p)\sum_{j=1}^{p-1+r}x_j^k\equiv r~ \textrm{(mod}\ p\textrm{)} for all 1kp21\le k\le p-2.

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.