# Primorial

Not to be confused with primordial (disambiguation).
pn# as a function of n, plotted logarithmically.
n# as a function of n (red dots), compared to n!. Both plots are logarithmic.

In mathematics, and more particularly in number theory, primorial is a function from natural numbers to natural numbers similar to the factorial function, but rather than successively multiplying positive integers, only prime numbers are multiplied.

There are two conflicting definitions that differ in the interpretation of the argument: the first interprets the argument as an index into the sequence of prime numbers (so that the function is strictly increasing), while the second interprets the argument as a bound on the prime numbers to be multiplied (so that the function value at any composite number is the same as at its predecessor). The rest of this article uses the latter interpretation.

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

## Definition for Primorial numbers

For the ${\displaystyle n}$th prime number ${\displaystyle p_{n}}$ the primorial ${\displaystyle p_{n}\#}$ is defined as the product of the first ${\displaystyle n}$ primes:[1][2]

${\displaystyle p_{n}\#\equiv \prod _{k=1}^{n}p_{k}}$,

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

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

The first six primorials ${\displaystyle p_{n}\#}$ are:

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

The sequence also includes ${\displaystyle p_{0}\#=1}$ as empty product. Asymptotically, primorials ${\displaystyle p_{n}\#}$ grow according to:

${\displaystyle p_{n}\#=e^{(1+o(1))n\log n},}$

where ${\displaystyle o(\cdot )}$ is the little-o notation.[2]

## Definition for natural numbers

In general for a positive integer ${\displaystyle n}$, a primorial ${\displaystyle n\#}$ can also be defined, namely as the product of those primes ≤ ${\displaystyle n}$:[1][3]

${\displaystyle n\#\equiv \prod _{i=1}^{\pi (n)}p_{i}=p_{\pi (n)}\#}$,

where ${\displaystyle \pi (n)}$ is the prime-counting function (sequence A000720 in the OEIS), giving the number of primes ≤ ${\displaystyle n}$. This is equivalent to:

${\displaystyle n\#={\begin{cases}1&{\text{if }}n=1\\n\times ((n-1)\#)&{\text{if }}n>1\ \And \ n{\text{ is prime}}\\(n-1)\#&{\text{if }}n>1\ \And \ n{\text{ is composite}}.\end{cases}}}$

For example, ${\displaystyle 12\#}$ represents the product of those primes ≤ 12:

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

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

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

Consider the first 12 primorials ${\displaystyle n\#}$:

1, 2, 6, 6, 30, 30, 210, 210, 210, 210, 2310, 2310.

We see that for composite ${\displaystyle n}$ every term ${\displaystyle n\#}$ simply duplicates the preceding term ${\displaystyle (n-1)\#}$, as given in the definition. In the above example we have that ${\displaystyle 12\#=p_{5}\#=11\#}$ since 12 is a composite number.

The natural logarithm of ${\displaystyle n\#}$ is the first Chebyshev function, written ${\displaystyle \theta (n)}$ or ${\displaystyle \vartheta (n)}$, which approaches the linear ${\displaystyle n}$ for large ${\displaystyle n}$.[4]

Primorials ${\displaystyle n\#}$ grow according to:

${\displaystyle \ln(n\#)\sim n.}$

The idea of multiplying all known primes occurs in some proofs of the infinitude of the prime numbers, where it is used to derive the existence of another prime.

## Applications and properties

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

Every highly composite number is a product of primorials (e.g. 360 = 2·6·30).[5]

Primorials are all square-free integers, and each one has more distinct prime factors than any number smaller than it. For each primorial ${\displaystyle n}$, the fraction ${\displaystyle \phi (n)/n}$ is smaller than for any lesser integer, where ${\displaystyle \phi }$ 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.[6]

The ${\displaystyle n}$-compositorial of a composite number ${\displaystyle n}$ is the product of all composite numbers up to and including ${\displaystyle n}$.[7] The ${\displaystyle n}$-compositorial is equal to the ${\displaystyle n}$-factorial divided by the primorial ${\displaystyle n\#}$. The compositorials are 1, 4, 24, 192, 1728, 17280, 207360, 2903040, 43545600, 696729600, ...[8]

## Appearance

The Riemann zeta function at positive integers greater than one can be expressed[9] by using the primorial and the ${\displaystyle J_{k}(n)}$ Jordan's totient function:

${\displaystyle \zeta (k)={\frac {2^{k}}{2^{k}-1}}+\sum _{r=2}^{\infty }{\frac {(p_{r-1}\#)^{k}}{J_{k}(p_{r}\#)}},\quad k=2,3,\dots }$

## Table of primorials

${\displaystyle n}$ ${\displaystyle n\#}$ ${\displaystyle p_{n}}$ ${\displaystyle p_{n}\#}$
0 1 no prime 1
1 1 2 2
2 2 3 6
3 6 5 30
4 6 7 210
5 30 11 2 310
6 30 13 30 030
7 210 17 510 510
8 210 19 9 699 690
9 210 23 223 092 870
10 210 29 6 469 693 230
11 2 310 31 200 560 490 130
12 2 310 37 7 420 738 134 810
13 30 030 41 304 250 263 527 210
14 30 030 43 13 082 761 331 670 030
15 30 030 47 614 889 782 588 491 410
16 30 030 53 32 589 158 477 190 044 730
17 510 510 59 1 922 760 350 154 212 639 070
18 510 510 61 117 288 381 359 406 970 983 270
19 9 699 690 67 7 858 321 551 080 267 055 879 090
20 9 699 690 71 557 940 830 126 698 960 967 415 390

## Notes

1. ^ a b
2. ^ a b (sequence A002110 in the OEIS)
3. ^ (sequence A034386 in the OEIS)
4. ^
5. ^ "Sloane's A002182 : Highly composite numbers", The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
6. ^ Masser, D.W.; Shiu, P. (1986). "On sparsely totient numbers". Pac. J. Math. 121: 407–426. doi:10.2140/pjm.1986.121.407. ISSN 0030-8730. MR 819198. Zbl 0538.10006.
7. ^ Wells, David (2011). Prime Numbers: The Most Mysterious Figures in Math. John Wiley & Sons. p. 29. ISBN 9781118045718. Retrieved 16 March 2016.
8. ^
9. ^ Mező, István (2013). "The Primorial and the Riemann zeta function". The American Mathematical Monthly 120 (4): 321.

## References

• Dubner, Harvey (1987). "Factorial and primorial primes". J. Recr. Math. 19: 197–203.