Erdős Problem #37 — Lacunary sequences that fail to be essential components

Erdős

A sequence A is called by Khintchin an essential component if for every sequence B with ds(B)>0d_s(\mathrm{B}) > 0, ds(A+B)>ds(B)d_s(\mathrm{A} + \mathrm{B}) > d_s(\mathrm{B}). [...] This led me to the following conjecture: Let n1<n2<n_1 < n_2 < \ldots be an infinite sequence of integers satisfying nk1nk>c>1\frac{n_{k-1}}{n_k} > c > 1 [sic in the original; presumably nk+1nk\frac{n_{k+1}}{n_k} is meant], then our sequence can not be an essential component. I was so far unable to prove this conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Solutions 0

No solutions have been posted yet.