IMC 2022, Day 2, Problem 6
Let be a prime number. Prove that there is a permutation of the numbers such that
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(proposed by Giorgi Arabidze, Tbilisi Free University, Georgia)
Hint:
Solution 1. We show such a permutation.
Let for . Then
Solution 2. We begin by noting that the identity permutation yields the value
One thing we can do is to replace by . Indeed, this will decrease the sum by 3. So if , we can just take the permutation i.e. exchanging and whenever . This means we decrease the sum times by 3, leading to a remaining sum of .
If , this strategy does not work immediately. Instead, we can change to resulting in a decrement of the sum by 8. If we then exchange and for as before, we get another times a decrement by 3, leading to a remaining sum of .
Of course this only works if . It thus remains to consider the cases and by hand. For , we just take and for we can take .
Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.