Erdős Problem a Daythe open tracker

Erdős Problem #1147

DISPROVED LEANdatabase updated 2026-09-16

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).

The set \(\{ n\geq 1: \| \alpha n^2\| < \epsilon(n)\}\).

Let \(\alpha>0\) be an irrational number. Is the set \[A=\left\{ n\geq 1: \| \alpha n^2\| < \frac{1}{\log n}\right\},\] where \(\|\cdot\|\) denotes the distance to the nearest integer, an additive basis of order \(2\)? This was disproved by Konieczny [Ko16b], and is false both for almost every \(\alpha>0\), and also is false specifically for \(\alpha=\sqrt{2}\). More generally, given any \(\epsilon(n)\to 0\), the set \(A=\{ n\geq 1: \| \alpha n^2\| < \epsilon(n)\}\) is not an additive basis of order \(2\) for almost every \(\alpha>0\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/1147.
Prizenone
Topicsirrational, additive basis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/1147
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.