From Bertrand-Chebyshev theorem, if k is a natural there exists at least one prime p such that k<p<2k-2
This prime will divide both (2k-1)! and 2k!.
Now we've got to see to what power it appears which is given by the Legendre function.
![ord_p(n!) = \sum_{k=1}^{\infty} \left[\frac{n}{p^k} \right]](http://alt2.artofproblemsolving.com/Forum/latexrender/pictures/b/4/7/b47b315f42c49acac011f90b5c0304942b8a1390.gif)
So if n = 2k or 2k-1 then
which means
.
That means these primes appear to the power 1 in the prime factorisation of n!. But for a perfect square, every prime appears to an even power.
Hence n! cannot be of the form
with b>1 i.e it cannot be a perfect power of an integer. In particular it cannot be a perfect square.
From Bertrand-Chebyshev theorem, if k is a natural there exists at least one prime p such that k<p<2k-2
This prime will divide both (2k-1)! and 2k!.
Now we've got to see to what power it appears which is given by the Legendre function.
So if n = 2k or 2k-1 then
which means
.
That means these primes appear to the power 1 in the prime factorisation of n!. But for a perfect square, every prime appears to an even power.
Hence n! cannot be of the form
with b>1 i.e it cannot be a perfect power of an integer. In particular it cannot be a perfect square.