2
$\begingroup$

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.

$\endgroup$
2
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ Okay! Thanks a lot for your explanation, I'll use your suggestion. $\endgroup$ – Jens Bossaert Aug 25 '12 at 17:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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