AlgebraDifficulty 7.7National olympiad, round 2Find the answer
Given a positive integer n, find the least λ>0 such that for any x1,…xn∈(0,2π), the condition ∏i=1ntanxi=22n implies ∑i=1ncosxi≤λ.
[i]Huang Yumin[/i]
A number or a short expression. Spacing and $ signs are ignored.
Solution
1. **Base Case for n=1:** - For n=1, the condition is tanx1=221=2. - We need to show cosx1≤31. - Since tanx1=2, we have sinx1=32 and cosx1=31. - Therefore, cosx1=31≤31, which is true.
2. **Case for n=2:** - Given tanx1tanx2=2. - We need to show cosx1+cosx2≤32. - Let α=x1 and β=x2. We need to show that if cosα+cosβ>32, then tanαtanβ<2. - Equivalently, if a=cosα and b=cosβ with a+b>32, we need to show (a21−1)(b21−1)<2. - To show this, consider a+b=32+ϵ for small ϵ. Then b=32+ϵ−a. - We need to show (a21−1)((32+ϵ−a)21−1)≤2. - This can be verified by taking derivatives and checking the maximum value, which is left as an exercise.
3. **Case for n=3:** - Given tanx1tanx2tanx3=223=22. - We need to show cosx1+cosx2+cosx3≤2. - Let α=x1, β=x2, and γ=x3. We need to show that if cosα+cosβ+cosγ>2, then tanαtanβtanγ<22. - Equivalently, if a=cosα, b=cosβ, and c=cosγ with a+b+c=2, we need to show (a21−1)(b21−1)(c21−1)≤2. - By symmetry and the properties of logarithms, we can assume a=b. Then we need to show (a21−1)2((2−2a)21−1)≤2 for a∈(21,1). - This can be verified by taking derivatives and checking the maximum value, which is left as an exercise.
4. **Induction for n>3:** - Assume the result holds for n=k. We need to show it holds for n=k+1. - Given tanx1tanx2⋯tanxk+1=22k+1. - There must be an xi with tanxi≤2. Remove this xi, and the product of the remaining xj's is at least 22k. - By the inductive hypothesis, the sum of the cosines of the remaining xj's is at most k−1. - Noting that cosxi≤1, we have ∑i=1k+1cosxi≤(k−1)+1=k.
5. Optimality: - For n≥3, let x1,x2,…,xn−1 be ϵ for small ϵ and define xn accordingly. - For n=1,2, let all xi's be equal.
Thus, the least λ is 3n for n=1,2 and n−1 for n≥3.
The final answer is λ=3n for n=1,2 and λ=n−1 for n≥3.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.