On a problem of Sierpiński. II
For an integer \(s\geq2\) let \(\mu_s\) be the least integer such that every integer greater than \(\mu_s\) is a sum of \(s\) pairwise coprime integers greater than \(1\), and let \(c_s= \mu_s-\sum_{i=1}^{s+1} p_i\), where \(p_1=2,\;p_s=3,\dots\) is the sequence of primes. Let \(A\) be the set of all integers \(c_s\) for \(s\geq3\). The set \(A\) is explicitly described by the authors. The set \(A\) consists of \(125\) even integers in the interval \([2,1100]\). Moreover, under Dickson's conjecture, the authors prove that every integer in \(A\) occurs infinitely many times in the sequence \(c_s\) for \(s\geq3\). Part I, see Acta Arith. 156, No. 4, 373--382 (2012; Zbl 1327.11007).
scientific article; zbMATH DE number 6419675
scientific article