Can n! be a perfect square when n is an integer greater than 1? (But is it possible, to prove without Bertrand's postulate. Because bertrands postulate is quite a strong result.)
Can n! be a perfect square when n is an integer greater than 1?
23
$\begingroup$
elementary-number-theory
diophantine-equations
factorial
square-numbers
-
2See [this](http://mathforum.org/library/drmath/view/54290.html). – 2010-11-30
-
0@J.M.: I found the resolution very complex. Honestly, I could not understand it. – 2010-11-30
-
1Actually, the link J. M. pointed to has the answer in the first paragraph — and it's the same as the two answers posted below. The rest of the page is a proof of Bertrand's postulate itself. – 2010-12-01
-
0@ShreevatsaR: You're right. Thank you for participating. Thank you all. – 2010-12-01
-
2Is there a proof of this fact which does not use Bertrand's postulate? – 2012-03-01
-
0Another related question: http://math.stackexchange.com/questions/1812580/is-sqrtn-a-natural-number – 2016-09-19