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.
The sum of the first n squares can be written as 6 n ( n + 1 ) ( 2 n + 1 ) so the sum can be written as ∑ n = 1 ∞ 6 ( n + 1 ) ! n ( n + 1 ) ( 2 n + 1 ) The (n+1) and n terms cancel with the factorial and leave behind ∑ n = 1 ∞ 6 ( n − 1 ) ! 2 n + 1
We make a substitution here for k = n-1, making the sum ∑ k = 0 ∞ 6 k ! 2 k + 3 and split up into two separate sums, ∑ k = 0 ∞ 6 k ! 2 k and ∑ k = 0 ∞ 6 k ! 3 . It is known that ∑ k = 0 ∞ k ! 1 is equal to e , so the second sum ∑ k = 0 ∞ 6 k ! ( 3 ) equates to 2 e .
The first sum is equivalent to 0 + ∑ k = 1 ∞ 3 k ! k = ∑ k = 1 ∞ 3 ( k − 1 ) ! 1 or 3 e
Thus our answer is S = 3 e + 2 e = 6 5 e , so ⌊ 1 0 0 S ⌋ = 2 2 6