Skip to content

Erdős Problem #1145

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: additive combinatorics, 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 #1145 concerns the following mathematical question and its exact quantifiers:

\[ r_{A,B}(n)=\#\{(a,b)\in A\times B:a+b=n\},\qquad \frac{a_n}{b_n}\to1. \]

Two infinite positive-integer sets A={a_1<a_2<...}, B={b_1<b_2<...} with a_n/b_n->1 form an ASYMPTOTIC additive basis A+B (all sufficiently large n are representable). Erdős–Sárközy ask if r(n)=(1_A*1_B)(n), the count of ordered pairs (a,b) from A×B with a+b=n, must be unbounded, i.e. limsup_n r(n)=infinity. Requiring ALL positive n is impossible with A,B positive because 1 not in A+B; site corrected to eventually.

A small example

For A=B=positive integers, a_n/b_n=1 and r(n)=n-1 for all n>=2. Conversely A0={nonnegative numbers with only even-position binary digits}, B0={nonnegative numbers with only odd-position digits}: every n from 0..63 has EXACTLY ONE representation A0+B0, verified exhaustively via six binary digits; A0/B0 do not have matching index asymptotics. Thus neither example disproves the conjecture.

What is known

https://www.erdosproblems.com/1145 OPEN [Va99,1.17], a stronger version of Erdős #28. Maintained catalogue notes unique representations from complementary even/odd binary-digit sets but these do NOT satisfy the crucial a_n/b_n->1 balancing. Formal-conjectures snapshot 1145.lean has open statement and local sorry, no certified proof.

GCL's current state

Authenticated original-issue source return established the bounded source and finite-evidence interface. The complementary binary-digit counterexample only applies after dropping the balancing constraint between the two indexing sequences.

All general results cited here remain external until primary-source review.

What remains

ERDOS-1145-BALANCED-ADDITIVE-BASIS-001: read original Erdős–Sárközy/Vardi statements including index ratio and finite exceptional sums; prove uniqueness of binary complement example for all n by disjoint bit positions, and examine rigorous lower bounds for balanced infinite bases.

General unbounded representation conjecture OPEN; historical proof and any stronger status claims unverified.

Sources and claim boundaries

https://www.erdosproblems.com/1145 ; https://www.erdosproblems.com/forum/thread/1145 ; [Va99,1.17]; phase17 exact 64-sum digit fixture.

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: #2416 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction