Erdős Problem a Daythe open tracker

Erdős Problem #845

DISPROVED LEANdatabase updated 2026-01-08

The statement as posed is false. A solution has also been checked by machine, in Lean.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

Let \(C > 0\). Is it true that the set of integers of the form \(n = b_1 + \cdots + b_t\), with \(b_1 < \cdots < b_t\), where \(b_i = 2^{k_i}3^{l_i}\) for \(1 \leq i\leq t\) and \(b_t \leq Cb_1\) has density \(0\)? van Doorn and Everts \cite{vDEv25} have disproved this with \(C=6\) - in fact, they prove that all integers can be written as such a sum in which \(b_t<6b_1\). This was formalized in Lean by Alexeev using Aristotle.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/845.
Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/845
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.