Difference between revisions of "2009 USAMO Problems/Problem 4"

Revision as of 08:47, 13 May 2011

Problem

For $n \ge 2$ let $a_1$ , $a_2$ , ..., $a_n$ be positive real numbers such that

$(a_1+a_2+ ... +a_n)\left( {1 \over a_1} + {1 \over a_2} + ... +{1 \over a_n} \right) \le \left(n+ {1 \over 2} \right) ^2$

Prove that max $(a_1, a_2, ... ,a_n) \le 4 \text{min}\, (a_1, a_2, ... , a_n)$ .

Solution

Assume without loss of generality that $a_1 \geq a_2 \geq \cdots \geq a_n$ . Now we seek to prove that $a_1 \le 4a_n$ .

By the Cauchy-Schwarz Inequality, $\begin{align*} (a_n+a_2+ a_3 + ... +a_{n-1}+a_1)\left({1 \over a_1} + {1 \over a_2} + ... +{1 \over a_n}\right) &\ge \left( \sqrt{a_n \over a_1} + n-2 + \sqrt{a_1 \over a_n} \right)^2 \\ (n+ {1 \over 2})^2 &\ge \left( \sqrt{a_n \over a_1} + n-2 + \sqrt{a_1 \over a_n} \right)^2 \\ n+ {1 \over 2} &\ge n-2 + \sqrt{a_n \over a_1} + \sqrt{a_1 \over a_n} \\ {5 \over 2} &\ge \sqrt{a_n \over a_1} + \sqrt{a_1 \over a_n} \\ {17 \over 4} &\ge {a_n \over a_1} + {a_1 \over a_n} \\ 0 &\ge (a_1 - 4a_n)\left(a_1 - {a_n \over 4}\right) \end{align*}$ Since $a_1 \ge a_n$ , clearly $(a_1 - {a_n \over 4}) > 0$ , dividing yields:

$0 \ge (a_1 - 4a_n) \Longrightarrow 4a_n \ge a_1$

as desired.

Revision as of 20:46, 16 September 2009 (view source) Modularmarc101 (talk \| contribs) (→‎Solution) ← Older edit		Revision as of 08:47, 13 May 2011 (view source) 1=2 (talk \| contribs) Newer edit →
Line 24:		Line 24:

	[[Category:Olympiad Algebra Problems]]		[[Category:Olympiad Algebra Problems]]
		+	[[Category:Olympiad Inequality Problems]]

2009 USAMO (Problems • Resources)
Preceded by Problem 3	Followed by Problem 5
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

Page

Toolbox

Search

Difference between revisions of "2009 USAMO Problems/Problem 4"

Revision as of 08:47, 13 May 2011

Problem

Solution

See Also