Wiki
Wiki

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

Updated


Statement

The definition, printed on p. 146 in § 12, Random sets: "A set V\mathscr V is an essential component, if for every set A\mathscr A with 0<σ(A)<10<\sigma(\mathscr A)<1 we have σ(A+V)>σ(A)\sigma(\mathscr A+\mathscr V)>\sigma(\mathscr A) (or an analogous requirement with asymptotic density)." Here σ(B)=inf⁡n∈NB(n)/n\sigma(B)=\inf_{n\in\mathbb N}B(n)/n is the Schnirelmann density of § 10 (p. 139), B(n)B(n) counting the elements of BB in [1,n][1,n].

The question, printed on p. 147 at the end of § 12: "The simplest set with a chance to be an essential component is the collection of numbers in the form 2m3n2^m3^n, and Erdős often asked whether it is an essential component or not; I do not even have a plausible guess."

The survey attributes the question to Erdős's repeated asking and gives no written source for it. It is the question of Problem 1146, with the Schnirelmann-density form of the definition.

Source. I. Z. Ruzsa, Erdős and the Integers, J. Number Theory 79 (1999), 115--163; the definition on printed p. 146 (PDF p. 32 of the publisher's PDF) and the question on printed p. 147 (PDF p. 33), both read on the page images. The artifact is identified in the source digest.

Read depth. Claims checked: the definition and the question were read clause by clause on the page images. There is nothing to prove; the passage states a question and its author's assessment.

Proof pointer

None; a question. The context the survey gives on pp. 146--147: every basis is an essential component, by Erdős's inequality on bases (printed as "(11.2)", the display numbered (10.2) on p. 140); the converse fails, since Linnik constructed an essential component with V(n)=O(nε)V(n)=O(n^\varepsilon) for every ε\varepsilon, which cannot be a basis; and the author's own paper (Ruzsa, 1987) settles the possible size: "for every fixed ε>0\varepsilon>0 we can find an essential component with V(x)=O((log⁡x)1+ε)V(x)=O((\log x)^{1+\varepsilon}), but V(x)=O((log⁡x)1+o(1))V(x)=O((\log x)^{1+o(1)}) is impossible" (p. 147). A filing observation, not a result of the paper: the set {2m3n}\{2^m3^n\} has V(x)≍(log⁡x)2V(x)\asymp(\log x)^2, above that threshold, so the size result does not decide the question, as the author's lack of even a plausible guess indicates.

Dependencies

None.

Bears on

  • Problem 1146: the problem's question and definition in the words of its only cited source; the survey records no result on the set {2m3n}\{2^m3^n\} and leaves the question unanswered (its author has "not even ... a plausible guess"), so the page's status is unchanged.