A sequence a n is defined as follows:
a 1 = 3 , a k + 1 = 4 a k + 3
If ∑ k = 1 1 0 0 0 lo g 2 ( a k + 1 ) lo g 2 ( a k + 1 + 1 ) 1 can be expressed as n m for positive integers m and n , find m + n .
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.
Good observation to solving the linear recurrence relation, without having to know what the general solution is.
Problem Loading...
Note Loading...
Set Loading...
a k + 1 a k + 1 + 1 ⇒ a k + 1 + 1 ⇒ a 1 + 1 a 2 + 1 a 3 + 1 . . . ⇒ a k + 1 = 4 a k + 3 = 4 a k + 4 = 4 ( a k + 1 ) = 4 = 4 2 = 4 3 = 4 k ⇒ lo g 2 ( a 1 + 1 ) = 2 ⇒ lo g 2 ( a 2 + 1 ) = 4 ⇒ lo g 2 ( a 3 + 1 ) = 6 . . . ⇒ lo g 2 ( a k + 1 ) = 2 k
k = 1 ∑ 1 0 0 0 lo g 2 ( a k + 1 ) lo g 2 ( a k + 1 + 1 ) 1 = k = 1 ∑ 1 0 0 0 4 k ( k + 1 ) 1 = 4 1 k = 1 ∑ 1 0 0 0 ( k 1 − k + 1 1 ) = 4 1 ( k = 1 ∑ 1 0 0 0 k 1 − k = 2 ∑ 1 0 0 1 k 1 ) = 4 1 ( 1 1 − 1 0 0 1 1 ) = 4 1 ( 1 0 0 1 1 0 0 0 ) = 1 0 0 1 2 5 0
⇒ m + n = 1 2 5 1