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.

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 (http://en.wikipedia.org/wiki/Primorial).

$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|improve this question
add comment

1 Answer

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|improve this answer
    
Okay! Thanks a lot for your explanation, I'll use your suggestion. –  Jens Bossaert Aug 25 '12 at 17:34
add comment

Your Answer

 
discard

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.