On the number of solutions of N-p=P_ 3
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 3499888 (Why is no real title available?)
- scientific article; zbMATH DE number 3206359 (Why is no real title available?)
- scientific article; zbMATH DE number 3238008 (Why is no real title available?)
- Lectures on sieve methods. Notes by S. Srinivasan
- On the large sieve
- Selberg's sieve with weights
Cited in
(6)- When any three solutions are independent
- scientific article; zbMATH DE number 4210267 (Why is no real title available?)
- scientific article; zbMATH DE number 4002203 (Why is no real title available?)
- scientific article; zbMATH DE number 39367 (Why is no real title available?)
- scientific article; zbMATH DE number 3995809 (Why is no real title available?)
- scientific article; zbMATH DE number 6464013 (Why is no real title available?)
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)