On the number of solutions of N-p=P_ 3

From MaRDI portal
(Redirected from Publication:788765)
On the number of solutions of \(N-p=P 3\)





Let N be an even positive integer and define \[ C_ N=\prod_{p>2}(1- 1/(p-1)^ 2)\prod_{2<p| N}(p-1)/(p-2). \] \textit{H.-E. Richert} [Mathematika 16, 1-22 (1969; Zbl 0192.397)] proved that if N is sufficiently large then \[ | \{p:\quad p<N,\quad N-p=P_ 3\}| \quad>\quad(13/3) C_ N (N/\log^ 2N). \] In this paper, the constant 13/3 is improved to 6.173. The proof uses mean value theorems of the Bombieri-Vinogradov type and Chen's switching argument, but it does not use sieve weights.











This page was built for publication: On the number of solutions of \(N-p=P_ 3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788765)