Prove the following:
#1} $\frac12 < \frac1{3n+1} + \frac1{3n+2} + … + \frac1{5n+1} < \frac23$
#2} $\sqrt n < n!^\frac1n \ \forall\ n>2$
Attempt (i) to #1}
Since $\frac{2n+1}{5n+1} < \frac1{3n+1} + \frac1{3n+2} + … + \frac1{5n+1} < \frac{2n+1}{3n+1}$
$ \implies \frac13 < \frac1{3n+1} + \frac1{3n+2} + … + \frac1{5n+1} < 1.$
Attempt (ii) to #1} Since A.M.≥ H.M.
By some calculations, I got $\frac1{3n+1} + \frac1{3n+2} + … + \frac1{5n+1} > \frac25 $
But, from either of the attempts nothing has proved.
And for #2} i have no idea how to get that. Had tried to use A.M.≥G.M.≥H.M.
Any help is really appreciated!
I will show that $n^n<(n!)^2$. Note that that's not true for all $n\in \mathbb N$ as mentioned in the question. That's only true for $n>2$.
Now, note that for any integer $x$ which satisfies $1<x<n$, we have $(x-1)>0$ and $(x-n)<0$, which together gives $(x-1)(x-n)<0$ which implies $n< x\cdot (n-x+1)$. Also, for $x=1$ or $x=n$, we have $n\leq x\cdot (n-x+1)$.
Put $x=1,2,3,\dots ,n$ to get \begin{align*} &n\leq 1\cdot n\\ &n<2\cdot (n-1)\\ &n<3\cdot (n-2)\\ &\dots\\ &\dots\\ &\dots\\ &n\leq n\cdot 1 \end{align*} Multiply these equations to get $n^n<(n!)^2$
This completes the proof.