The Number of Primes
- 1 Independent Researcher, Kékkút, Hungary
- 2 Independent Researcher, Kékkút, Hungary
Abstract
It is known that the prime-number-formula at any distance from the origin has a systematic error. It is shown that this error is proportional to the square of the number of primes present up to the square root of the distance. The proposed completion of the prime-number-formula in the present paper eliminates this systematic error. This is achieved by using a quickly converging recursive formula. The remaining error is reduced to a symmetric dispersion of the effective number of primes around the completed prime-number-formula. The standard deviation of the symmetric dispersion at any distance is proportional to the number of primes present up to the square root of the distance. Therefore, the absolute value of the dispersion, relative to the number of primes is approaching zero and the number of primes resulting from the prime-number-formula represents the low limit of the number of primes at any distance.
- Titchmarsh, E.C. (1986) The Theory of the Riemann Zeta-Function. Oxford University Press, New York.
- Pintz, J. (1980) On the Remainder Term of the Prime Number Formula II. On a Theorem of Ingham. Acta Arithmetica, 37, 209-220. https://doi.org/10.4064/aa-37-1-209-220
- Platt, D.J. and Trudgian, T.S. (2021) The Error Term of the Prime Number Theorem. Mathematics of Computation, 90, 871-881. https://doi.org/10.1090/mcom/3583
- Rosser, J.B. and Trudgian, T.S. (1941) Explicit Bounds for Some Functions of Prime Numbers. American Journal of Mathematics, 63, 211-232. https://doi.org/10.2307/2371291
- Rosser, J.B. and Schoenfeld, L. (1962) Approximate Formulas for Some Functions of Primes. Illinois Journal of Mathematics, 6, 64-94. https://doi.org/10.1215/ijm/1255631807
- Green, B. and Tao, T. (2007) The Primes Contain Arbitrary Long Arithmetic Progressions. Annals of Mathematics, 167, 481-547. https://doi.org/10.4007/annals.2008.167.481