Explicit estimates of some functions over primes
By Pierre Dusart. 2018
156 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Applied Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/ceb144f2b840fbbfc54dde4b9f480e4a8e13fac0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Dave Platt
- Kevin O'Bryant
- Michael A. Bennett
- Greg Martin
- T. Trudgian
- Andrej Dujella
- Samir Siksek
- Clemens Fuchs
In Applied Mathematics
In Geometry and Topology
- Dave Platt
- Kevin O'Bryant
- Michael A. Bennett
- Greg Martin
- T. Trudgian
- Andrej Dujella
- Samir Siksek
- Clemens Fuchs
Citations in the corpus
- The Riemann hypothesis is true up to 3·1012 (2020, result): “The current best results are due to Dusart [7] and Faber and Kadiri [8] for small values of x, Broadbent et al.”
- Explicit bounds for primes in arithmetic progressions (2018, background): “By way of example, it provides a stronger error bound than Theorem 2 of Trudgian [43] for all 1,474,279,333 ≤ x < 10(621) (and sharpens corresponding results in [4] and [7] in much smaller ranges).”