Function $n(s)$ is given implicitly as $n! = s$. How can I find an asymptotic for $n(s)$? I cannot understand, how can I make an explicit function from this to calculate an asymptotic, as there is no reverse operation for factorial (I mean, like root is reversal to pow, and so on).
Tell me more
×
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.
|
|
Hint: Use the Stirling Approximation to the factorial. To get information about the growth of $n$ in terms of $s$, you will need asymptotic information about the Lambert function. |
||||
|
|
|
From Stirling's approximation, you know that (for $n\to\infty$) $$s(n) \sim \sqrt{2\pi n} \left( \frac{n}e \right)^n.$$ The task is to invert this asymptotic relation. Note that the dominant part reads $s\sim n^n$, i.e., $\log s \sim n \log n$ and $\log\log s \sim \log n + \log\log n$. As the first term dominates, we obtain the first approximation $$n(s) \sim \log s.$$ A better approximation reads $$n \sim \frac{\log s}{\log\log s}$$ and so on. |
|||
|
|
