IMO 2024 Problem 2: eventual GCD constancy
Follow the latest progress by email.
Determine all positive integer pairs (a,b) for which positive integers g and N exist with gcd(aⁿ+b,bⁿ+a)=g for every n≥N.
Why it matters and what counts as progress
Why it matters: It asks when a sequence of greatest common divisors becomes permanently constant, rather than merely repeating for many tested exponents.
What counts as progress: A proof of the full classification of positive integer pairs, controlling every sufficiently large exponent rather than a finite list of tests.
How the problem developed
- 16 Jul 2024 · Contest problem [1]
IMO jury The problem appeared in the official IMO 2024 contest on this contest day.
Google DeepMind AlphaProof and AlphaGeometry solved four of six IMO 2024 problems; DeepMind published a proof page for this problem. Its problem page documents which formalization and proof system were used.
AI contribution
Olympiad-level formal mathematical reasoning with reinforcement learning
DeepMind reports Lean proofs for IMO 2024 problems 1, 2, and 6, and publishes the specific proof artifacts.
Sources
Website timeline
Publication dates and editorial changes.