Given is the sequence { a n } n ∈ N whose elements are recursively defined by
⎩ ⎨ ⎧ a 0 = 2 a n + 1 = 3 2 ( a n + a n 2 1 ) , n ∈ N
What is the limit a = n → ∞ lim a n of this sequence?
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...
If the limit a exists, it must be a fixed point of the iteration ⇒ ⇒ ⇒ a = ! 3 2 ( a + a 2 1 ) 3 1 a = 3 a 2 2 a 3 = 2 a = 3 2 Now all we have to do is check if the sequence is convergent. Suppose, 3 2 < a n ≤ 2 . Then it follows a n + 1 − a n a n + 1 − 3 2 = 3 2 ( a n + a n 2 1 ) − a n = 3 1 a n 2 2 − a n 3 < 0 = 3 2 ( a n + a n 2 1 ) − 3 2 = 3 a n 2 2 ( a n 3 − 2 2 / 3 3 a n 2 + 1 ) = 3 a n 2 2 ( a n + 2 2 / 3 1 ) ( a n − 3 2 ) 2 > 0 so that 3 2 < a n + 1 < a n ≤ 2 . By proof by induction it follows, that the sequence is bounded and monotonically decreasing, so that it is also convergent. QED.