Erdős Problem #1147
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: disproved (not automatically the live result).
Subject areas: irrational, additive basis.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1147 concerns the following mathematical question and its exact quantifiers:
For irrational alpha>0 define A_alpha={n>=2: distance(alpha*n²,Z)<1/log n}. Is A_alpha an asymptotic additive basis of ORDER TWO, i.e. do ALL sufficiently large integers belong to A_alpha+A_alpha? Formula at n=1 has log 1=0 and requires a finite-prefix convention. Strict inequality matters only for boundary equality; preserve it in source.
A small example
For alpha=sqrt(2), high-precision decimal calculation of n=2..500 includes 211 qualifying members; sums of two members from this TRUNCATED set miss 23 targets in 4..1000, e.g. 781. Those missing sums in bounded ranges are NOT proof of failure as an asymptotic basis, which requires arbitrarily large absent targets; published result is external.
What is known
https://www.erdosproblems.com/1147 DISPROVED. Konieczny [Ko18] Sets of recurrence as bases for the positive integers Theorem A(A4): more generally for any epsilon(n)->0, such thin quadratic-fractional-part sets are not additive bases of order 2 for almost all alpha. Proposition 1.3 gives a SPECIFIC counterexample alpha=sqrt(2), not only almost-everywhere. Reference arXiv:1504.02410. Original 2018 proof not independently replayed; catalog update Jan 2026.
GCL's current state
Authenticated original-issue source return established the bounded source and finite-evidence interface. The Konieczny counterexamples are infinite constructions; a finite list of missing sums is not a substitute.
All general results cited here remain external until primary-source review.
What remains
ERDOS-1147-KONIECZNY-SOURCE-001: read theorem A(A4) and Proposition 1.3 primary proofs; compare < versus <=, n=1 convention, epsilon(n) quantifier, a.e. alpha vs fixed sqrt(2), and isolate infinitely-many-missing-target argument.
External proof and strict inequality normalization not independently source-locked. General claim externally disproved.
Sources and claim boundaries
https://www.erdosproblems.com/1147 ; https://www.erdosproblems.com/forum/thread/1147 ; Konieczny 2018 arXiv:1504.02410; bounded phase17 arithmetic not a global disproof.
This is a source-bound, unaccepted editorial draft. Neither protected cohort admission nor proof or Lean certification is implied.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2418 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.