26 citations · 60 across the 17 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.NT2022
Sharper bounds for the error term in the Prime Number Theorem
Andrew Fiori, Habiba Kadiri, Joshua Swidinsky
We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function to bounds of the same type on both and .…
math.NT2022
Sharper bounds for the Chebyshev function
Andrew Fiori, Habiba Kadiri, Joshua Swidinsky
We improve the unconditional explicit bounds for the error term in the prime counting function . In particular, we prove that, for all , we have \[ \left| ψ(x)-x \right|…