Problems/Erdos Conjecture on Arithmetic Progressions

Erdos Conjecture on Arithmetic Progressions

Number TheoryOPEN
Year
1973
Difficulty
*****

Statement

If A is a set of positive integers whose reciprocals diverge, then A contains arithmetic progressions of every finite length.

∑n∈A1n=∞  ⟹  A⊇AP of length k,  ∀k\sum_{n \in A} \frac{1}{n} = \infty \;\Longrightarrow\; A \supseteq \text{AP of length } k,\; \forall k

About this Problem

Would imply that primes contain APs of every length (proven by Green-Tao, 2004). This stronger conjecture remains wide open and is central to additive combinatorics.

About the Lean 4 Prover

Lean 4 is a theorem prover and programming language. When a proof compiles in Lean, it is mathematically certain to be correct — the type checker verifies every logical step. This is the gold standard for formal verification.

Our platform uses fal.ai serverless compute to run Lean verification, and Gemini to generate proof strategies that are then formally checked. ShinkaEvolve provides the evolutionary backbone for automated mathematical discovery.

Mathematical Art

Generate a unique AI illustration of this problem using fal.ai FLUX.

Connected Constellations