Lemma › Guides › EGMO 2023 Problem 1: solution, and why the ring has to close
Guide

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 problem. There are n≥3n \geq 3 positive real numbers a1,a2,…,ana_1, a_2, \ldots, a_n. For each ii let bi=ai−1+ai+1aib_i = \frac{a_{i-1} + a_{i+1}}{a_i}, where a0a_0 means ana_n and an+1a_{n+1} means a1a_1. Assume that for all ii and jj, ai≤aja_i \leq a_j holds if and only if bi≤bjb_i \leq b_j holds. Prove that a1=a2=⋯=ana_1 = a_2 = \cdots = a_n.

The signal in the statement

The hypothesis says that two orders agree: the order of the aa's is the same as the order of the bb'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 bib_i 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 22. At a valley, both neighbours are at least the valley, so the ratio is at least 22. Those two facts, at the two extremes, are the whole problem. Everything after them is bookkeeping around a ring.

Solution

  1. Write aibi=ai−1+ai+1a_i b_i = a_{i-1} + a_{i+1} for each ii, with indices taken around the ring.
  2. Let MM be an index where aMa_M is largest. For every jj we have aj≤aMa_j \leq a_M, so the hypothesis gives bj≤bMb_j \leq b_M. The largest bb sits at MM.
  3. Let mm be an index where ama_m is smallest. The same argument gives bm≤bjb_m \leq b_j for every jj, so the smallest bb sits at mm.
  4. At the peak both neighbours are at most aMa_M, so bM=aM−1+aM+1aM≤2b_M = \frac{a_{M-1} + a_{M+1}}{a_M} \leq 2.
  5. At the valley both neighbours are at least ama_m, so bm=am−1+am+1am≥2b_m = \frac{a_{m-1} + a_{m+1}}{a_m} \geq 2.
  6. Chain the four facts. For every jj, 2≤bm≤bj≤bM≤22 \leq b_m \leq b_j \leq b_M \leq 2. So every bjb_j equals 22.
  7. Substitute back into step 1: ai−1+ai+1=2aia_{i-1} + a_{i+1} = 2a_i for every ii. Let di=ai+1−aid_i = a_{i+1} - a_i, with indices around the ring. The equation says di=di−1d_i = d_{i-1}, so all the did_i equal one number dd. Going once round the ring the differences add to zero, so nd=0nd = 0, and therefore d=0d = 0. Every aia_i is equal.

Step 2 uses only one direction of the hypothesis: aj≤aMa_j \leq a_M forces bj≤bMb_j \leq b_M. 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 La=0La = 0, where LL is the n×nn \times n matrix with −2-2 on the diagonal and 11 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 n−1n-1 for each small nn, and the argument does not depend on nn, 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

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 22 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

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