Erdos-Turan Conjecture on Additive Bases
Number TheoryOPEN
Year
1941
Difficulty
*****
Statement
If B is an additive basis of order 2, the representation function is unbounded.
About this Problem
Asserts no 'thin' additive basis exists. Central to additive number theory for over 80 years.
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.