Author : firstname.lastname@example.org Page 1
Better approximation for π(x) II
Chris De Corte
Beekveldstraat 22 bus 1
Tel: +32 495/75.16.40
Author : email@example.com Page 2
In this document, we will show that:
. [1 − ඨ1 −
] − 7
might be a better approximation for the prime-counting function than ߨሺݔሻ =
[/ݔlnሺݔሻ − 1] proposed by Bernhard Riemann .
prime number theorem (PNT), prime-counting function, asymptotic law of
distribution, Riemann hypothesis, Clay Mathematics.
The following document originated during our study of primes and the reading
about the Riemann hypothesis [2,3].
We were baffled by the fact that the young Riemann had found such a complex
formula as a proposition for to the prime-counting function.
We were curious to find a better formula.
Methods & Techniques
We used Microsoft Excel to do our calculations.
Author : firstname.lastname@example.org Page 3
Below, one can find the calculation results in table form:
Below, one can find the comparative error on a chart:
Author : email@example.com Page 4
1. Our formula gives better results
I would like to thank this publisher, his professional staff and his volunteers for all
the effort they take in reading all the papers coming to them and especially I
would like to thank this reader for reading my paper till the end.
I would like to thank Jens Kruse Andersen, David Eppstein and Renaud Lifchitz
for taking the time to react to my mails.