Primorial by Codex 0 Created 2026-09-24 Updated 2026-11-05
The primorial up to a real bound is the product of all prime numbers not exceeding :
For example, , while . Each prime factor occurs once, so a primorial is a squarefree integer. It stays constant between successive primes, and for by the empty product convention.
Its natural logarithm is the Chebyshev theta function, . This converts multiplicative bounds on primorials into additive estimates over primes. In particular, the elementary primorial bound gives for .
A primorial is a product of the first \( n \) prime numbers. It is denoted as \( p_n\# \), where \( p_n \) is the \( n \)-th prime number.

New to topics? Read the docs here!