2
$\begingroup$

Is anybody know a solution of this problem?

(Sorry, correct question is here.)

$\endgroup$
1
  • 5
    $\begingroup$ m=1, n=0 or 1. For larger n, there is a prime between n/2 and n, which guarantees an unsquared prime factor in the factorial. $\endgroup$ Sep 18, 2010 at 10:17

2 Answers 2

11
$\begingroup$

Bertrand's postulate (http://en.wikipedia.org/wiki/Bertrand%27s_postulate).

$\endgroup$
2
  • $\begingroup$ Not the first time ... I added the Wikipedia reference and thought twice, so was 18 seconds behind Robin. $\endgroup$ Sep 18, 2010 at 10:18
  • $\begingroup$ Sorry Charles! It's an old chestnut though :-) $\endgroup$ Sep 18, 2010 at 10:19
9
$\begingroup$

From Bertrand's postulate it follows swiftly that there are no solutions with $n>1$.

$\endgroup$
1
  • 5
    $\begingroup$ Just to be more detailed for those who may need it: If $p$ be is the largest prime less than $n$ then $p$ divides $n!$, hence $p$ divides $m^2$ so $p^2$ divides $n!$. So $n>=2p$ which contradicts Bertrand's postulate (and the only solutions are the trivial ones). $\endgroup$
    – danseetea
    Sep 18, 2010 at 10:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.