An additive problem with primes and almost-primes
The main result of this paper is a Bombieri-Vinogradov type result for the number of solutions of the equation \(p_1+p_2=2p_3\) with the conditions \(x< p_i\leq 3x\) for \(i=1\), 2, 3 and \(p_i+2\equiv 0\bmod k_i\) for \(i=1\), 2. The authors show that for any \(A>0\), there exists \(B=B(A)>0\) such that \[ \mathop{\sum\sum} _{\substack{ k_1, k_2\leq x^{1/2}(\log x)^{-B} \\ (2,k_1k_2=1)}} \left| D_{k_1,k_2}(x) - {\sigma_0\gamma(x)\over\varphi(k_1)\varphi(k_2)} \prod_{p\mid (k_1,k_2)} {p-1\over p-2} \right| \ll {x^2\over(\log x)^A}, \] where \(D\) is the number of solutions of the equation above, \(\sigma_0\) is the twin prime constant and \(\gamma(x)=\sum (\log m_1 \log m_2\log m_3)^{-1}\), the summation being extended over the set of integers \(m_1\), \(m_2\) and \(m_3\) such that \(x<m_i\leq 3x\) for \(i=1\), 2, 3, and \(m_1+m_2=2m_3\). For the proof they use standard techniques such as the circle method. This result implies as a corollary that there exist infinitely many triples of distinct primes \(p_1\), \(p_2\) and \(p_3\) such that \(p_1+p_2=2p_3\) and \((p_1+2)(p_2+2)\) has at most 9 prime factors (counted according to multiplicity).
This page was built for publication: An additive problem with primes and almost-primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385582)
