For each positive integer n, let
fn(ϑ)=sinϑ⋅sin(2ϑ)⋅sin(4ϑ)⋯sin(2nϑ). For all real ϑ
and all n, prove that
∣fn(ϑ)∣≤32∣fn(π/3)∣.
Solution (official)
We prove that
g(ϑ)=∣sinϑ∣∣sin(2ϑ)∣1/2 attains its
maximum value (3/2)3/2 at points 2kπ/3 (where k is a
positive integer). This can be seen by using derivatives or a
classical bound like
g(ϑ)=∣sinϑ∣∣sin(2ϑ)∣1/2=432(4∣sinϑ∣⋅∣sinϑ∣⋅∣sinϑ∣⋅∣3cosϑ∣)2≤432⋅43sin2ϑ+3cos2ϑ=(23)3/2.
Hence
fn(π/3)fn(ϑ)=g(π/3)⋅g(2π/3)1/2⋅g(4π/3)3/4⋯g(2n−1π/3)Eg(ϑ)⋅g(2ϑ)1/2⋅g(4ϑ)3/4⋯g(2n−1ϑ)E⋅sin(2nπ/3)sin(2nϑ)1−E/2≤sin(2nπ/3)sin(2nϑ)1−E/2≤(3/21)1−E/2≤32.
where E=32(1−(−1/2)n). This is exactly the bound we
had to prove.
How the field did
contestants scored
182
average (of 20)
0.99
solved (≥ 80%)
3.8%
near-0 (≤ 10%)
94.0%
discrimination
0.13
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.