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(x) Prime counting function
c03de4
Symbol: RiemannHypothesis RH\operatorname{RH} Riemann hypothesis
9d0839
pn=A000040 ⁣(n)p_{n} = \text{A000040}\!\left(n\right)
4fa169
π(n)=A000720 ⁣(n)\pi(n) = \text{A000720}\!\left(n\right)

Basic formulas

3fc797
P={pn:nZ1}\mathbb{P} = \left\{ p_{n} : n \in \mathbb{Z}_{\ge 1} \right\}
04427b
π(x)=#{p:pPandpx}\pi(x) = \# \left\{ p : p \in \mathbb{P} \,\mathbin{\operatorname{and}}\, p \le x \right\}

Numerical values

a3035f
Table of pnp_{n} for 1n2001 \le n \le 200
1e142c
Table of p10np_{{10}^{n}} for 0n240 \le n \le 24
5404ce
Table of π ⁣(10n)\pi\!\left({10}^{n}\right) for 0n270 \le n \le 27

Bounds and inequalities

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

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

2019-11-11 15:50:15.016492 UTC