On divisors of sums of integers. III (Q1117973)

The authors show that if \(\mathcal A_1, \ldots, \mathcal A_k\) are dense sets of integers then there is a sum \(a_1+\ldots+a_k\) with \(a_i\in\mathcal A_i\) that is divisible by a small prime. The prime factors of sums of integers are studied in a series of papers, especially a result of the above kind is implicit in \textit{A. Balog} and \textit{A. Sárközy} [Acta Arith. 44, 73--86 (1984; Zbl 0546.10050) and Acta Math. Hung. 44, 169--179 (1984; Zbl 0559.10034)]. However the results of this paper are more precise. The second half of the paper is devoted to the question whether the sum of two sequences can always be primes. For any positive integers \(k\) and \(\ell\) the authors can construct sets \(\mathcal A\) of elements \(k\) and \(\mathcal B\) of elements \(\ell\) such that any of the sums \(a+b\) with \(a\in\mathcal A\) and \(b\in\mathcal B\) are prime. The proof is of combinatorial nature and uses nothing about primes but their density.