An Approximation of the Prime Counting Function and a New Representation of the Riemann Zeta Function

Determining the exact number of primes at large magnitudes is computationally intensive, making approximation methods (e.g., the logarithmic integral, prime number theorem, Riemann zeta function, Chebyshev’s estimates, etc.) particularly valuable. These methods also offer avenues for number-theoreti...

Full description

Bibliographic Details

Published in:	Mathematics
Main Author:	Timothy Ganesan
Format:	Article
Language:	English
Published:	MDPI AG 2024-08-01
Subjects:	prime-counting approximation prime number theorem Riemann zeta function logarithmic integral
Online Access:	https://www.mdpi.com/2227-7390/12/17/2624