2 0 1 5 2 0 1 6 + 2 0 1 5 2 0 1 6 ⋅ 2 0 1 3 2 0 1 4 + 2 0 1 5 2 0 1 6 ⋅ 2 0 1 3 2 0 1 4 ⋅ 2 0 1 1 2 0 1 2 + ⋯ + 2 0 1 5 2 0 1 6 ⋅ 2 0 1 3 2 0 1 4 ⋅ 2 0 1 1 2 0 1 2 ⋯ 3 4 ⋅ 1 2 = ?
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.
a n = ∏ k = 1 n ( 2 0 1 7 − 2 k ) ∏ k = 1 n ( 2 0 1 8 − 2 k ) , ∀ n ≥ 2 ∴ a n = ∏ k = 1 n ( 2 0 1 7 − 2 k ) ∏ k = 1 n ( 2 0 1 8 − 2 k ) × [ { 2 0 1 7 − 2 k } − { 2 0 1 6 − 2 k } ] = ∏ k = 1 n − 1 ( 2 0 1 7 − 2 k ) ∏ k = 1 n ( 2 0 1 8 − 2 k ) − ∏ k = 1 n ( 2 0 1 7 − 2 k ) ∏ k = 1 n + 1 ( 2 0 1 8 − 2 k ) [ F ( x ) − F ( x − 1 ) f o r m , h e n c e T e l e s c o p i c ] N o w , ∑ n = 2 1 0 0 8 a n = F ( 2 ) − F ( 1 0 0 8 ) = 2 0 1 5 2 0 1 6 × 2 0 1 4 ( T e l e s c o p i c s e r i e s ) ∴ S = ∑ n = 2 1 0 0 8 a n + 2 0 1 5 2 0 1 6 = 2 0 1 6
Problem Loading...
Note Loading...
Set Loading...
Call the expression s 2 0 1 6 .
We prove by induction that s n = n for even n .
When n = 2 , s 2 = 1 2 = 2
Assume s k = k holds true for some even k .
s k + 2 = k + 1 k + 2 + k + 1 k + 2 s k = k + 1 k + 2 ( 1 + k ) = k + 2
Thus by the principle of mathematical induction, we have shown the s n = n or in particular s 2 0 1 6 = 2 0 1 6 .