Simon and Paul place n balls numbered 1, 2,…, n in an urn and agree to play the following game. Simon pays the amount of a dollars to Paul, he then selects k balls randomly and receives from Paul an amount of i dollars, where i is the largest number shown in the k balls he selected.

Show that for the game to be fair, we must have a(k + 1) = k(n + 1).