IMO 2026 · Problem 3
CombinatoricsHard
Source: IMO 2026, day 1 · Official statement
Statement reformulated, mathematically equivalent to the official one.
Let be a positive integer. Liu Bang and Xiang Yu play with a stick of length , as follows.
- Liu Bang first marks at most distinct points on the stick (he may mark fewer, or none at all).
- Then Xiang Yu in turn marks at most points (again, he may mark fewer). All marked points are distinct: those of Xiang Yu differ from each other and from those of Liu Bang.
- The stick is then cut at all the marked points, giving several pieces.
- The two players then take turns choosing a piece that is still available, Liu Bang starting, until none remain.
Each player tries to maximize the total length of the pieces he has taken.
For each integer , determine the largest real number such that Liu Bang can guarantee a total length of at least , however Xiang Yu plays.
This problem is graded without a reference solution or marking scheme: the score is less reliable.
Student's paper
0 / 20,000
Nothing is saved on our servers: if you refresh or leave the page, the paper and its score are lost. Your exercises, prompt and model choice stay in this browser.