
#1
Jul2111, 12:35 PM

P: 2

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? 



#2
Jul2111, 12:40 PM

P: 84

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




#3
Jul2111, 01:09 PM

P: 2

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.




#4
Jul2511, 09:17 AM

P: 96

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



Register to reply 
Related Discussions  
Brocard's Problem  General Math  13  
Paradox for the existence of 4,5 and 7 using Brocard's problem  Linear & Abstract Algebra  3  
Conjectures by Legendre and Brocard made stronger.  Linear & Abstract Algebra  2  
One Kinematic Problem, One Pendulum Problem, One Wave Problem  Introductory Physics Homework  7  
classic E&M problem: point charge and a charged sphere, how to analyze this problem  Advanced Physics Homework  1 