Primes in sumsets (Q1692346): Difference between revisions

For each positive integer \(n\) and sets \(A,B\subseteq\{1,2,\dots,n\}\) let \(P_{A,B}(n)\) denote the number of pairs \((a,b)\in A\times B\) such that \(a+b\) is a prime number. In the paper under review, the author proves that if \(|A||B|\gg\frac{n^2}{\log^2n}\), then \(P_{A,B}(n)\ll \mathcal{B}_{A,B}(n)\), where \[ \mathcal{B}_{A,B}(n)=\frac{|A||B|}{\log n}\log\log\frac{1000n}{\sqrt{|A||B|}}. \] On the other hand, the author constructs sets \(A,B\) admitting the above conditions and \(P_{A,B}(n)\gg \mathcal{B}_{A,B}(n)\), hence proving that the above bound is optimal up to an implied constant. The proof use sieve methods and some properties of distribution of prime numbers in arithmetical progressions.