Recently, I've been trying to reason about different factorial values.
For example, intuitively, it seems to me that:
$$(n-1)! < \frac{\left(n+\frac{2n}{3}\right)!}{n!}$$
What would be the right approach to demonstrate this?
If I go with induction, the base case is straight forward. This is clearly true for $n=\{3,4,5\}$
For the inductive step, I can prove it holds if $n$ is of form $3i$ or form $3i+2$. I am not able to show it for the case where $n$ is of the form $3i+1$.
If my intuition is correct, what is the easiest way to complete the argument? Would the gamma function, for example, help me here?
If my intuition is not correct, could you show me how to analyze the conditions where it does not hold.
It's not true. By Stirling's formula, $n!\sim \sqrt{2\pi n}\big(\frac{n}{e}\big)^n$, and so $n!(n-1)!=n!^2/n\sim2\pi\big(\frac{n}{e}\big)^{2n}$. But $(5n/3)!\sim\sqrt{10\pi n/3}\big(\frac{5n}{3e}\big)^{5n/3}$. So the ratio of these is about $\big(\frac{n}C\big)^{n/3}$, where $C$ is a constant. This eventually gets much bigger than $1$, so the LHS is eventually larger.
[edit] The first counterexample is $n=31$, where $$30!=265252859812191058636308480000000;$$ $$\frac{51!}{31!}=188635435829605873227261542400000.$$
(The above example rounds down; for rounding to the nearest integer the first counterexample is $n=35$, and for always rounding up it is $n=39$.)