Conjectures' miners solve both parts of Erdős Problem 14, open for 34 years, verified in Lean
ctjlewis · x · 2026-09-17
Conjectures.io announced that its miners solved both parts of Erdős Problem 14, open for over 34 years. The result proves a square-root lower bound on exceptions to unique representation as a sum of two elements of any set of natural numbers. Full proofs are formally verified in Lean.
More from Research
- Radial gate objective cuts diffusion transformer FID from 16.24 to 11.83 — Junha Park · 2026-11-02
- REA: async brain-cerebellum runtime for robots where policies never wait on the LLM — Pengfei Zhou · 2026-11-02
- Microsoft's MemSteer turns unlabeled user histories into agent memory supervision — MicrosoftResearch · 2026-11-02
- SciGame benchmark uses counterfactual worlds to expose LLM agents' priors vs evidence — Yusheng Zhao · 2026-11-02
- On Terence Tao's blog, Frank Calegari calls on mathematicians to adapt after OpenAI's 700-paper release — Hesamation · 2026-11-02
- Tsinghua & Microsoft's HarnessMM cuts agent token use by up to 87.93% while raising success rate — rohanpaul_ai · 2026-11-02