Sárközy's conjecture on additive irreducibility of smooth numbers
Sárközy's conjecture on additive irreducibility of smooth numbers
Fix . An integer is -smooth if all of its prime factors are at most , and let denote the set of integers with no prime factor greater than . 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 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.
Sources & referencesView supporting material
Primary source
Christian Elsholtz and Adam J. Harper, “Additive decompositions of sets with restricted prime factors”, arXiv:1309.0593 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.