2016 and factorial 2

Find the sum of all the perfect squares that can be expressed as form ( i = 1 m i ! ) + 2016 \displaystyle \left(\sum_{i=1}^m i! \right)+2016 .

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, 8 ! = 1 × 2 × 3 × × 8 8! = 1\times2\times3\times\cdots\times8 .


The answer is 2025.

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.

1 solution

Suppose that ( i = 1 m i ! ) + 2016 = n 2 \left(\displaystyle\sum_{i=1}^m i!\right) +2016=n^2 with n n is a positive integer.

If m 5 m\le 5 it is easy to check that m = 3 m=3 is the unique solution. In that case, we have: 1 ! + 2 ! + 3 ! + 2016 = 2025 = 4 5 2 1!+2!+3!+2016=2025=45^2

If m 6 m\ge6 , we have ( i = 1 m i ! ) + 2016 5 ( m o d 7 ) \left(\displaystyle\sum_{i=1}^m i!\right) +2016\equiv 5\ (\bmod{7}) , cannot be a perfect square.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...