Fungrim home page

Prime numbers

Table of contents: Basic formulas - Numerical values - Bounds and inequalities

38f111
Symbol: PP — P\mathbb{P} — Prime numbers
0b643d
Symbol: PrimeNumber — pnp_{n} — nth prime number
6c22c8
Symbol: PrimePi — π ⁣(x)\pi\!\left(x\right) — Prime counting function
c03de4
Symbol: RiemannHypothesis — RiemannHypothesis⁡\operatorname{RiemannHypothesis} — Riemann hypothesis

Basic formulas

3fc797
P={pn:n∈Z≥1}\mathbb{P} = \left\{ p_{n} : n \in \mathbb{Z}_{\ge 1} \right\}
04427b
π ⁣(x)=∣{p:p∈P and⁡ p≤x}∣\pi\!\left(x\right) = \left|\left\{ p : p \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \le x \right\}\right|

Numerical values

a3035f
Table of pnp_{n} for 1≤n≤2001 \le n \le 200

Bounds and inequalities

d1ec2d
pn+1<2pnp_{n + 1} \lt 2 p_{n}
69fd4b
π ⁣(2x)−π ⁣(x)≥1\pi\!\left(2 x\right) - \pi\!\left(x\right) \ge 1
8c52de
pn>n(log⁡ ⁣(nlog⁡ ⁣(n))−1)p_{n} \gt n \left(\log\!\left(n \log\!\left(n\right)\right) - 1\right)
6f3cf7
pn<nlog⁡ ⁣(nlog⁡ ⁣(n))p_{n} \lt n \log\!\left(n \log\!\left(n\right)\right)
d898b9
π ⁣(x)>xlog⁡ ⁣(x)\pi\!\left(x\right) \gt \frac{x}{\log\!\left(x\right)}
5258c0
π ⁣(x)<1.25506xlog⁡ ⁣(x)\pi\!\left(x\right) \lt \frac{1.25506 x}{\log\!\left(x\right)}
375afe
∣π ⁣(x)−li⁡ ⁣(x)∣<xlog⁡ ⁣(x)8π\left|\pi\!\left(x\right) - \operatorname{li}\!\left(x\right)\right| \lt \frac{\sqrt{x} \log\!\left(x\right)}{8 \pi}

Copyright (C) Fredrik Johansson and contributors. Fungrim is provided under the MIT license. The source code is on GitHub.

2019-06-18 07:49:59.356594 UTC