Maths Olympiad Prep

Track / Stage 7 / 8 of 300 #1888 of 2444

Problem 1888

National Olympiad second round; IMO P1/P4
Number theory Difficulty 7.0 Prove it KöMaL problem A · Hungary · 2021

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.

This one wants a proof. Work it on paper, then check yourself against the publisher's own solution, linked below. Be honest about it: the record is only any use to you if it is.

Next problem →

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

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