Define two sequences { a n } and { b n } by the recursive system
a 0 = 4 , b 0 = 2 5 , a n + 1 = 2 a n + b n , b n + 1 = a n 1 + b n 1 2 .
What is n → ∞ lim a 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.
Problem Loading...
Note Loading...
Set Loading...
We notice that
a n × b n = a 0 × b 0 = 1 0 0 ∀ n ∈ Z + … e q u a t i o n { 1 }
We plot the sequences { a n } and { b n } on the number line.
Thus for given points
a n and b n ( b n < a n , n ≥ 1 ) , a n + 1 is the midpoint of a n and b n while b n + 1 is less than a n + 1 (since H.M.<A.M.) and is closer to b n than to a n .
Continuing further, a n + 2 is the midpoint of a n + 1 and b n + 1 and similarly b n + 2 is closer to b n + 1 than a n + 1 .
We observe that a i and b i come close to each other as i increases and both sequences converge to a single point when i becomes large. Hence, we concude:
n → ∞ lim a n = n → ∞ lim b n = k
From the equation { 1 } , we get:
k 2 = 1 0 0
⇒ k = 1 0