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 - The Fusion of Science and Community**

# Brocard's problem.

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Brocard's problem.

Loading...

**Physics Forums - The Fusion of Science and Community**