MathDB
JBMO TST Bosnia and Herzegovina

Source:

July 7, 2019
combinatoricswinning strategy

Problem Statement

3.3. Let SS be the set of all positive integers from 11 to 100100 included. Two players play a game. The first player removes any kk numbers he wants, from SS. The second player's goal is to pick kk different numbers, such that their sum is 100100. Which player has the winning strategy if : a)a) k=9k=9? b)b) k=8k=8?