Brocard's problem.

secondprime

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?

epsi00

and you did not post your proof because you run out of ink? or maybe your computer crashed.

secondprime

I have enough ink but dont know how to write with ink on computer trying to find an error in my proof,so asking about any result related to the problem.

RamaWolf

Using long integer arithmetic, I found (besides n= 4, 5, 7) no other solutions for all n < 100