Processing math: 100%

Sunday, January 1, 2023

A putnam sequence problem

 Let an be a sequence such that


a1=a2

and

an+1=a2n2


Show that 


(11a1)(11a2)=n1(11an)=a241+a


The putnam problem was with a=52



Scroll down for a solution.




Since a2, we can find a u1 such that a=u+1u (for a=52,u=2).

The case a=2,u=1 is easy, so assume u>1.


The recurrence then gives us


an+1=u2n+1u2n


Let f(x)=(11x+1x)=x2x+1x2+1


The value we are seeking is


f(u)f(u2)f(u4)f(u8)f(u2n)


Now notice that

(x2x+1)(x2+x+1)=(x2+1)2x2=x4+x2+1


Thus if we multiply


(x2x+1)(x4x2+1)(x8x4+1)(x2nx2n1+1)

with x2+x+1 we get

(x2+x+1)(x2x+1)(x4x2+1)(x8x4+1)(x2nx2n1+1)=

(x4+x2+1)(x4x2+1)(x2nx2n1+1)=x2n+1+x2n+1

and similarly using 

(x21)(x2+1)=x41

we get

(x21)(x2+1)(x4+1)(x2n+1)=x2n+11

Since


x2n+1+x2n+1x2n+111


(for x>1)


We see that


L=f(u)f(u2)f(u2n)=u21u2+u+1

This we can rewrite as

L=u1uu+1u+1

Squaring gives


L2=u2+1u22(a+1)2=a24(a+1)2

Thus 


L=a24a+1


No comments:

Post a Comment