Questions tagged [primorial]

For problems involving either the product of the first n primes or the product of all primes up to and including n.

The former definition uses the notation $p_n\#$, while the latter is denoted $n\#$. We also define $p_0\#=1$.

In the first notation we have $$\lim_{n\to\infty}p_n \#^{\frac{1}{p_n}}=e,$$

while in the second, the natural logarithm of the primorials defines the first Chebyshev function.

Every highly composite number (A002182) is a product of primorials.

152 questions
3
votes
1 answer

Is there a lower bound for the nth primorial?

Can $n\#$ (product of all primes less or equal to n) be bounded from below by some lower bound such as $2^n$?
0
votes
0 answers

Primorial asymptote

Is there any asymptotic representation for the primorial, and if it is there is it a consequence of the Riemann hypothesis or is it proved to be true without assumptions.
Nimish
  • 691