Let S be the sum of all values of n < 8 for which n!+1 is a perfect square.
P. S. Instead of using trial and error, i request you to find the solution :)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Its called the Brocard's problem and so far there had been no known way to solve it. If someone solves it, I would love to see the solution. There are only three known numbers that satisfy this condition and they are all strictly less than 8