AlgebraDifficulty 5.7AIME, harderProve itHong Kong
Let f(n)=∏k=1n(1+4cos2(2n+1kπ)). Prove that f(n) is an integer for all positive integers n.
Solution
We shall prove that f(n)=F2n+1, the (2n+1)th Fibonacci number. Let ζ=e2n+12πi be a primitive (2n+1)th root of unity. Then 1+4cos2(2n+1kπ)=3+2cos(2n+12kπ)=3+2Re(ζk)=3+ζk+ζ−k.
Note that x2n+1−1=k=1∏2n+1(x−ζk)=(x−1)k=1∏n(x−ζk)(x−ζ−k)=(x−1)k=1∏n(x2−(ζk+ζ−k)x+1). Let α=23+5 so that α2−3α+1=0. Putting x=−α, we obtain −α2n+1−1=(−α−1)k=1∏n(α2+(ζk+ζ−k)α+1)=−(α+1)αnk=1∏n(3+ζk+ζ−k). It follows that f(n)=k=1∏n(3+ζk+ζ−k)=αn(α+1)α2n+1+1. Next, the terms of the Fibonacci sequence satisfy F2n+5=F2n+4+F2n+3=2F2n+3+F2n+2=3F2n+3−F2n+1. Letting an=F2n+1, we have the recurrence relation an+2=3an+1−an and the conditions a0=1 and a1=2. Since the roots to λ2−3λ+1=0 are α and α1, the general term is an=Aαn+B⋅αn1 for some constants A and B. Using a0=1 and a1=2, it is easy to deduce an=α+1α⋅αn+α+11⋅αn1=αn(α+1)α2n+1+1=f(n). Therefore, f(n) is an integer for all positive integers n.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.