Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

As big- and little-o notation are a little too technical to me, I prefer an expression with asymptotic equivalence ($\sim$). However, how does one "translate" this expression to an asymptotic equivalence? It's about the primorials, as found on Wikipedia (

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

Is it possible to express this using $\sim$-notation?
Help is greatly appreciated.

share|cite|improve this question
up vote 2 down vote accepted

You can't, at least not directly, since we have $e^{n\cdot\log{n}}\nsim e^{(1+1/n)\cdot n\cdot\log{n}}=e^{n\cdot\log{n}}\cdot n$.

You can say something like $\log(p_n\#)\sim n\cdot\log{n}$, though.

share|cite|improve this answer
Okay! Thanks a lot for your explanation, I'll use your suggestion. – Jens Bossaert Aug 25 '12 at 17:34

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.