Brocard's problem.

  1. Brocard's problem asks to find integer values of n for which
    n! + 1 =m^2 .
    where n! is the factorial.Probably I got a proof that there is no solution if n! contains a prime with power exactly 2 & n>7.....looking for error....anyone else with any result?
    Last edited: Jul 21, 2011
  2. jcsd
  3. and you did not post your proof because you run out of ink? or maybe your computer crashed.
  4. I have enough ink but dont know how to write with ink on computer:smile: trying to find an error in my proof,so asking about any result related to the problem.
  5. Using long integer arithmetic, I found (besides n= 4, 5, 7) no other solutions for all n < 100
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook

Have something to add?