Brocard's problem asks to find integer values of n for which(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Brocard's problem.

**Physics Forums | Science Articles, Homework Help, Discussion**