Find the sum of all the perfect squares that can be expressed as form .
If you think that no perfect square satisfies this condition, or there are infinitely many perfect squares that satisfy this condition, submit your answer as 999.
Notation : denotes the factorial notation. For example, .
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.
Suppose that ( i = 1 ∑ m i ! ) + 2 0 1 6 = n 2 with n is a positive integer.
If m ≤ 5 it is easy to check that m = 3 is the unique solution. In that case, we have: 1 ! + 2 ! + 3 ! + 2 0 1 6 = 2 0 2 5 = 4 5 2
If m ≥ 6 , we have ( i = 1 ∑ m i ! ) + 2 0 1 6 ≡ 5 ( m o d 7 ) , cannot be a perfect square.