A Discrete Approach to the Prime Number Theorem
In this paper it is derived by heuristic arguments that \(\pi(N)\), the number of primes not exceeding \(N\), is approximately \(S(N)=N\prod_{p\leq \sqrt{N}}(1-1/p)+\pi(\sqrt{N})-1\). It is also pointed out in the paper that \(S(N)\) gives a better approximation to \(\pi(N)\) than \(N/\log N\) if \(N\leq 10^4.\) However this could not be true for large \(N\), since Mertens' theorem gives \(S(N)\sim 2e^{-\gamma}N/\log N\) where \(\gamma=0.577...\) is Euler's constant, which contradicts the prime number theorem \(\pi(N)\sim N/\log N\) as \(N\to \infty\).
- scientific article; zbMATH DE number 3105564
- scientific article; zbMATH DE number 4068999
- A generalization of the prime number theorem
- A heuristic for the prime number theorem
- scientific article; zbMATH DE number 3116710
- The prime number theorem via the large sieve
- Number theory. An introduction via the distribution of primes
- scientific article; zbMATH DE number 3027446
This page was built for publication: A Discrete Approach to the Prime Number Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530172)
