n = 1 ∑ ∞ n 2 ( n + 1 ) 2 1 = B π A − C
where A , B and C are integers. Find A + B + C .
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.
S = n = 1 ∑ ∞ n 2 ( n + 1 ) 2 1 = n = 1 ∑ ∞ ( n ( n + 1 ) 1 ) 2 see OR S = n = 1 ∑ ∞ ⎝ ⎜ ⎜ ⎜ ⎛ partial fraction decomposition n 2 1 − 2 ( n 1 − n + 1 1 ) telescoping sum + ( n + 1 ) 2 1 ⎠ ⎟ ⎟ ⎟ ⎞ S = 6 π 2 − 2 + 6 π 2 − 1 = 3 π 2 − 3
Hence, A + B + C = 2 + 3 + 3 = 8
OR S = n = 1 ∑ ∞ ( n ( n + 1 ) 1 ) 2 = n = 1 ∑ ∞ ( n 1 − n + 1 1 ) 2 = n 2 1 − n ( n + 1 ) 2 + ( n + 1 ) 2 1
Problem Loading...
Note Loading...
Set Loading...
S = n = 1 ∑ ∞ n 2 ( n + 1 ) 2 1 = n = 1 ∑ ∞ ( − n 2 + n + 1 2 + n 2 1 + ( n + 1 ) 2 1 ) = − 2 + n = 1 ∑ ∞ n 2 1 + n = 1 ∑ ∞ ( n + 1 ) 2 1 = − 2 + n = 1 ∑ ∞ n 2 1 + n = 1 ∑ ∞ n 2 1 − 1 = 2 n = 1 ∑ ∞ n 2 1 − 3 = 2 ζ ( 2 ) − 3 = 3 π 2 − 3 By partial fraction decomposition (see note) where ζ ( n ) = k = 1 ∑ ∞ k n 1 is Riemann zeta function and ζ ( 2 ) = 6 π 2 .
Therefore, A + B + C = 2 + 3 + 3 = 8 .
Note: Let n 2 ( n + 1 ) 2 1 = n A + n + 1 B + n 2 C + ( n + 1 ) 2 D . Multiplying both sides by n 2 ( n + 1 ) 2 :
A n ( n + 1 ) 2 + B n 2 ( n + 1 ) + C ( n + 1 ) 2 + D n 2 ⟹ C ⟹ D ⟹ 2 A + B ⟹ 3 A + 2 B ⟹ A = − 2 ⟹ B = 1 = 1 = 1 = − 2 = − 2 = 2 Putting n = 0 Putting n = − 1 Putting n = 1 Putting n = 2