Of course, I can use Stirling's approximation, but for me it is quite interesting, that, if we define $k = (n-1)!$, then the left function will be $(nk)!$, and the right one will be $k! k^{n!}$. I don't think that it is a coincidence. It seems, that there should be smarter solution for this, other than Stirling's approximation.
Which function grows faster: $(n!)!$ or $((n-1)!)!(n-1)!^{n!}$?
7
$\begingroup$
limits
-
0You don't think "what" is a coincidence? – 2012-10-09
-
0I cannot explicitely explain why did I say so. Probably, I just wanted to point that it seems that there should be smarter solution others than Stirling's approximation. But, of course, I can be wrong. – 2012-10-09