1

I'm trying to find a simple proof that $n!^{1/n}$ is a divergent sequence. I have proved it using a lower bound you can get from an integral (or Stirling's approximation) that $n!^{1/n}>\ln(n)$, but I get the impression from the other questions I've done that it shouldn't need all that machinery.

Hints would be preferred to full solutions, please

3 Answers3

6

Hint; At least half the terms in the product for $n!$ will be at least $n/2$, so$$n! \geq (n/2)^{n/2}$$ which shows the result.

Matt Rigby
  • 2,316
  • 12
  • 13
2

Since $$(n+1)\log(n+1)-n\log n = n\log(1+1/n)+\log(n+1) \leq 1+\log(n+1)$$ we have: $$\log(n!) \geq 1-n+n\log n$$ hence: $$\log\left(n!^{1/n}\right) \geq \log n-1$$ and $a_n=n!^{1/n}$ satisfies $a_n\geq \frac{n}{e}.$

Jack D'Aurizio
  • 353,855
0

Hint: can you write a polynomial expression for $n!$? What is its lead term?

Jason Knapp
  • 1,669