Waste less time on Facebook — follow Brilliant.

Brocard's Problem. Is \(n!+1={m}^{2}\)?

Can you show that there exists an integer \(n\) other than 4, 5 and 7 such that \(n!+1={m}^{2}\). In other words, \(n! + 1\) is a perfect square?

Note: this problem is also known as Brocard's Problem and it's still open in list of unsolved math problems.

Note by Arulx Z
1 year, 8 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...