Olympiad problems

2019 LIMIT Category B, Problem 11

Let $S=\{1,2,\ldots,10\}$. Three numbers are chosen with replacement from $S$. If the chosen numbers denote the lengths of sides of a triangle, then the probability that they will form a triangle is: $\textbf{(A)}~\frac{101}{200}$ $\textbf{(B)}~\frac{99}{200}$ $\textbf{(C)}~\frac12$ $\textbf{(D)}~\frac{110}{200}$

2000 AMC 10, 10

Tags: triangle inequality , geometry , inequalities

The sides of a triangle with positive area have lengths $ 4$, $ 6$, and $ x$. The sides of a second triangle with positive area have lengths $ 4$, $ 6$, and $ y$. What is the smallest positive number that is [b]not[/b] a possible value of $ |x \minus{} y|$? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 10$

1991 IMO, 1

Tags: incenter , geometry , triangle inequality , geometric inequality , angle bisector

Given a triangle $ \,ABC,\,$ let $ \,I\,$ be the center of its inscribed circle. The internal bisectors of the angles $ \,A,B,C\,$ meet the opposite sides in $ \,A^{\prime },B^{\prime },C^{\prime }\,$ respectively. Prove that \[ \frac {1}{4} < \frac {AI\cdot BI\cdot CI}{AA^{\prime }\cdot BB^{\prime }\cdot CC^{\prime }} \leq \frac {8}{27}. \]

2011 Sharygin Geometry Olympiad, 4

Tags: geometric transformation , inequalities , triangle inequality , reflection , geometry

Segments $AA'$, $BB'$, and $CC'$ are the bisectrices of triangle $ABC$. It is known that these lines are also the bisectrices of triangle $A'B'C'$. Is it true that triangle $ABC$ is regular?

2010 Oral Moscow Geometry Olympiad, 4

Tags: right triangle , triangle inequality , geometry , isosceles

An isosceles triangle $ABC$ with base $AC$ is given. Point $H$ is the intersection of altitudes. On the sides $AB$ and $BC$, points $M$ and $K$ are selected, respectively, so that the angle $KMH$ is right. Prove that a right-angled triangle can be constructed from the segments $AK, CM$ and $MK$.

2006 AIME Problems, 2

Tags: logarithm , triangle inequality , geometry

The lengths of the sides of a triangle with positive area are $\log_{10} 12$, $\log_{10} 75$, and $\log_{10} n$, where $n$ is a positive integer. Find the number of possible values for $n$.

2017 Kyrgyzstan Regional Olympiad, 1

Tags: triangle inequality , inequalities

$a^3 + b^3 + 3abc \ge\ c^3$ prove that where a,b and c are sides of triangle.

2005 Irish Math Olympiad, 3

Tags: inequalities , geometry , triangle inequality

Prove that the sum of the lengths of the medians of a triangle is at least three quarters of its perimeter.

2013 Online Math Open Problems, 36

Tags: inequalities , triangle inequality , trapezoid , pythagorean theorem , incenter , geometry

Let $ABCD$ be a nondegenerate isosceles trapezoid with integer side lengths such that $BC \parallel AD$ and $AB=BC=CD$. Given that the distance between the incenters of triangles $ABD$ and $ACD$ is $8!$, determine the number of possible lengths of segment $AD$. [i]Ray Li[/i]

2025 Macedonian TST, Problem 5

Tags: geometry , triangle inequality , inequalities

Let $\triangle ABC$ be a triangle with side‐lengths $a,b,c$, incenter $I$, and circumradius $R$. Denote by $P$ the area of $\triangle ABC$, and let $P_1,\;P_2,\;P_3$ be the areas of triangles $\triangle ABI$, $\triangle BCI$, and $\triangle CAI$, respectively. Prove that \[ \frac{abc}{12R} \;\le\; \frac{P_1^2 + P_2^2 + P_3^2}{P} \;\le\; \frac{3R^3}{4\sqrt[3]{abc}}. \]

2012 May Olympiad, 4

Tags: triangle inequality , combinatorial geometry , combinatorics

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

2007 QEDMO 4th, 7

Tags: triangle inequality , inequalities

For any three nonnegative reals $a$, $b$, $c$, prove that $\left|ca-ab\right|+\left|ab-bc\right|+\left|bc-ca\right|\leq\left|b^{2}-c^{2}\right|+\left|c^{2}-a^{2}\right|+\left|a^{2}-b^{2}\right|$. [i]Generalization.[/i] For any $n$ nonnegative reals $a_{1}$, $a_{2}$, ..., $a_{n}$, prove that $\sum_{i=1}^{n}\left|a_{i-1}a_{i}-a_{i}a_{i+1}\right|\leq\sum_{i=1}^{n}\left|a_{i}^{2}-a_{i+1}^{2}\right|$. Here, the indices are cyclic modulo $n$; this means that we set $a_{0}=a_{n}$ and $a_{n+1}=a_{1}$. darij

