Given a sequence a n with n ∈ N which satisfies
a n + 1 a n + 2 − 2 a n a n + 2 + a n a n + 1 = n ( n + 1 ) ( n + 2 ) 2 a n a n + 1 a n + 2
and given that a 1 = 1 , a 2 = 2 .
Define f ( n ) = ∑ k = 1 n ( − 1 ) k ⋅ ( ∏ i = 1 k ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) k with i , k ∈ N .
Evaluate f ( 2 0 1 8 ) .
This is part of the set Things Get Harder! .
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.
Problem Loading...
Note Loading...
Set Loading...
a n + 1 a n + 2 − 2 a n a n + 2 + a n a n + 1 = n ( n + 1 ) ( n + 2 ) 2 a n a n + 1 a n + 2
Do note that a n = 0 because if a n = 0 , a n + 1 = 0 or a n + 2 = 0 , which could never hold concurrently with a 1 = 0 and a 2 = 0 .
⇒ a n a n + 1 a n + 2 a n + 1 a n + 2 − 2 a n a n + 2 + a n a n + 1 = n ( n + 1 ) ( n + 2 ) 2
a n 1 − a n + 1 2 + a n + 2 1 = n ( n + 1 ) ( n + 2 ) 2
By Partial Fraction Decomposition ,
n ( n + 1 ) ( n + 2 ) 2 = n 1 − n + 1 2 + n + 2 1
a n 1 − a n + 1 2 + a n + 2 1 = n 1 − n + 1 2 + n + 2 1
We deduce that a n = n
Indeed,
a 1 = 1 , a 2 = 2 ,
which is sufficient to prove that the sequence holds.
f ( 2 0 1 8 )
= ∑ k = 1 2 0 1 8 ( − 1 ) k ⋅ ( ∏ i = 1 k ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) k
= ( − 1 ) 1 ⋅ ( ∏ i = 1 1 ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) 1
+ ( − 1 ) 2 ⋅ ( ∏ i = 1 2 ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) 2 + . . .
+ ( − 1 ) 2 0 1 7 ⋅ ( ∏ i = 1 2 0 1 7 ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) 2 0 1 7
+ ( − 1 ) 2 0 1 8 ⋅ ( ∏ i = 1 2 0 1 8 ( a i a i + 1 ) ( − 1 ) i ) ( − 1 ) 2 0 1 8
= − ∏ i = 1 1 ( a i a i + 1 ) ( − 1 ) i 1 + ∏ i = 1 2 ( a i a i + 1 ) ( − 1 ) i + . . . − ∏ i = 1 2 0 1 7 ( a i a i + 1 ) ( − 1 ) i 1 + ∏ i = 1 2 0 1 8 ( a i a i + 1 ) ( − 1 ) i
= − ∏ i = 1 1 ( i ( i + 1 ) ) ( − 1 ) i 1 + ∏ i = 1 2 ( i ( i + 1 ) ) ( − 1 ) i + . . . − ∏ i = 1 2 0 1 7 ( i ( i + 1 ) ) ( − 1 ) i 1 + ∏ i = 1 2 0 1 8 ( i ( i + 1 ) ) ( − 1 ) i
= − 1 ⋅ 2 1 1 + 1 ⋅ 2 1 ⋅ 2 ⋅ 3 + . . . − 1 ⋅ 2 1 ⋅ 2 ⋅ 3 + . . . ⋅ 2 0 1 7 ⋅ 2 0 1 8 1 1 + 1 ⋅ 2 1 ⋅ 2 ⋅ 3 ⋅ . . . ⋅ 2 0 1 7 ⋅ 2 0 1 8 1 ⋅ 2 0 1 8 ⋅ 2 0 1 9
= − 1 ⋅ 2 1 1 + 1 ⋅ 2 1 ⋅ 2 ⋅ 3 − 1 ⋅ 2 1 ⋅ 2 ⋅ 3 ⋅ 3 ⋅ 4 1 1 + . . . − 1 ⋅ 2 1 ⋅ 2 ⋅ 3 ⋅ 3 ⋅ 4 1 + . . . ⋅ 2 0 1 6 ⋅ 2 0 1 7 ⋅ 2 0 1 7 ⋅ 2 0 1 8 1 1 + 1 ⋅ 2 1 ⋅ 2 ⋅ 3 ⋅ 3 ⋅ 4 1 ⋅ . . . ⋅ 2 0 1 7 ⋅ 2 0 1 8 1 ⋅ 2 0 1 8 ⋅ 2 0 1 9
= − 2 1 1 + 3 − 4 1 1 . . . − 2 0 1 8 1 1 + 2 0 1 9
= ( − 2 + 3 ) + ( − 4 + 5 ) + . . . + ( − 2 0 1 8 + 2 0 1 9 )
= 1 ⋅ 2 2 0 1 8
= 1 0 0 9