Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2004 IMO Problems/Problem 4"

(solution)
 
(→‎See also)
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
−
(''Hojoo Lee'') Let <math>n \geq 3</math> be an integer. Let <math>t_1</math>, <math>t_2</math>, ..., <math>t_n</math> be positive real numbers such that  
+
(''Hojoo Lee'') Let <math>n \geq 3</math> be an integer. Let <math>t_1, t_2, \dots , t_n</math> be positive real numbers such that  
  
 
<cmath>n^2 + 1 > \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right).</cmath>
 
<cmath>n^2 + 1 > \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right).</cmath>
Line 15: Line 15:
 
<cmath>\begin{align*}f(n) &:= \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right) \\ &= \left( t_1 + t_2 + ... + t_{n-1} \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_{n-1}} \right) + t_n \sum_{i=1}^{n-1} \frac 1{t_i} + \frac{1}{t_n} \sum_{i=1}^{n-1} t_i + 1\end{align*}</cmath>
 
<cmath>\begin{align*}f(n) &:= \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right) \\ &= \left( t_1 + t_2 + ... + t_{n-1} \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_{n-1}} \right) + t_n \sum_{i=1}^{n-1} \frac 1{t_i} + \frac{1}{t_n} \sum_{i=1}^{n-1} t_i + 1\end{align*}</cmath>
  
−
By [[AM-GM]], <math>\frac{t_n}{t_i} + \frac{t_i}{t_n} \ge 2</math>, so <math>f(n) \ge f(n-1) + 2(n-1) + 1 = f(n-1) + 2n - 1</math>. Then the problem is reduced to proving the statement true for <math>n-1</math> numbers, as desired. <math>\blacksquare</math>
+
By [[AM-GM]], <math>\frac{t_n}{t_i} + \frac{t_i}{t_n} \ge 2</math>, so <math>f(n) \ge f(n-1) + 2(n-1) + 1 = f(n-1) + 2n - 1</math>. Then the problem is reduced to proving the statement true for <math>n-1</math> numbers, as desired.<math>~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\square</math>
  
 
== See also ==
 
== See also ==
 
*<url>viewtopic.php?p=99756#99756 AoPS/MathLinks discussion</url>
 
*<url>viewtopic.php?p=99756#99756 AoPS/MathLinks discussion</url>
 +
 +
{{IMO box|year=2004|num-b=3|num-a=5}}
  
 
[[Category:Olympiad Algebra Problems]]
 
[[Category:Olympiad Algebra Problems]]

Latest revision as of 23:54, 18 November 2023

Problem

(Hojoo Lee) Let $n \geq 3$ be an integer. Let $t_1, t_2, \dots , t_n$ be positive real numbers such that

\[n^2 + 1 > \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right).\]

Show that $t_i$, $t_j$, $t_k$ are side lengths of a triangle for all $i$, $j$, $k$ with $1 \leq i < j < k \leq n$.

Solution

For $n=3$, suppose (for sake of contradiction) that $t_3 = t_2 + t_1 + k$ for $k \ge 0$; then (by Cauchy-Schwarz Inequality)

\begin{align*}10 &> [2(t_1 + t_2) + k]\left(\frac {1}{t_1} + \frac {1}{t_2} + \frac 1{t_1 + t_2 + k}\right) = 2(t_1+t_2)\left(\frac 1{t_1} + \frac{1}{t_2}\right) + \left(\frac{k}{t_1} + \frac k{t_2}\right) + \frac{2t_1 + 2t_2 + k}{t_1 + t_2 + k}\\ &\ge 8 + \left(\frac{k}{t_1} + \frac k{t_2}\right) + 2 - \frac{k}{t_1 + t_2 + k}\\ &= 10 + k\left(\frac{1}{t_1} + \frac {1}{t_2} - \frac{1}{t_1 + t_2+k}\right) \ge 10\end{align*}

so it is true for $n=3$. We now claim the result by induction; for $n \ge 4$, we have

\begin{align*}f(n) &:= \left( t_1 + t_2 + ... + t_n \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_n} \right) \\ &= \left( t_1 + t_2 + ... + t_{n-1} \right) \left( \frac {1}{t_1} + \frac {1}{t_2} + ... + \frac {1}{t_{n-1}} \right) + t_n \sum_{i=1}^{n-1} \frac 1{t_i} + \frac{1}{t_n} \sum_{i=1}^{n-1} t_i + 1\end{align*}

By AM-GM, $\frac{t_n}{t_i} + \frac{t_i}{t_n} \ge 2$, so $f(n) \ge f(n-1) + 2(n-1) + 1 = f(n-1) + 2n - 1$. Then the problem is reduced to proving the statement true for $n-1$ numbers, as desired.$~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\square$

See also

  • <url>viewtopic.php?p=99756#99756 AoPS/MathLinks discussion</url>
2004 IMO (Problems) • Resources
Preceded by
Problem 3 		1 • 2 • 3 • 4 • 5 • 6 Followed by
Problem 5
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2004_IMO_Problems/Problem_4&oldid=204510"