Primorial
In mathematics, and more particularly in number theory, primorial, denoted by "", 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 is defined as the product of the first primes:where is the -th prime number. For instance, signifies the product of the first 5 primes:
The first few primorials are:
Asymptotically, primorials grow according to
Definition for natural numbers
In general, for a positive integer, its primorial is the product of all primes less than or equal to ; that is,where is the prime-counting function. This is equivalent to
For example, represents the product of all primes no greater than 12:
Since, this can be calculated as:
Consider the first 12 values of the sequence :
We see that for composite, every term is equal to the preceding term. In the above example we have since 12 is composite.
Primorials are related to the first Chebyshev function by
Since asymptotically approaches for large values of, primorials therefore grow according to:
Properties
- For any, iff is the largest prime such that.
- Let be the -th prime. Then has exactly divisors.
- The sum of the reciprocal values of the primorial converges towards a constant
- Euclid's proof of his theorem on the infinitude of primes can be paraphrased by saying that, for any prime, the number has a prime divisor not contained in the set of primes less than or equal to.
- . For, the values are smaller than, but for larger, the values of the function exceed and oscillate infinitely around later on.
- Since the binomial coefficient is divisible by every prime between and, and since, we have the following upper bound:.
- *Using elementary methods, Denis Hanson showed that.
- * Using more advanced methods, Rosser and Schoenfeld showed that. Furthermore, they showed that for,.
Applications
results in a prime, beginning a sequence of thirteen primes found by repeatedly adding, and ending with. 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, the fraction is smaller than for any positive integer less than, where 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 have a lower proportion of repeating fractions than any smaller base.
Every primorial is a sparsely totient number.