olymmath

IMO 2026 Problem 6

  • Day 2
  • Number theory
  • Proof

Let a1,a2,a3,…a_1, a_2, a_3, \ldots be an infinite sequence of positive integers greater than 11. Suppose that for all positive integers nn, the number an+1a_{n+1} is the smallest positive integer greater than ana_n such that gcd⁡(an+1,ai)>1\gcd(a_{n+1}, a_i) > 1 for every i=1,2,…,ni = 1, 2, \ldots, n. Prove that there exist positive integers TT and LL such that

an+T=an+La_{n+T} = a_n + L

for every positive integer nn.

(Note that gcd⁡(x,y)\gcd(x, y) denotes the greatest common divisor of positive integers xx and yy.)

Official text IMO 2026 official English paper, page 2. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator imo/2026/p6 · Tag 07ECGJKZ1P · Edit this page on GitHub · Keys: j next, k previous