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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

While reading this post, I stumbled across these definitions (Wiki_german)

$$e = \lim_{n \to \infty} \sqrt[n]{n\#}$$


$$e = \lim_{n \to \infty} (\sqrt[n]{n})^{\pi(n)}.$$

The last one seems interesting, since $ \lim_{n \to \infty} (\sqrt[n]{n})=1$, proven here.

How to prove these?

share|cite|improve this question
In the second one, you can use that $\pi(n)\sim n/\log(n)$ asymptotically. – Raskolnikov Jan 5 '12 at 10:11
Regarding your comment, note that $\pi(n)\to\infty$, so in order for $\sqrt[n]{n}^{\pi(n)}$ to have a finite limit it is necessary for $\sqrt[n]{n}$ to converge to $1$. – Jonas Meyer Jan 5 '12 at 10:13
@Raskolnikov: So infact one doesn't really need $\pi(n)$ to prove it? – draks ... Jan 5 '12 at 13:39
Let's just say that it is an awkward way to rephrase a property of the prime-counting function. Same is probably true for the primoral $n\#$. – Raskolnikov Jan 5 '12 at 13:43
Definitions? Of what are those two formulas "definitions"? Anyway, the product of the primes up to $n$ is asymptotic to $e^n$ - I believe this is at the same level of difficulty as the Prime Number Theorem - that should get you the first equation. – Gerry Myerson Mar 26 '12 at 12:10

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.