Let the sequence { a i } i = 0 ∞ be defined by a 0 = 2 1 and a n = 1 + ( a n − 1 − 1 ) 2 .
Find i = 0 ∏ ∞ a i .
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.
Can u explain the second line ?
Log in to reply
As clarification, are you talking about this? i = 0 ∏ n ( 1 + ( − 2 1 ) 2 i ) = k = 0 ∑ 2 n + 1 − 1 ( − 2 1 ) k
Log in to reply
How didi you get this.Can u show some steps
Log in to reply
@Kushal Bose – As I mentioned, it's a fairly direct, though not immediate, induction on n .
As a base case, you may either set n = − 1 , in which both sides equal 1 , or you may, if you don't like empty products, set n = 0 and note both side equal 2 1 .
Then as an inductive step suppose n > − 1 [or n > 0 ] and note that, using the inductive hypothesis, i = 0 ∏ n ( 1 + ( − 2 1 ) 2 i ) = i = 0 ∏ n − 1 ( 1 + ( − 2 1 ) 2 i ) ⋅ ( 1 + ( − 2 1 ) 2 n ) = k = 0 ∑ 2 n − 1 ( − 2 1 ) k ⋅ ( 1 + ( − 2 1 ) 2 n ) = k = 0 ∑ 2 n − 1 ( − 2 1 ) k + k = 0 ∑ 2 n − 1 ( − 2 1 ) k + 2 n = k = 0 ∑ 2 n − 1 ( − 2 1 ) k + k = 2 n ∑ 2 n + 1 − 1 ( − 2 1 ) k = k = 0 ∑ 2 n + 1 − 1 ( − 2 1 ) k .
Problem Loading...
Note Loading...
Set Loading...
Define b n = a n − 1 for each n . Then by induction, we may see b n = ( b n − 1 ) 2 = ⋯ = ( b 0 ) 2 n = ( − 2 1 ) 2 n and then by another induction, i = 0 ∏ n a i = i = 0 ∏ n ( 1 + ( − 2 1 ) 2 i ) = k = 0 ∑ 2 n + 1 − 1 ( − 2 1 ) k = 1 − ( − 2 1 ) 1 − ( − 2 1 ) 2 n + 1 .
Letting n → ∞ gives i = 0 ∏ ∞ a i = n → ∞ lim 1 − ( − 2 1 ) 1 − ( − 2 1 ) 2 n + 1 = 3 / 2 1 = 3 2 ≈ 0 . 6 6 6 7