Sárközy's conjecture on additive irreducibility of smooth numbers

At least 12 years old · documented by

Fix 0<ϵ<10<\epsilon<1. An integer is yy-smooth if all of its prime factors are at most yy, and let Snϵ\mathcal{S}_{n^{\epsilon}} denote the set of integers nn with no prime factor greater than nϵn^{\epsilon}. A set is asymptotically additively irreducible if it has no asymptotic additive decomposition into two sets each containing at least two elements. Sárközy's conjecture. The set Snϵ\mathcal{S}_{n^{\epsilon}} is asymptotically additively irreducible. This is the smooth-number analogue of Ostmann's problem. The paper presents it as an open problem posed by Sárközy; the methods that solved the ternary prime problem do not directly transfer to this setting.

References

Primary source

Christian Elsholtz and Adam J. Harper, “Additive decompositions of sets with restricted prime factors”, arXiv:1309.0593 (2013).

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.