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 be an irrational number. Is the set
where denotes the distance to the nearest integer, an additive basis of order ?
Status. Disproved. Konieczny [Ko16b] proves that the set is not an additive basis of order two for almost every , and explicitly for , with any in place of ; for thresholds decaying slowly enough (an -dependent rate that the paper does not relate to ) the set is a basis of order two for uncountably many exceptional and of order three for every irrational . 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 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.
- konieczny_2016_sets_recurrence_as_bases_positive_integers
- konieczny_2016_sets_recurrence_as_bases_positive_integers / lemma_1_2
- konieczny_2016_sets_recurrence_as_bases_positive_integers / proposition_1_3
- konieczny_2016_sets_recurrence_as_bases_positive_integers / proposition_2_9
- konieczny_2016_sets_recurrence_as_bases_positive_integers / question_1
- konieczny_2016_sets_recurrence_as_bases_positive_integers / theorem_a
- konieczny_2016_sets_recurrence_as_bases_positive_integers / theorem_a4