Brocard's Problem: No Solution for n! Containing Prime^2, n>7?

[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 don't 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

 

[blue_raver22]

I would first commend the individual for their efforts in attempting to solve Brocard's problem. This problem has been a subject of interest for mathematicians for centuries and any progress towards finding a solution is valuable.

However, without a clear and rigorous proof, it is difficult to determine the validity of the claim that there is no solution if n! contains a prime with a power of exactly 2 and n>7. It is important to thoroughly check and verify all steps of the proof to ensure that there are no errors or assumptions made.

Furthermore, it is important to note that the existence of a solution to Brocard's problem is still an open question and has not been proven or disproven yet. Therefore, it is crucial to continue exploring different approaches and strategies in attempting to find a solution rather than focusing on disproving the existence of a solution.

In conclusion, while the individual's efforts are commendable, it is important to approach the problem with caution and continue exploring different avenues in finding a solution to Brocard's problem. Science is a continuous process of learning and discovery, and it is through collaboration and open-mindedness that we can make progress towards solving complex problems such as this one.