I need an elementary proof of the fact(that is without using Bertrand's Postulate or something like that): Let $p(n)$ be the largest prime not greater than $n$. Then $p(n)$ will come exactly once in the factorization of $n!$.
Corollary: $n!$ is not a perfect power.