In the - game, a round starts with player paying cents to player . Then secretly arranges the numbers in some order as a sequence , and secretly arranges as a sequence . Finally, the players show their sequences and pays one cent for each in such that . This finishes the round. What number would make the game fair? (The game is fair if the total payments by to equals the total payments by to after all possible distinct rounds are played exactly once.)
Problem 1640
Official solutions — 2
Solution 1
Solution:
Let be in . There are choices of the sequences and for which is an with . Indeed, the 's can be any of the permutations of the 7 odd integers; then is the subscript such that , and must be one of the numbers in ; the remaining 6 even integers can be arranged in ways.
The total of the payments by to for the possible rounds is then
pays to a total of ; so makes the game fair.
Solution 2
Solution:
For those who know that the sum of expected values (averages) is the expected value of the sum, we note that in the first spot, are equally likely, and hence the average payment is the average of the payments for each of these numbers, . Hence in the first spot the average payment is
Since there are 7 spots, with an average payment of cent each, the total payment averages 4 cents; so makes the game fair.