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.