Professional Documents
Culture Documents
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 .
X
Find the value of the sum a2k a2k+1 in terms of .
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.
Therefore,
X
[1 2 (1 )2 ] a2k = a21 ,
k=1
so
X a21 1
a2k = 2 2
= .
k=1
1 (1 ) 2(1 )
USA Mathematical Talent Search
Solutions to Problem 3/4/19
www.usamts.org
Create PDF with GO2PDF for free, if you wish to remove this line, click here to buy Virtual PDF Printer