MathDB
n red and 1 black marbles, game with initial fortune

Source: Norwegian Mathematical Olympiad 2015 - Abel Competition p2b

September 3, 2019
combinatoricsgamemaximum

Problem Statement

Nils is playing a game with a bag originally containing nn red and one black marble. He begins with a fortune equal to 11. In each move he picks a real number xx with 0xy0 \le x \le y, where his present fortune is yy. Then he draws a marble from the bag. If the marble is red, his fortune increases by xx, but if it is black, it decreases by xx. The game is over after nn moves when there is only a single marble left. In each move Nils chooses xx so that he ensures a final fortune greater or equal to YY . What is the largest possible value of YY?