A Discrete Approach to the Prime Number Theorem (Q4530172)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1747725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Discrete Approach to the Prime Number Theorem |
scientific article; zbMATH DE number 1747725 |
Statements
A Discrete Approach to the Prime Number Theorem (English)
0 references
7 July 2002
0 references
prime number theorem
0 references
sieve method
0 references
difference equation
0 references
primes
0 references
Möbius function
0 references
0.9002647
0 references
0.8961742
0 references
0.89372337
0 references
0.89229107
0 references
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\).
0 references
