EGMO 2023 Problem 1: solution, and why the ring has to close
15 November 2026
EGMO 2023 Problem 1 looks like a puzzle about a ring of numbers and a strange ratio, and it is decided by one question asked in the right place: where is the biggest number? Here is the statement, a full solution, an independent check, and the part most write-ups skip: what in the wording tells you to look at the extremes.
The signal in the statement
The hypothesis says that two orders agree: the order of the 's is the same as the order of the 's. When a hypothesis links two orderings, the first move is to look at the largest and the smallest term, because those are the only places where an ordering hands you an inequality for free.
Then look at what is. It is a neighbour sum divided by the middle term. At a peak, both neighbours are at most the peak, so the ratio is at most . At a valley, both neighbours are at least the valley, so the ratio is at least . Those two facts, at the two extremes, are the whole problem. Everything after them is bookkeeping around a ring.
Solution
- Write for each , with indices taken around the ring.
- Let be an index where is largest. For every we have , so the hypothesis gives . The largest sits at .
- Let be an index where is smallest. The same argument gives for every , so the smallest sits at .
- At the peak both neighbours are at most , so .
- At the valley both neighbours are at least , so .
- Chain the four facts. For every , . So every equals .
- Substitute back into step 1: for every . Let , with indices around the ring. The equation says , so all the equal one number . Going once round the ring the differences add to zero, so , and therefore . Every is equal.
Step 2 uses only one direction of the hypothesis: forces . The argument never needs the converse.
A second route, as an independent check
The same conclusion comes from linear algebra. The equations in step 7 say , where is the matrix with on the diagonal and in the two cyclic neighbour positions of each row. This is the Laplacian of a cycle. A cycle is connected, so its kernel is exactly the constant vectors and nothing else. Elimination confirms the rank for each small , and the argument does not depend on , because a connected graph always behaves this way.
Two independent routes to the same answer is the habit to build. The inequality route and the linear algebra route fail in different places, so agreement between them is real evidence.
Where marks go missing
- Applying the bound at any index. is not true in general. It holds at a peak only, because both neighbours are at most that peak. With the first ratio is , while at the peak the ratio is .
- Dropping the wrap-around. means and means . Forget this and the ratios at the two ends of the list are wrong, and the ring never closes, so the last step has nothing to close.
- Stopping once every ratio is 2. That is a recurrence, not a conclusion. The conclusion needs the sum of differences around the ring, which is what forces the common difference to zero.
- Assuming the peak or the valley is unique. Ties are fine. Any index that attains the maximum works, and the chain in step 6 does not care which one you picked.
Practise the idea
Choosing an extreme element first and reading off what it forces is the extremal principle in its plainest form, and turning the resulting inequality into the value is a job for bounding. The archive's olympiad problem o4-2 is a good place to practise picking the extreme element to start from. The daily problem posts a new one every day, no account needed.
Related guides
- EGMO 2020 Problem 1: solution, and the power of 2 that cannot hideA full solution to EGMO 2020 Problem 1: track the power of 2 in each term, show it climbs by 2 or falls by 1, and count the terms.
- Number theory problems that look like algebra, and how to tellAn equation, a fraction, a polynomial: it reads like algebra, but the word integer changes the method. Five signals, and the three moves that follow.
- How to revise a topic you understand but keep missingRereading a topic you already understand fixes nothing. Find the one step that keeps breaking, revise that step, and test it cold. Worked on mods and bounds.
- How to check an answer when the clock is against youRe-reading your working reproduces the error that made it. Five checks that are independent of the derivation, and the order to run them under time pressure.
Train it on Lemma
Every technique here is taught explicitly, in order. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.
Find your level