I'm looking for the limit
$$\lim_{x \to \infty} \left[[(x+1)!]^\frac{1}{1+x} - (x!)^\frac{1}{x}\right].$$
I've put the above in a computer program, and evaluated it at very high values of $x$ (at $x = 100\text{ }000$, it is approximately $0.367881$). The value seems to be caving in to $1/e$, which is $0.3678794412\ldots$
That makes sense, as $e$ has an expansion related to factorial. However I'm stuck trying to figure out a proof if there is any. Thanks for any help.
By Stirling's Approximation, we have $$x! \approx \sqrt{2 \pi x} \left(\frac{x}{e}\right)^x,$$ and so for large $n$ $$(x!)^{1 / x} \approx (2 \pi)^{1 / 2x} x^{1 / x} \frac{x}{e}.$$ Thus, $$[(x + 1)!]^{1 / (x + 1)} - (x!)^{1 / x} \approx (2 \pi)^{1 / 2(x + 1)} (x + 1)^{1 / (x + 1)} \frac{(x + 1)}{e} - (2 \pi)^{1 / 2x} x^{1 / x} \frac{x}{e}.$$ Now, $(2 \pi)^{1 / 2x} x^{1 / x} \to 1$ as $x \to \infty$, so we have that $$[(x + 1)!]^{1 / (x + 1)} - (x!)^{1 / x} \approx \frac{x + 1}{e} - \frac{x}{e} = \frac{1}{e}.$$
Stirling's approximation has error $O\left(\frac{1}{x}\right)$ (and in fact is very good even for modestly small $x$), and hence we can translate the above asymptotic approximations to prove rigorously the desired limit $$\lim_{n \to \infty} \left[ [(x + 1)!]^{1 / (x + 1)} - (x!)^{1 / x} \right] = \frac{1}{e}.$$