Number theoryDifficulty 7.0Prove itKöMaL problem A · Hungary · 2021
Let p≥3 be a prime number and 0≤r≤p−3. Let x1,x2,…,xp−1+r be integer numbers satisfying ∑j=1p−1+rxjk≡r(modp) for all 1≤k≤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.
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.