# Thread: Inequality (Factorial Related)

1. ## Inequality (Factorial Related)

Prove : $\displaystyle (n!)^2 > n^n$ when n is a +ve integer > 2

2. Hi !
Originally Posted by anirban
Prove : $\displaystyle (n!)^2 > n^n$ when n is a +ve integer > 2
$\displaystyle n! = 1\times 2\times 3\cdots (n-1)\times n$ so

\displaystyle \begin{aligned}(n!)^2 &= [1\times 2\times 3\cdots (n-1)\times n]^2\\ &={\color{red}1}\times {\color{blue}1} \times {\color{green}2}\times {\color{magenta}2} \cdots {\color{magenta}(n-1)}\times{\color{green}(n-1)}\times {\color{blue}n}\times {\color{red}n}\end{aligned}

Each term in this product appears twice so we can rewrite it this way

\displaystyle \begin{aligned}(n!)^2 &= \underbrace{\color{red}[1\cdot n]}_{1^{\text{st}}\text{ term}} \times \underbrace{\color{green}[2\cdot (n-1)]}_{2^{\text{nd}}\text{ term}} \cdots \underbrace{\color{magenta}[(n-1)\cdot 2]}_{(n-1)^{\text{th}}\text{ term}}\times \underbrace{\color{blue}[ n\cdot 1]}_{n^{\text{th}}\text{ term}}\end{aligned}

We want to show that $\displaystyle (n!)^2>n^n$ that is $\displaystyle \frac{(n!)^2}{n^n}>1$ for $\displaystyle n>2$. As $\displaystyle n^n=\underbrace{n\times n \cdots n \times n}_{n\text{ terms}}$ also contains $\displaystyle n$ terms, one can write

\displaystyle \begin{aligned}\frac{(n!)^2}{n^n} &= \frac{1\cdot n}{n} \times \frac{2\cdot (n-1)}{n} \cdots \frac{(n-1)\cdot 2}{n}\times \frac{ n\cdot 1}{n}\end{aligned}

Now I claim that each fraction which appears in this product is greater than or equal to 1 and that for $\displaystyle n>2$, there is at least one fraction which is $\displaystyle >1$. If you manage to show this, the conclusion follows. Good luck !

3. Thanks a lot! I felt as if I am looking at some solution book! Great illustration!