Primorial

In mathematics, and more particularly in number theory, primorial, denoted by "p n # {\displaystyle p_{n}\#}", is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, the function only multiplies prime numbers.

The name "primorial", coined by Harvey Dubner, draws an analogy to primes similar to the way the name "factorial" relates to factors.

Definition for prime numbers

The primorial p n # {\displaystyle p_{n}\#} is defined as the product of the first n {\displaystyle n} primes:

p n # = ∏ k = 1 n p k , {\displaystyle p_{n}\#=\prod _{k=1}^{n}p_{k},}

where p k {\displaystyle p_{k}} is the ⁠k {\displaystyle k}⁠th prime number. For instance, p 5 # {\displaystyle p_{5}\#} signifies the product of the first 5 primes:

p 5 # = 2 × 3 × 5 × 7 × 11 = 2310. {\displaystyle p_{5}\#=2\times 3\times 5\times 7\times 11=2310.}

The first few primorials p n # {\displaystyle p_{n}\#} are:

1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690... (sequence A002110 in the OEIS).

Asymptotically, primorials grow according to

p n # = e ( 1 + o ( 1 ) ) n log ⁡ n . {\displaystyle p_{n}\#=e^{(1+o(1))n\log n}.}

Definition for natural numbers

In general, for a positive integer ⁠n {\displaystyle n}⁠, its primorial n # {\displaystyle n\#} is the product of all primes less than or equal to ⁠n {\displaystyle n}⁠; that is,

n # = ∏ p ≤ n p prime p = ∏ i = 1 π ( n ) p i = p π ( n ) # , {\displaystyle n\#=\prod _{p\,\leq \,n \atop p\,{\text{prime}}}p=\prod _{i=1}^{\pi (n)}p_{i}=p_{\pi (n)}\#,}

where π ( n ) {\displaystyle \pi (n)} is the prime-counting function (sequence A000720 in the OEIS). This is equivalent to

n # = { 1 if n = 0 , 1 ( n − 1 ) # × n if n is prime ( n − 1 ) # if n is composite . {\displaystyle n\#={\begin{cases}1&{\text{if }}n=0,\ 1\\(n-1)\#\times n&{\text{if }}n{\text{ is prime}}\\(n-1)\#&{\text{if }}n{\text{ is composite}}.\end{cases}}}

For example, 12 # {\displaystyle 12\#} represents the product of all primes no greater than ⁠12 {\displaystyle 12}⁠:

12 # = 2 × 3 × 5 × 7 × 11 = 2310. {\displaystyle 12\#=2\times 3\times 5\times 7\times 11=2310.}

Since π ( 12 ) = 5 {\displaystyle \pi (12)=5}, this can be calculated as:

12 # = p π ( 12 ) # = p 5 # = 2310. {\displaystyle 12\#=p_{\pi (12)}\#=p_{5}\#=2310.}

Consider the first 12 values of the sequence ⁠n # {\displaystyle n\#}⁠:

1 , 2 , 6 , 6 , 30 , 30 , 210 , 210 , 210 , 210 , 2310 , 2310. {\displaystyle 1,2,6,6,30,30,210,210,210,210,2310,2310.}

We see that for composite ⁠n {\displaystyle n}⁠, every term n # {\displaystyle n\#} is equal to the preceding term ⁠( n − 1 ) # {\displaystyle (n-1)\#}⁠. In the above example we have 12 # = p 5 # = 11 # {\displaystyle 12\#=p_{5}\#=11\#} since ⁠12 {\displaystyle 12}⁠ is composite.

Primorials are related to the first Chebyshev function ϑ ( n ) {\displaystyle \vartheta (n)} by

