Average prime-pair counting formula
From MaRDI portal
(Redirected from Average prime-pair counting formula)
Abstract: Taking , let denote the number of prime pairs with . The prime-pair conjecture of Hardy and Littlewood (1923) asserts that with an explicit constant . There seems to be no good conjecture for the remainders that corresponds to Riemann's formula for . However, there is a heuristic approximate formula for averages of the remainders which is supported by numerical results.
Recommendations
Cites work
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A new bound for the smallest $x$ with $\pi(x) > \mathrm{li}(x)$
- Distributional Wiener-Ikehara theorem and twin primes
- scientific article; zbMATH DE number 3886001 (Why is no real title available?)
- scientific article; zbMATH DE number 3968684 (Why is no real title available?)
- scientific article; zbMATH DE number 47601 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 3221530 (Why is no real title available?)
- Irregularities in the Distribution of Primes and Twin Primes
- On the Sign of the Difference π(x) - li(x)
- Prime Number Races
- Prime pairs and the zeta function
- Riemann's zeta function
- Small differences between prime numbers
- Some singular series averages and the distribution of Goldbach numbers in short intervals
- The prime-counting function and its analytic approximations. \(\pi(x)\) and its approximations
- Topics in multiplicative number theory
Cited in
(4)
This page was built for publication: Average prime-pair counting formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584827)