Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 1147

../

claims/: The 1 claim page of Problem 1147, one per claimant's result; the problem's standing derives from them.


Statement. Let α>0\alpha>0 be an irrational number. Is the set

A={n≥1:∥αn2∥<1log⁡n},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 22?

Status. Disproved. Konieczny [Ko16b] proves that the set is not an additive basis of order two for almost every α>0\alpha>0, and explicitly for α=2\alpha=\sqrt2, with any ϵ(n)→0\epsilon(n)\to0 in place of 1/log⁡n1/\log n; for thresholds decaying slowly enough (an α\alpha-dependent rate that the paper does not relate to 1/log⁡n1/\log n) the set is a basis of order two for uncountably many exceptional α\alpha and of order three for every irrational α\alpha. The accepted claim is Konieczny.

Source. erdosproblems.com/1147, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #1147, https://www.erdosproblems.com/1147.

References.

  • [Ko16b] Konieczny, Jakub, Sets of recurrence as bases for the positive integers. Acta Arith. (2016), 309-338.

Formalization. Statement in formal-conjectures. The community database at teorth/erdosproblems records the problem's formal status as Lean; the two third-party Lean formalizations of Konieczny's 2\sqrt2 counterexample, neither built by this corpus, are linked from the claim page.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.