6 , 6 + 6 , 6 + 6 + 6 , …
What does this sequence converge to?
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.
You need to show that the sequence converges to 3.
Log in to reply
Proof by induction that a n is bounded above by 3 : a 1 = s q r t ( 6 ) < 3 . If a n ≤ 3 , then a n + 1 = s q r t ( a n + 6 ) ≤ s q r t ( 6 + 3 ) = 3 . Proof that a n is monotonically increasing: If a n ≤ 3 , then a n 2 ≤ 6 + a n ≤ a n + 1 2 . Therefor a n + 1 ≥ a n .
Log in to reply
You got the right idea, but your proof needs some work. For example, why is a n "trivially" increasing"? If a n = 4 , then a n + 1 = 1 0 < 4 . You want to show that a n is bounded above by 3, not just by 6.
Problem Loading...
Note Loading...
Set Loading...
6 + 6 + ⋯ + 6 = x Squring both sides. x 2 = 6 + x x 2 − x − 6 = 0 x = − 2 x = 3 (Note that x ⩾ 0 .)