HIGHLIGHTS
- who: Daniel R. Johnston from the (UNIVERSITY) have published the article: Improving bounds on prime counting functions by partial verification of the Riemann hypothesis, in the Journal: (JOURNAL)
- what: Using a recent verification of the Riemann hypothesis up to height 3·1012 the authors provide strong estimates on π(x) and other prime√ counting functions for finite ranges of x. In this direction, the authors prove that (1.1) holds provided x ≥ 2657 and 9.06 log log x x ≤ T. log x Here, T is the largest known value such that the Riemann hypothesis is . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.