ln ⁡ ( n # ) = ϑ ( n ) . {\displaystyle \ln(n\#)=\vartheta (n).}

Since ϑ ( n ) {\displaystyle \vartheta (n)} asymptotically approaches n {\displaystyle n} for large values of ⁠n {\displaystyle n}⁠, primorials therefore grow according to:

n # = e ( 1 + o ( 1 ) ) n . {\displaystyle n\#=e^{(1+o(1))n}.}

Properties

• For any ⁠n , p ∈ N {\displaystyle n,p\in \mathbb {N} }⁠, n # = p # {\displaystyle n\#=p\#} iff p {\displaystyle p} is the largest prime such that ⁠p ≤ n {\displaystyle p\leq n}⁠.
• Let p k {\displaystyle p_{k}} be the ⁠k {\displaystyle k}⁠th prime. Then p k # {\displaystyle p_{k}\#} has exactly 2 k {\displaystyle 2^{k}} divisors.
• The sum of the reciprocal values of the primorial converges towards a constant ∑ p prime 1 p # = 1 2 + 1 6 + 1 30 + … = 0 . 7052301717918 … {\displaystyle \sum _{p\,{\text{prime}}}{1 \over p\#}={1 \over 2}+{1 \over 6}+{1 \over 30}+\ldots =0{.}7052301717918\ldots } (sequence A064648 in the OEIS)

The Engel expansion of this number results in the sequence of the prime numbers. Griffiths (2015) proved that it is irrational.

• Euclid's proof of his theorem on the infinitude of primes can be paraphrased by saying that, for any prime p {\displaystyle p}, the number p # + 1 {\displaystyle p\#+1} has a prime divisor not contained in the set of primes less than or equal to p {\displaystyle p}.
• ⁠lim n → ∞ n # n = e {\displaystyle \lim _{n\to \infty }{\sqrt[{n}]{n\#}}=e}⁠. For ⁠n < 10 11 {\displaystyle n<10^{11}}⁠, the values are smaller than e {\displaystyle e}, but for larger n {\displaystyle n}, the values of the function exceed e {\displaystyle e} and oscillate infinitely around e {\displaystyle e} later on.
• Since the binomial coefficient ( 2 n n ) {\displaystyle {\tbinom {2n}{n}}} is divisible by every prime between n + 1 {\displaystyle n+1} and ⁠2 n {\displaystyle 2n}⁠, and since ( 2 n n ) ≤ 4 n {\displaystyle {\tbinom {2n}{n}}\leq 4^{n}}, we have the following upper bound: n # ≤ 4 n {\displaystyle n\#\leq 4^{n}}. Using elementary methods, Denis Hanson showed that ⁠n # ≤ 3 n {\displaystyle n\#\leq 3^{n}}⁠. Using more advanced methods, Rosser and Schoenfeld showed that n # ≤ ( 2.763 ) n {\displaystyle n\#\leq (2.763)^{n}}. Furthermore, they showed that for ⁠n ≥ 563 {\displaystyle n\geq 563}⁠, ⁠n # ≥ ( 2.22 ) n {\displaystyle n\#\geq (2.22)^{n}}⁠.

Applications

Primorials play a role in the search for prime numbers in additive arithmetic progressions. For instance, 2236133941 + 23 # {\displaystyle 2236133941+23\#} results in a prime, beginning a sequence of thirteen primes found by repeatedly adding ⁠23 # {\displaystyle 23\#}⁠, and ending with ⁠5136341251 {\displaystyle 5136341251}⁠. 23 # {\displaystyle 23\#} is also the common difference in arithmetic progressions of fifteen and sixteen primes.

Every highly composite number is a product of primorials.

Primorials are all square-free integers, and each one has more distinct prime factors than any number smaller than it. For each primorial ⁠n {\displaystyle n}⁠, the fraction φ ( n ) / n {\displaystyle \varphi (n)/n} is smaller than for any positive integer less than ⁠n {\displaystyle n}⁠, where φ {\displaystyle \varphi } is the Euler totient function.

Any completely multiplicative function is defined by its values at primorials, since it is defined by its values at primes, which can be recovered by division of adjacent values.

Base systems corresponding to primorials (such as base 30, not to be confused with the primorial number system) have a lower proportion of repeating fractions than any smaller base.

Every primorial is a sparsely totient number.

Compositorial

The ⁠n {\displaystyle n}⁠-compositorial of a composite number ⁠n {\displaystyle n}⁠ is the product of all composite numbers up to and including ⁠n {\displaystyle n}⁠. The ⁠n {\displaystyle n}⁠-compositorial is equal to the ⁠n {\displaystyle n}⁠-factorial divided by the primorial ⁠n # {\displaystyle n\#}⁠. The compositorials are

1, 4, 24, 192, 1728, 17280, 207360, 2903040, 43545600, 696729600, ...

Riemann zeta function

The Riemann zeta function at positive integers greater than one can be expressed by using the primorial function and Jordan's totient function ⁠J k {\displaystyle J_{k}}⁠:

ζ ( k ) = 2 k 2 k − 1 + ∑ r = 2 ∞ ( p r − 1 # ) k J k ( p r # ) , k ∈ Z > 1 {\displaystyle \zeta (k)={\frac {2^{k}}{2^{k}-1}}+\sum _{r=2}^{\infty }{\frac {(p_{r-1}\#)^{k}}{J_{k}(p_{r}\#)}},\quad k\in \mathbb {Z} _{>1}}.

Table of primorials

See also

• Bonse's inequality
• Chebyshev function
• Primorial number system
• Primorial prime

Notes

• Dubner, Harvey (1987). "Factorial and primorial primes". J. Recr. Math. 19: 197–203.
• Spencer, Adam "Top 100" Number 59 part 4.