Abstract: Brun's constant is , where the summation is over all twin primes. We improve the unconditional bounds on Brun's constant to , which is about a 13% improvement on the previous best published result.
Recommendations
- Improved bounds on the Hadwiger-Debrunner numbers
- Improvements of the bounds for Ramanujan constant function
- scientific article; zbMATH DE number 3931126
- Improving on the Brun–Titchmarsh theorem
- scientific article; zbMATH DE number 4090096
- An improvement of the Boshier-Nomura bound
- BETTER BOUNDS IN CHEN’S INEQUALITIES FOR THE EULER CONSTANT
- Improvements of Berezin number inequalities
- An upper bound on Korenblum's constant
- Improved bounds for the Erdős-Rogers function
Cites work
- Approximate formulas for some functions of prime numbers
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Explicit upper bounds for the remainder term in the divisor problem
- Hilbert's Inequality
- scientific article; zbMATH DE number 1114496 (Why is no real title available?)
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- Montgomery's weighted sieve for dimension two
- On sums of primes
- Sur une inégalité de Montgomery-Vaughan
- The large sieve
Cited in
(7)- Tight upper and lower bounds for the reciprocal sum of Proth primes
- Two explicit divisor sums
- scientific article; zbMATH DE number 3931126 (Why is no real title available?)
- The reciprocal sum of the amicable numbers
- Sum of reciprocals of germain primes
- scientific article; zbMATH DE number 7556165 (Why is no real title available?)
- Improved upper bound on Brun's constant under GRH
This page was built for publication: Improved Bounds on Brun’s Constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298041)