MathDB
Italian nice game - Portuguese MO, Problem 4, 2008

Source:

August 31, 2010
combinatorics proposedcombinatorics

Problem Statement

Nelson challenges Telma for the following game: First Telma takes 292^9 numbers from the set {0,1,2,3,,1024}\left\{0,1,2,3,\cdots,1024\right\}, then Nelson takes 282^8 of the remaining numbers. Then Telma takes 272^7 numbers and successively, until only two numbers remain. Nelson will have to give Telma the difference between these two numbers in euros. What is the largest amount Telma can win, whatever Nelson's strategy is?