Wiki
Wiki

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

Updated

Problem 1146

../


Statement. We say that A⊂NA\subset \mathbb{N} is an essential component if ds(A+B)>ds(B)d_s(A+B)>d_s(B) for every B⊂NB\subset \mathbb{N} with 0<ds(B)<10<d_s(B)<1 where dsd_s is the Schnirelmann density.

Is B={2m3n:m,n≥0}B=\{2^m3^n : m,n\geq 0\} an essential component?

Formulation. The sum A+BA+B is read as in Schnirelmann's theory, with 00 adjoined to each set: A⊕B={a+b:a∈A∪{0}, b∈B∪{0}}A\oplus B=\{a+b:a\in A\cup\{0\},\ b\in B\cup\{0\}\}. That is the setting of Ruzsa's survey, the site's source. Its inequality of Erdős, from which it deduces that every basis is an essential component, is stated for a basis containing 00. A reply in the site's thread (31 May 2026) gives the same reading. The formal-conjectures statement has used it since its correction of 10 June 2026. So read, the question is open.

With the ordinary sumset the wording has a trivial negative answer. When 0∉C0\notin C, every element of {2m3n}+C\{2^m3^n\}+C is at least 22, so ds({2m3n}+C)=0d_s(\{2^m3^n\}+C)=0. A test set such as C={1}∪{2,4,6,…}C=\{1\}\cup\{2,4,6,\ldots\}, with ds(C)=1/2d_s(C)=1/2, therefore violates the definition; a thread post of 31 May 2026 makes this observation.

Status. Open.

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

References.

  • [Ru99] Ruzsa, I., Erdős and the Integers. Journal of Number Theory 79 (1999), 115--163, doi:10.1006/jnth.1999.2395; § 12, Random sets: the definition of an essential component, printed p. 146 (PDF p. 32 of the publisher's open-archive PDF), and the question whether the numbers 2m3n2^m3^n form one, attributed to Erdős's repeated asking and left unanswered, its author having no plausible guess, printed p. 147 (PDF p. 33); the survey records no result on the set itself. Library home: ruzsa_1999_erdos_integers, with the passage paged on question_p147.
  • [Va99] Various, Some of Paul's favorite problems. Booklet produced for the conference "Paul Erdős and his mathematics", Budapest, July 1999 (1999); the site's source key for this problem is [Va99, 1.19].

Formalization. Statement in formal-conjectures.

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.