Primorial (source code)

= Primorial
{title2=$P(x)=\prod_{p\leq x}p$}
{wiki}

The <primorial> up to a real bound $x\geq1$ is the <product> of all <prime numbers> not exceeding $x$:
$$
P(x)=\prod_{p\leq x}p.
$$
For example, $P(10)=2\cdot3\cdot5\cdot7=210$, while $P(11)=2310$. Each <prime factor> occurs once, so a <primorial> is a <squarefree integer>. It stays constant between successive <primes>, and $P(x)=1$ for $1\leq x<2$ by the <empty product> convention.

Its <natural logarithm> is the <Chebyshev theta function>, $\log P(x)=\vartheta(x)$. This converts multiplicative bounds on <primorials> into additive estimates over <primes>. In particular, the <elementary primorial bound> gives $\vartheta(x)\leq x\log4$ for $x\geq1$.