Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm looking for a positive real $n$, given positive real $m>2$. The calculations for $n$ proceed according to the following diagram:

$$ \begin{array}{ccc} m & \rightarrow & 2^m \\ & & \downarrow \\ n & \leftarrow & p_n \# \end{array} $$

To explain, we start with $m$, calculate $2^m$ and solve for $n$ by setting $2^m = p_n\#$. Here, $p_n\#$ is the $n$th primorial, calculated by multiplying the first $n$ primes together. For example, $p_4\# = 2 \cdot 3 \cdot 5 \cdot 7$.

According to Wikipedia's entry on primorials, we have the following bound:

$${p_n}\# = {e^{(1 + o(1))n\ln (n)}}$$

I'm wondering if someone can find a way to estimate $n$, given $m$. Also, I'm hoping that someone can talk me through the steps, because I plan on doing a similar calculation with the primorials.

share|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.