2025 IMO Problems/Problem 5
Revision as of 05:57, 16 July 2025 by Renrenthehamster (talk | contribs)
Alice and Bazza are playing the inekoalaty game, a two‑player game whose rules depend on a positive real number 
which is known to both players. On the 
th turn of the game (starting with 
) the following happens:
If is odd, Alice chooses a nonnegative real number 
such that
![\[x_1 + x_2 + \cdots + x_n \le \lambda n\]](http://latex.artofproblemsolving.com/a/1/9/a1980acef3a836807c505584b3159d385b662ba1.png)
If is even, Bazza chooses a nonnegative real number such that
![\[x_1^2 + x_2^2 + \cdots + x_n^2 \le n\]](http://latex.artofproblemsolving.com/8/1/e/81ef75d4416ca398f1f6972fae4f82cb3ea502a4.png)
If a player cannot choose a suitable , the game ends and the other player wins. If the game goes on forever, neither player wins. All chosen numbers are known to both players.
Determine all values of for which Alice has a winning strategy and all those for which Bazza has a winning strategy.
