Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
3/4/19. Let 0 < < 1. Define a sequence {an } of real numbers by a1 = 1 and for all
integers k 1,
a2k = ak ,
a2k+1 = (1 )ak .
Find the value of the sum
k=1
Credit This problem was proposed by Sandor Lehoczky, and modified by Dave Patrick.
Create PDF with GO2PDF for free, if you wish to remove this line, click here to buy Virtual PDF Printer
Comments This following solution deftly finds the required sum by directly using the given
recursion relations. Solutions edited by Naoki Sato.
Solution by: Tony Jin (10/CA)
By the definition of {an },
a2k a2k+1 =
[ak (1 )ak ] = (1 )
k=1
X
k=1
k=1
k=1
a2k as follows:
a2k = a21 +
a22k +
= a21 +
2 a2k +
k=1
a21
a22k+1
k=1
k=1
k=1
(1 )2 a2k
k=1
a2k
+ (1 )
a2k
k=1
k=1
= a21 + [2 + (1 )2 ]
a2k .
k=1
Therefore,
[1 2 (1 )2 ]
a2k = a21 ,
k=1
so
X
k=1
a2k
a21
1
=
=
.
2
2
1 (1 )
2(1 )
a2k .
a2k a2k+1 = (1 )
k=1
Create PDF with GO2PDF for free, if you wish to remove this line, click here to buy Virtual PDF Printer
1
a2k = .
2
k=1