For the start of the Premier League , Stephen is predicting the outcome of the table at the end of the season. It is a league format with 20 teams. For each team, the difference between the predicted and actual positions is added onto the score (meaning that the aim is to get the lowest score possible).
Which of these numbers could be obtained as the final score?
Example:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The final score is ∑ n = 1 2 0 ∣ p n − n ∣ = ∑ n = 1 2 0 ( ± p n ∓ n ) , where p n is the prediction for the team that eventually finishes in n th place. This is a signed sum with two copies of every integer from 1 to 2 0 , with 2 0 pluses and 2 0 minuses.
The maximum possible value of this signed sum comes when we put the pluses on the largest numbers: 2 0 + 2 0 + 1 9 + 1 9 + ⋯ + 1 1 + 1 1 − 1 0 − 1 0 − 9 − 9 − ⋯ − 1 − 1 = 2 0 0 .
The other important point is that this signed sum is always even, because ∣ p n − n ∣ ≡ p n − n ( m o d 2 ) , so n = 1 ∑ 2 0 ∣ p n − n ∣ ≡ n = 1 ∑ 2 0 ( p n − n ) = n = 1 ∑ 2 0 p n − n = 1 ∑ 2 0 n = 0 , since the p n are a permutation of 1 , … , 2 0 .
So the final score must be an even number ≤ 2 0 0 , and 1 1 4 is the only possible choice. To be complete, I should also show that 1 1 4 is possible. Here's a sequence p n that should do the trick: 2 0 , 1 9 , 1 8 , 5 , 6 , 7 , 8 , 9 , 1 0 , 4 , 1 1 , 1 2 , 1 3 , 1 4 , 1 5 , 1 6 , 1 7 , 3 , 2 , 1 . This gives a final score of 1 9 + 1 7 + 1 5 + 1 + 1 + 1 + 1 + 1 + 1 + 6 + 0 + 0 + 0 + 0 + 0 + 0 + 0 + 1 5 + 1 7 + 1 9 = 1 1 4 .
(Remark: I believe that every even number between 0 and 2 0 0 inclusive is a possible final score, but I don't have a short proof.)