Math 2.0

statement theorem

Prime number theorem

Statement

Let π(x)\pi(x) be the prime-counting function, and let ln⁡\ln be the natural logarithm. Then lim⁡x→∞π(x)x/ln⁡x=1.\lim_{x \to \infty} \frac{\pi(x)}{x / \ln x} = 1.

Remarks

We write this as π(x)∼x/ln⁡x\pi(x) \sim x / \ln x. An equivalent form: the nn-th prime pnp_n satisfies pn∼nln⁡np_n \sim n \ln n. The logarithmic integral li⁡(x)=∫2xdtln⁡t\operatorname{li}(x) = \int_2^x \frac{dt}{\ln t} gives a better approximation of π(x)\pi(x), with the same limit. For example, π(106)=78498\pi(10^6) = 78498 and 106/ln⁡106≈7238210^6 / \ln 10^6 \approx 72382.

History

Legendre and Gauss conjectured the result from tables of primes, at the end of the 18th century. Hadamard and de la Vallée Poussin proved it independently in 1896, with methods of complex analysis. Selberg and Erdős found elementary proofs in 1949.

Explanations

L1 human

Near a large number xx, about one number in ln⁡x\ln x is prime. For numbers with 100100 digits, ln⁡x≈230\ln x \approx 230, so about one number in 230230 is prime. The theorem makes this rough rule precise.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. Prime-counting function definition
  4. Prime number theorem statement

Sources

  1. Web https://en.wikipedia.org/wiki/Prime_number_theorem, Statement