Maths Olympiad Prep

Library / /484 of 520

Algebra Difficulty 7.7 National olympiad, round 2 Find the answer

Given a positive integer nn, find the least λ>0\lambda>0 such that for any x1,xn(0,π2)x_1,\ldots x_n\in \left(0,\frac{\pi}{2}\right), the condition i=1ntanxi=2n2\prod_{i=1}^{n}\tan x_i=2^{\frac{n}{2}} implies i=1ncosxiλ\sum_{i=1}^{n}\cos x_i\le\lambda.

[i]Huang Yumin[/i]

A number or a short expression. Spacing and $ signs are ignored.

Solution

1. **Base Case for n=1 n = 1 :**
- For n=1 n = 1 , the condition is tanx1=212=2 \tan x_1 = 2^{\frac{1}{2}} = \sqrt{2} .
- We need to show cosx113 \cos x_1 \le \frac{1}{\sqrt{3}} .
- Since tanx1=2 \tan x_1 = \sqrt{2} , we have sinx1=23 \sin x_1 = \frac{\sqrt{2}}{\sqrt{3}} and cosx1=13 \cos x_1 = \frac{1}{\sqrt{3}} .
- Therefore, cosx1=1313 \cos x_1 = \frac{1}{\sqrt{3}} \le \frac{1}{\sqrt{3}} , which is true.

2. **Case for n=2 n = 2 :**
- Given tanx1tanx2=2 \tan x_1 \tan x_2 = 2 .
- We need to show cosx1+cosx223 \cos x_1 + \cos x_2 \le \frac{2}{\sqrt{3}} .
- Let α=x1 \alpha = x_1 and β=x2 \beta = x_2 . We need to show that if cosα+cosβ>23 \cos \alpha + \cos \beta > \frac{2}{\sqrt{3}} , then tanαtanβ<2 \tan \alpha \tan \beta < 2 .
- Equivalently, if a=cosα a = \cos \alpha and b=cosβ b = \cos \beta with a+b>23 a + b > \frac{2}{\sqrt{3}} , we need to show (1a21)(1b21)<2 \left(\frac{1}{a^2} - 1\right)\left(\frac{1}{b^2} - 1\right) < 2 .
- To show this, consider a+b=23+ϵ a + b = \frac{2}{\sqrt{3}} + \epsilon for small ϵ \epsilon . Then b=23+ϵa b = \frac{2}{\sqrt{3}} + \epsilon - a .
- We need to show (1a21)(1(23+ϵa)21)2 \left(\frac{1}{a^2} - 1\right)\left(\frac{1}{(\frac{2}{\sqrt{3}} + \epsilon - a)^2} - 1\right) \le 2 .
- This can be verified by taking derivatives and checking the maximum value, which is left as an exercise.

3. **Case for n=3 n = 3 :**
- Given tanx1tanx2tanx3=232=22 \tan x_1 \tan x_2 \tan x_3 = 2^{\frac{3}{2}} = 2\sqrt{2} .
- We need to show cosx1+cosx2+cosx32 \cos x_1 + \cos x_2 + \cos x_3 \le 2 .
- Let α=x1 \alpha = x_1 , β=x2 \beta = x_2 , and γ=x3 \gamma = x_3 . We need to show that if cosα+cosβ+cosγ>2 \cos \alpha + \cos \beta + \cos \gamma > 2 , then tanαtanβtanγ<22 \tan \alpha \tan \beta \tan \gamma < 2\sqrt{2} .
- Equivalently, if a=cosα a = \cos \alpha , b=cosβ b = \cos \beta , and c=cosγ c = \cos \gamma with a+b+c=2 a + b + c = 2 , we need to show (1a21)(1b21)(1c21)2 \left(\frac{1}{a^2} - 1\right)\left(\frac{1}{b^2} - 1\right)\left(\frac{1}{c^2} - 1\right) \le 2 .
- By symmetry and the properties of logarithms, we can assume a=b a = b . Then we need to show (1a21)2(1(22a)21)2 \left(\frac{1}{a^2} - 1\right)^2\left(\frac{1}{(2 - 2a)^2} - 1\right) \le 2 for a(12,1) a \in (\frac{1}{2}, 1) .
- This can be verified by taking derivatives and checking the maximum value, which is left as an exercise.

4. **Induction for n>3 n > 3 :**
- Assume the result holds for n=k n = k . We need to show it holds for n=k+1 n = k + 1 .
- Given tanx1tanx2tanxk+1=2k+12 \tan x_1 \tan x_2 \cdots \tan x_{k+1} = 2^{\frac{k+1}{2}} .
- There must be an xi x_i with tanxi2 \tan x_i \le \sqrt{2} . Remove this xi x_i , and the product of the remaining xj x_j 's is at least 2k2 2^{\frac{k}{2}} .
- By the inductive hypothesis, the sum of the cosines of the remaining xj x_j 's is at most k1 k - 1 .
- Noting that cosxi1 \cos x_i \le 1 , we have i=1k+1cosxi(k1)+1=k \sum_{i=1}^{k+1} \cos x_i \le (k - 1) + 1 = k .

5. Optimality:
- For n3 n \ge 3 , let x1,x2,,xn1 x_1, x_2, \ldots, x_{n-1} be ϵ \epsilon for small ϵ \epsilon and define xn x_n accordingly.
- For n=1,2 n = 1, 2 , let all xi x_i 's be equal.

Thus, the least λ \lambda is n3 \frac{n}{\sqrt{3}} for n=1,2 n = 1, 2 and n1 n - 1 for n3 n \ge 3 .

The final answer is λ=n3 \boxed{ \lambda = \frac{n}{\sqrt{3}} } for n=1,2 n = 1, 2 and λ=n1 \lambda = n - 1 for n3 n \ge 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.