Inverse binary Goldbach conjecture for dense subsets

Let [N]={1,2,,N}[N]=\{1,2,\ldots,N\}, let δ>0\delta>0, and let A1,A2[N]A_1,A_2\subset[N] satisfy A1,A2Nδ|A_1|,|A_2|\geq N^\delta.

Inverse binary Goldbach conjecture. For NN sufficiently large depending on δ\delta, the sumset A1+A2A_1+A_2 contains a composite number.

This is a quantitative inverse problem for additive representations by primes: large subsets of [N][N] should not have a sumset consisting entirely of primes. The source states that the conjecture is open for δ1/2\delta\leq 1/2.

Sources & referencesView supporting material

Primary source

Xuancheng Shao, “On an inverse ternary Goldbach problem”, arXiv:1404.6022 (2014).

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.