Suppose s t = n → ∞ lim r = 1 ∑ n t 2 r + 1 2 r . Determine s 1 7 s 7 .
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.
Let us denote as s t ( n ) the sum of the first n terms of s t , i.e.:
s t ( n ) = r = 1 ∑ n t 2 r + 1 2 r
Looking at the first terms:
s t ( 1 ) = t 2 + 1 2
s t ( 2 ) = t 2 + 1 2 + t 4 + 1 4 = t 6 + t 4 + t 2 + 1 2 ( t 4 + 2 t 2 + 3 )
s t ( 3 ) = t 2 + 1 2 + t 4 + 1 4 + t 8 + 1 8 = t 1 4 + t 1 2 + t 8 + t 6 + t 4 + t 2 + 1 2 ( t 1 2 + 2 t 1 0 + 3 t 8 + 4 t 6 + 5 t 4 + 6 t 2 + 7 )
As a general formula:
s t ( n ) = t 2 n + 1 − 2 + t 2 n + 1 − 4 + . . . + t 2 + 1 2 [ t 2 n + 1 − 4 + 2 t 2 n + 1 − 6 + 3 t 2 n + 1 − 8 + . . . + ( 2 n − 3 ) t 4 + ( 2 n − 2 ) t 2 + ( 2 n − 1 ) ]
Let us define:
K = t 2 n + 1 − 4 + 2 t 2 n + 1 − 6 + 3 t 2 n + 1 − 8 + . . . + ( 2 n − 3 ) t 4 + ( 2 n − 2 ) t 2 + ( 2 n − 1 )
K t 2 = t 2 n + 1 − 2 + 2 t 2 n + 1 − 4 + 3 t 2 n + 1 − 6 + . . . + ( 2 n − 3 ) t 2 + ( 2 n − 2 ) t 2 + ( 2 n − 1 )
Subtracting them:
K ( t 2 − 1 ) = t 2 n + 1 − 2 + t 2 n + 1 − 4 + . . . + t 2 + 1 − 2 n
K ( t 2 − 1 ) = t 2 − 1 t 2 n + 1 − 1 − 2 n
K = ( t 2 − 1 ) 2 t 2 n + 1 − 1 − 2 n ( t 2 − 1 ) .
So:
s t ( n ) = t 2 n + 1 − 2 + t 2 n + 1 − 4 + . . . t 2 + 1 2 K
s t ( n ) = t 2 − 1 t 2 n + 1 − 1 2 ( t 2 − 1 ) 2 t 2 n + 1 − 1 − 2 n ( t 2 − 1 )
s t ( n ) = t 2 − 1 2 ⋅ t 2 n + 1 − 1 t 2 n + 1 − 1 − 2 n ( t 2 − 1 )
Then, s t will be the limit of s t ( n ) as n goes to ∞ :
s t = n → ∞ lim s t ( n )
s t = t 2 − 1 2 ⋅ n → ∞ lim t 2 n + 1 − 1 t 2 n + 1 − 1 − 2 n ( t 2 − 1 )
It is easy to see that this limit is 1 . Then:
s t = t 2 − 1 2
Thus:
s 7 = 2 4 1 , s 1 7 = 1 4 4 1 , s 1 7 s 7 = 6
This is one of those instances where I'm torn between a solution that explains how one arrives at the calculations (which you provided) and one where there is a "magical formula" which calculates the answer but doesn't provide much insight as to how one can solve this problem.
Your solution shows that a telescoping method would work. In particular, s t ( n ) = t 2 − 1 2 − t 2 n + 1 − 1 2 n + 1 . If we set U ( n + 1 ) = t 2 n + 1 − 1 2 n + 1 , then the n th term can be written as s t ( n ) − s t ( n − 1 ) = − U ( n + 1 ) + U ( n )
Unless you have a lot of experience, it is hard to directly come up with
t 2 r + 1 2 r = − t 2 r + 1 − 1 2 r + 1 + t 2 r − 1 2 r
Log in to reply
We were (not) expected to come up with the same in one of our tests. And after going through it 5-6 times, it feels quite intuitive. I've posted it as a direct solution thus.
Write x = 1 / t so that the sum is given by s t = r = 1 ∑ ∞ 1 + x 2 r 2 r x 2 r . Now log-differentiating the formula 1 − x 2 1 = r = 1 ∏ ∞ ( 1 + x 2 r ) , ( ∣ x ∣ < 1 ) which easily follows by letting n → ∞ to 1 − x 2 n = ( 1 − x 2 ) ( 1 + x 2 ) ( 1 + x 2 2 ) ⋯ ( 1 + x 2 n − 1 ) , we obtain 1 − x 2 2 x = r = 1 ∑ ∞ 1 + x 2 r 2 r x 2 r − 1 , So it follows that s t = 1 − x 2 2 x 2 = t 2 − 1 2 . From this, we easily find that s 7 / s 1 7 = 6 .
Problem Loading...
Note Loading...
Set Loading...
It's not − 1 , so let's make it − 1
s t = n → ∞ lim r = 1 ∑ n t 2 r + 1 2 r = s t = ∑ r = 1 ∞ t 2 r + 1 2 r = s t = ∑ r = 1 ∞ t 2 r + 1 − 1 ( 2 r ) ( t 2 r − 1 ) = s t = ∑ r = 1 ∞ t 2 r + 1 − 1 ( 2 r ) ( t 2 r + 1 − 2 ) = s t = ∑ r = 1 ∞ t 2 r − 1 ( 2 r ) − t 2 r + 1 − 1 2 r + 1 = t 2 − 1 2 . Hence, s 1 7 s 7 = 6