Math AI Grader
Free trial, no account needed
Back to exercises

IMO 2026 · Problem 3

CombinatoricsHard

Source: IMO 2026, day 1 · Official statement

Statement reformulated, mathematically equivalent to the official one.

Let nn be a positive integer. Liu Bang and Xiang Yu play with a stick of length 11, as follows.

  1. Liu Bang first marks at most nn distinct points on the stick (he may mark fewer, or none at all).
  2. Then Xiang Yu in turn marks at most nn 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.
  3. The stick is then cut at all the marked points, giving several pieces.
  4. 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 n≥1n\ge 1, determine the largest real number cc such that Liu Bang can guarantee a total length of at least cc, 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.