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

IMO 2026 · Problem 6

Number theoryHard

Source: IMO 2026, day 2 · Official statement

Statement reformulated, mathematically equivalent to the official one.

Consider an infinite sequence a1,a2,a3,…a_1,a_2,a_3,\dots of integers, all strictly greater than 11, such that for every integer n≥1n\ge 1, the term an+1a_{n+1} is the smallest integer strictly greater than ana_n that has a common divisor strictly greater than 11 with each of the numbers a1,a2,…,ana_1,a_2,\dots,a_n. In other words: an+1=min⁡{x∈Z:x>an and gcd⁡(x,ai)>1 for all i=1,…,n}.a_{n+1}=\min\{x\in\mathbb{Z} : x>a_n \text{ and } \gcd(x,a_i)>1 \text{ for all } i=1,\dots,n\}.

Show that there exist two positive integers TT and LL such that an+T=an+Lfor all n≥1.a_{n+T}=a_n+L \quad\text{for all } n\ge 1.

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.