Difference between revisions of "Prime counting"
From specialfunctionswiki
| Line 10: | Line 10: | ||
</div> | </div> | ||
</div> | </div> | ||
| + | |||
| + | =References= | ||
| + | [http://people.mpim-bonn.mpg.de/zagier/files/doi/10.2307/2975232/fulltext.pdf Newman's short proof of the prime number theorem] | ||
Revision as of 15:30, 4 October 2014
The prime counting function $\pi \colon \mathbb{R} \rightarrow \mathbb{Z}^+$ is defined by the formula $$\pi(x) = \{\mathrm{number \hspace{2pt} of \hspace{2pt} primes} \leq x \}.$$
Properties
Theorem (Prime Number Theorem): The function $\pi(x)$ obeys the formula $$\lim_{x \rightarrow \infty} \dfrac{\pi(x)}{\frac{x}{\log(x)}}.$$
Proof:
