Maths Olympiad Prep

Library / HMMT February /1128 of 1302

HMMT February

Algebra Difficulty 5.8 AIME, harder Prove it United States

Problem:
What is the largest real number θ\theta less than π\pi (i.e. θ<π\theta<\pi ) such that
∏k=010cos⁡(2kθ)≠0 \prod_{k=0}^{10} \cos \left(2^{k} \theta\right) \neq 0
and
∏k=010(1+1cos⁡(2kθ))=1? \prod_{k=0}^{10}\left(1+\frac{1}{\cos \left(2^{k} \theta\right)}\right)=1 ?

Solution

Solution:
Answer: 2046π2047\frac{2046 \pi}{2047}

For equality to hold, note that θ\theta cannot be an integer multiple of π\pi (or else sin⁡=0\sin =0 and cos⁡=±1\cos = \pm 1).

Let z=eiθ/2≠±1z=e^{i \theta / 2} \neq \pm 1. Then in terms of complex numbers, we want
∏k=010(1+2z2k+1+z−2k+1)=∏k=010(z2k+z−2k)2z2k+1+z−2k+1 \prod_{k=0}^{10}\left(1+\frac{2}{z^{2^{k+1}}+z^{-2^{k+1}}}\right)=\prod_{k=0}^{10} \frac{\left(z^{2^{k}}+z^{-2^{k}}\right)^{2}}{z^{2^{k+1}}+z^{-2^{k+1}}}
which partially telescopes to
z+z−1z211+z−211∏k=010(z2k+z−2k) \frac{z+z^{-1}}{z^{2^{11}}+z^{-2^{11}}} \prod_{k=0}^{10}\left(z^{2^{k}}+z^{-2^{k}}\right)
Using a classical telescoping argument (or looking at binary representation; if you wish we may note that z−z−1≠0z-z^{-1} \neq 0, so the ultimate telescoping identity holds 222^{2} ), this simplifies to
z+z−1z211+z−211z211−z−211z−z−1=tan⁡(210θ)tan⁡(θ/2) \frac{z+z^{-1}}{z^{2^{11}}+z^{-2^{11}}} \frac{z^{2^{11}}-z^{-2^{11}}}{z-z^{-1}}=\frac{\tan \left(2^{10} \theta\right)}{\tan (\theta / 2)}
Since tan⁡x\tan x is injective modulo π\pi (i.e. π\pi-periodic and injective on any given period), θ\theta works if and only if θ2+ℓπ=1024θ\frac{\theta}{2}+\ell \pi=1024 \theta for some integer ℓ\ell, so θ=2ℓπ2047\theta=\frac{2 \ell \pi}{2047}. The largest value for ℓ\ell such that θ<π\theta<\pi is at ℓ=1023\ell=1023, which gives θ=2046π2047\theta=\frac{2046 \pi}{2047}

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.