The sequence a 1 , a 2 , a 3 , … , a n is defined by a n = a n − 1 + 9 , for each integer n ≥ 2 . If a 1 = 1 1 .
What is the value of a 2 0 1 7 = ?
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.
Thank you for the nice solution.
My pleasure, Hana!
Each term exceeds the previous one by 9 , then a 2 0 1 7 = 9 × 2 0 1 6 + 1 1 = 1 8 1 5 5 .
I multiplied by 2 0 1 6 because a 1 = 1 1 .
Problem Loading...
Note Loading...
Set Loading...
We have a linear recurrence here with a 1 = 1 1 and a 2 = a 1 + 9 = 1 1 + 9 = 2 0 . Taking,
a n = a n − 1 + 9 ;
a n + 1 = a n + 9
in a combination produces a n + 1 = a n + ( a n − a n − 1 ) ⇒ a n + 1 − 2 a n + a n − 1 = 0 with a characteristic equation of r 2 − 2 r + 1 = 0 ⇒ ( r − 1 ) 2 = 0 ⇒ r = 1 . So now our general solution becomes a n = A n + B , ( A , B ∈ R ) .
We can now solve for the constants using our initial conditions a 1 = 1 1 , a 2 = 2 0 :
1 1 = A + B and 2 0 = 2 A + B
which yields A = 9 , B = 2 , or a n = 9 n + 2 . Hence, a 2 0 1 7 = 9 ( 2 0 1 7 ) + 2 = 1 8 , 1 5 5 .