Olympiad problems

1995 IMO Shortlist, 4

Find all of the positive real numbers like $ x,y,z,$ such that : 1.) $ x \plus{} y \plus{} z \equal{} a \plus{} b \plus{} c$ 2.) $ 4xyz \equal{} a^2x \plus{} b^2y \plus{} c^2z \plus{} abc$ Proposed to Gazeta Matematica in the 80s by VASILE CÎRTOAJE and then by Titu Andreescu to IMO 1995.

2021 JHMT HS, 5

Tags: optimization , calculus , geometry

For real numbers $x,$ let $T_x$ be the triangle with vertices $(5, 5^3),$ $(8, 8^3),$ and $(x, x^3)$ in $\mathbb{R}^2.$ Over all $x$ in the interval $[5, 8],$ the area of the triangle $T_x$ is maximized at $x = \sqrt{n},$ for some positive integer $n.$ Compute $n.$

KoMaL A Problems 2017/2018, A. 702

Tags: geometry , inequalities , optimization , geometric inequality

Fix a triangle $ABC$. We say that triangle $XYZ$ is elegant if $X$ lies on segment $BC$, $Y$ lies on segment $CA$, $Z$ lies on segment $AB$, and $XYZ$ is similar to $ABC$ (i.e., $\angle A=\angle X, \angle B=\angle Y, \angle C=\angle Z $). Of all the elegant triangles, which one has the smallest perimeter?

1985 Traian Lălescu, 1.2

Tags: geometry , perimeter , optimization , pure geometry

For the triangles of fixed perimeter, find the maximum value of the product of the radius of the incircle with the radius of the excircle.

1979 IMO Shortlist, 20

Tags: algebra , maximization , optimization , lagrange , calculus

Given the integer $n > 1$ and the real number $a > 0$ determine the maximum of $\sum_{i=1}^{n-1} x_i x_{i+1}$ taken over all nonnegative numbers $x_i$ with sum $a.$

2001 Brazil Team Selection Test, Problem 2

Tags: algebra , floor function , optimization

A set $S$ consists of $k$ sequences of $0,1,2$ of length $n$. For any two sequences $(a_i),(b_i)\in S$ we can construct a new sequence $(c_i)$ such that $c_i=\left\lfloor\frac{a_i+b_i+1}2\right\rfloor$ and include it in $S$. Assume that after performing finitely many such operations we obtain all the $3n$ sequences of $0,1,2$ of length $n$. Find the least possible value of $k$.

2015 Middle European Mathematical Olympiad, 3

Tags: permutation , combinatorics , optimization

There are $n$ students standing in line positions $1$ to $n$. While the teacher looks away, some students change their positions. When the teacher looks back, they are standing in line again. If a student who was initially in position $i$ is now in position $j$, we say the student moved for $|i-j|$ steps. Determine the maximal sum of steps of all students that they can achieve.

2021 JHMT HS, 1

Tags: calculus , optimization , function

The value of $x$ in the interval $[0, 2\pi]$ that minimizes the value of $x + 2\cos x$ can be written in the form $a\pi/b,$ where $a$ and $b$ are relatively prime positive integers. Compute $a + b.$

1972 IMO Longlists, 11

Tags: inequality , optimization , maximization

The least number is $m$ and the greatest number is $M$ among $ a_1 ,a_2 ,\ldots,a_n$ satisfying $ a_1 \plus{}a_2 \plus{}...\plus{}a_n \equal{}0$. Prove that \[ a_1^2 \plus{}\cdots \plus{}a_n^2 \le\minus{}nmM\]

1983 IMO Shortlist, 17

Tags: geometry , geometric inequality , optimization , minimization , maximization , point set

Let $P_1, P_2, \dots , P_n$ be distinct points of the plane, $n \geq 2$. Prove that \[ \max_{1\leq i<j\leq n} P_iP_j > \frac{\sqrt 3}{2}(\sqrt n -1) \min_{1\leq i<j\leq n} P_iP_j \]

2021 JHMT HS, 6

Tags: inequalities , optimization

Let $f$ be a function whose domain is $[1, 20]$ and whose range is a subset of $[-100, 100].$ Suppose $\tfrac{f(x)}{y} - \tfrac{f(y)}{x} \leq (x - y)^2$ for all $x$ and $y$ in $[1, 20].$ Compute the largest value of $f(x) - f(y)$ over all such functions $f$ and all $x$ and $y$ in the domain $[1, 20].$

