Erdős Problem #32 — Growth of complementary sequences to the primes

Erdős

Let a1<a2<a_1<a_2<\cdots be an infinite sequence of integers. Straus and I conjectured that there is a sequence of density 00, b1<b2<b_1<b_2<\cdots, such that every integer is of the form ai+bja_i+b_j. Lorentz [1954] proved this conjecture. We call b1<b2<b_1<b_2<\cdots a complementary sequence to a1<a2<a_1<a_2<\cdots.

When the aia_i are the primes, Lorentz observed that (12.1) gives B(x)<c(logx)3B(x)<c(\log x)^3, and Erdős [1954] proved the improvement B(x)<c(logx)2B(x)<c(\log x)^2. Clearly every complementary sequence to the primes must satisfy

lim infB(x)logx1.(12.2)\liminf \frac{B(x)}{\log x}\ge 1. \tag{12.2}

Erdős stated that he expected (12.2) could be improved, but could not prove even

lim supB(x)logx>1.\limsup \frac{B(x)}{\log x}>1.

He also could not find a complementary sequence to the primes satisfying B(x)=o((logx)2)B(x)=o((\log x)^2), and could not decide whether there is a complementary sequence to the primes b1<b2<b_1<b_2<\cdots for which the number of solutions of n=p+bin=p+b_i is bounded.

Sources & referencesView supporting material

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.