2016 IFYM, Sozopol, 1

Tags: inequalities , triangle inequality , function , algebra

Find all functions $f: \mathbb{R}^+\rightarrow \mathbb{R}^+$ with the following property: $a,b,$ and $c$ are lengths of sides of a triangle, if and only if $f(a),f(b),$ and $f(c)$ are lengths of sides of a triangle.

2003 AMC 10, 7

Tags: perimeter , inequalities , geometry , congruent triangles , triangle inequality

How many non-congruent triangles with perimeter $ 7$ have integer side lengths? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

2008 District Olympiad, 1

Tags: inequalities , triangle inequality

Let $ \{a_n\}_{n\geq 1}$ be a sequence of real numbers such that $ |a_{n\plus{}1}\minus{}a_n|\leq 1$, for all positive integers $ n$. Let $ \{b_n\}_{n\geq 1}$ be the sequence defined by \[ b_n \equal{} \frac { a_1\plus{} a_2 \plus{} \cdots \plus{}a_n} {n}.\] Prove that $ |b_{n\plus{}1}\minus{}b_n | \leq \frac 12$, for all positive integers $ n$.

2009 IMO, 5

Tags: triangle inequality , induction , functional equation , function

Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths \[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\] (A triangle is non-degenerate if its vertices are not collinear.) [i]Proposed by Bruno Le Floch, France[/i]

2011 AMC 12/AHSME, 22

Tags: ratio , perimeter , geometric series , triangle inequality , inequalities , geometry

Let $T_1$ be a triangle with sides $2011, 2012,$ and $2013$. For $n \ge 1$, if $T_n=\triangle ABC$ and $D,E,$ and $F$ are the points of tangency of the incircle of $\triangle ABC$ to the sides $AB,BC$ and $AC$, respectively, then $T_{n+1}$ is a triangle with side lengths $AD,BE,$ and $CF$, if it exists. What is the perimeter of the last triangle in the sequence $(T_n)$? $ \textbf{(A)}\ \frac{1509}{8} \qquad \textbf{(B)}\ \frac{1509}{32} \qquad \textbf{(C)}\ \frac{1509}{64} \qquad \textbf{(D)}\ \frac{1509}{128} \qquad \textbf{(E)}\ \frac{1509}{256} $

2008 Hungary-Israel Binational, 1

Tags: geometry , triangle inequality , inequalities , perpendicular bisector

Find the largest value of n, such that there exists a polygon with n sides, 2 adjacent sides of length 1, and all his diagonals have an integer length.

2014 Contests, 1

Tags: n-variable inequality , algebra , triangle inequality , induction , inequalities

Let $a_1,\ldots,a_n$ and $b_1\ldots,b_n$ be $2n$ real numbers. Prove that there exists an integer $k$ with $1\le k\le n$ such that $ \sum_{i=1}^n|a_i-a_k| ~~\le~~ \sum_{i=1}^n|b_i-a_k|.$ (Proposed by Gerhard Woeginger, Austria)

1998 Balkan MO, 2

Tags: triangle inequality , inequalities , induction

Let $n\geq 2$ be an integer, and let $0 < a_1 < a_2 < \cdots < a_{2n+1}$ be real numbers. Prove the inequality \[ \sqrt[n]{a_1} - \sqrt[n]{a_2} + \sqrt[n]{a_3} - \cdots + \sqrt[n]{a_{2n+1}} < \sqrt[n]{a_1 - a_2 + a_3 - \cdots + a_{2n+1}}. \] [i]Bogdan Enescu, Romania[/i]

2020 Durer Math Competition Finals, 16

Tags: triangle inequality , trapezoid , geometry

Dora has $8$ rods with lengths $1, 2, 3, 4, 5, 6, 7$ and $8$ cm. Dora chooses $4$ of the rods and uses them to assemble a trapezoid (the $4$ chosen rods must be the $4$ sides). How many different trapezoids can she obtain in this way? Two trapezoids are considered different if they are not congruent.

2010 China Team Selection Test, 2

Tags: floor function , algebra , inequalities , triangle inequality , polynomial

Given positive integer $n$, find the largest real number $\lambda=\lambda(n)$, such that for any degree $n$ polynomial with complex coefficients $f(x)=a_n x^n+a_{n-1} x^{n-1}+\cdots+a_0$, and any permutation $x_0,x_1,\cdots,x_n$ of $0,1,\cdots,n$, the following inequality holds $\sum_{k=0}^n|f(x_k)-f(x_{k+1})|\geq \lambda |a_n|$, where $x_{n+1}=x_0$.