Difference between revisions of "Prime counting function"

Line 1: Line 1:
The '''prime counting function''', denoted <math>\pi</math>, is a [[function]] defined on [[real number]]s.  The quantity <math>\pi(x)</math> is defined as the number of [[positive]] [[prime number]]s less than or equal to <math>x</math>. Gauss first conjectured that the [[prime number theorem]] <math>\leadsto</math> <math>\frac{x}{logx}</math>, or equivalently, <math>\lim_{x\to\infty}\frac{\pi(x)}{\frac{x}{log x}</math>.
+
The '''prime counting function''', denoted <math>\pi</math>, is a [[function]] defined on [[real number]]s.  The quantity <math>\pi(x)</math> is defined as the number of [[positive]] [[prime number]]s less than or equal to <math>x</math>. Gauss first conjectured that the [[prime number theorem]] <math>\leadsto</math> <math>\frac{x}{log x}</math>, or equivalently, <math>\lim_{x\to\infty}\cfrac{\pi(x)}{\cfrac{x}{log x}</math>.
  
 
The function <math>\pi(x)</math> is [[asymptotically equivalent]] to <math>\frac{x}{log x}</math>.  This is the [[prime number theorem]].  It is also asymptotically equivalent to [[Chebyshev's theta function]]. It was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin, working independently.  
 
The function <math>\pi(x)</math> is [[asymptotically equivalent]] to <math>\frac{x}{log x}</math>.  This is the [[prime number theorem]].  It is also asymptotically equivalent to [[Chebyshev's theta function]]. It was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin, working independently.  

Revision as of 13:20, 13 August 2015

The prime counting function, denoted $\pi$, is a function defined on real numbers. The quantity $\pi(x)$ is defined as the number of positive prime numbers less than or equal to $x$. Gauss first conjectured that the prime number theorem $\leadsto$ $\frac{x}{log x}$, or equivalently, $\lim_{x\to\infty}\cfrac{\pi(x)}{\cfrac{x}{log x}$ (Error compiling LaTeX. Unknown error_msg).

The function $\pi(x)$ is asymptotically equivalent to $\frac{x}{log x}$. This is the prime number theorem. It is also asymptotically equivalent to Chebyshev's theta function. It was first proved in 1896 by Jacques Hadamard and by Charles de la Vallée Poussin, working independently.

See also

This article is a stub. Help us out by expanding it.