1989 IMO Longlists, 84

Tags: maximization , minimization , optimization , algebra , calculus

Let $ n \in \mathbb{Z}^\plus{}$ and let $ a, b \in \mathbb{R}.$ Determine the range of $ x_0$ for which \[ \sum^n_{i\equal{}0} x_i \equal{} a \text{ and } \sum^n_{i\equal{}0} x^2_i \equal{} b,\] where $ x_0, x_1, \ldots , x_n$ are real variables.

2013 AMC 12/AHSME, 17

Tags: inequalities , algebra , quadratic , am-gm , optimization

Let $a,b,$ and $c$ be real numbers such that \begin{align*} a+b+c &= 2, \text{ and} \\ a^2+b^2+c^2&= 12 \end{align*} What is the difference between the maximum and minimum possible values of $c$? $ \textbf{(A)}\ 2\qquad\textbf{(B)}\ \frac{10}{3}\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ \frac{16}{3}\qquad\textbf{(E)}\ \frac{20}{3} $

1975 IMO Shortlist, 12

Tags: trigonometry , trigonometric inequality , trigonometric identities , inequality , optimization

Consider on the first quadrant of the trigonometric circle the arcs $AM_1 = x_1,AM_2 = x_2,AM_3 = x_3, \ldots , AM_v = x_v$ , such that $x_1 < x_2 < x_3 < \cdots < x_v$. Prove that \[\sum_{i=0}^{v-1} \sin 2x_i - \sum_{i=0}^{v-1} \sin (x_i- x_{i+1}) < \frac{\pi}{2} + \sum_{i=0}^{v-1} \sin (x_i + x_{i+1})\]

2022 JHMT HS, 7

Tags: geometry , optimization , slope

Two rays emanate from the origin $O$ and form a $45^\circ$ angle in the first quadrant of the Cartesian coordinate plane. For some positive numbers $X$, $Y$, and $S$, the ray with the larger slope passes through point $A = (X, S)$, and the ray with the smaller slope passes through point $B = (S, Y)$. If $6X + 6Y + 5S = 600$, then determine the maximum possible area of $\triangle OAB$.

2001 Moldova National Olympiad, Problem 2

Tags: inequality , optimization , inequalities

If $n\in\mathbb N$ and $a_1,a_2,\ldots,a_n$ are arbitrary numbers in the interval $[0,1]$, find the maximum possible value of the smallest among the numbers $a_1-a_1a_2,a_2-a_2a_3,\ldots,a_n-a_na_1$.

1969 IMO Longlists, 46

Tags: geometry , perimeter , polygon , area , optimization

$(NET 1)$ The vertices of an $(n + 1)-$gon are placed on the edges of a regular $n-$gon so that the perimeter of the $n-$gon is divided into equal parts. How does one choose these $n + 1$ points in order to obtain the $(n + 1)-$gon with $(a)$ maximal area; $(b)$ minimal area?

1999 Slovenia National Olympiad, Problem 1

Tags: number theory , optimization

What is the smallest possible value of $\left|12^m-5^n\right|$, where $m$ and $n$ are positive integers?

2017 Junior Balkan Team Selection Tests - Moldova, Problem 8

Tags: combinatorics , grid , operation , optimization , swap , ordering

The bottom line of a $2\times 13$ rectangle is filled with $13$ tokens marked with the numbers $1, 2, ..., 13$ and located in that order. An operation is a move of a token from its cell into a free adjacent cell (two cells are called adjacent if they have a common side). What is the minimum number of operations needed to rearrange the chips in reverse order in the bottom line of the rectangle?

1966 IMO Longlists, 46

Tags: algebra , maximization , optimization , function

Let $a,b,c$ be reals and \[f(a, b, c) = \left| \frac{ |b-a|}{|ab|} +\frac{b+a}{ab} -\frac 2c \right| +\frac{ |b-a|}{|ab|} +\frac{b+a}{ab} +\frac 2c\] Prove that $f(a, b, c) = 4 \max \{\frac 1a, \frac 1b,\frac 1c \}.$