Olympiad problems

2009 Greece Team Selection Test, 4

Given are $N$ points on the plane such that no three of them are collinear,which are coloured red,green and black.We consider all the segments between these points and give to each segment a [i]"value"[/i] according to the following conditions: [b]i.[/b]If at least one of the endpoints of a segment is black then the segment's [i]"value"[/i] is $0$. [b]ii.[/b]If the endpoints of the segment have the same colour,re or green,then the segment's [i]"value"[/i] is $1$. [b]iii.[/b]If the endpoints of the segment have different colours but none of them is black,then the segment's [i]"value"[/i] is $-1$. Determine the minimum possible sum of the [i]"values"[/i] of the segments.

2009 Greece Team Selection Test, 4

Tags: combinatorics , coloring , minimization , point set , segment

Given are $N$ points on the plane such that no three of them are collinear,which are coloured red,green and black.We consider all the segments between these points and give to each segment a [i]"value"[/i] according to the following conditions: [b]i.[/b]If at least one of the endpoints of a segment is black then the segment's [i]"value"[/i] is $0$. [b]ii.[/b]If the endpoints of the segment have the same colour,re or green,then the segment's [i]"value"[/i] is $1$. [b]iii.[/b]If the endpoints of the segment have different colours but none of them is black,then the segment's [i]"value"[/i] is $-1$. Determine the minimum possible sum of the [i]"values"[/i] of the segments.

1986 IMO Longlists, 8

Tags: 3d geometry , tetrahedron , circumcircle , minimization , geometry

A tetrahedron $ABCD$ is given such that $AD = BC = a; AC = BD = b; AB\cdot CD = c^2$. Let $f(P) = AP + BP + CP + DP$, where $P$ is an arbitrary point in space. Compute the least value of $f(P).$

1997 IMO Shortlist, 26

Tags: inequalities , algebra , minimization , sequence , fibonacci

For every integer $ n \geq 2$ determine the minimum value that the sum $ \sum^n_{i\equal{}0} a_i$ can take for nonnegative numbers $ a_0, a_1, \ldots, a_n$ satisfying the condition $ a_0 \equal{} 1,$ $ a_i \leq a_{i\plus{}1} \plus{} a_{i\plus{}2}$ for $ i \equal{} 0, \ldots, n \minus{} 2.$

1982 IMO Longlists, 4

Tags: algebra , sequence , maximization , minimization , rearrangement

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$

1994 French Mathematical Olympiad, Problem 4

Tags: geometry , triangle , minimization , circumcenter , circumcircle

Find, with proof, the point $P$ in the interior of an acute-angled triangle $ABC$ for which $BL^2+CM^2+AN^2$ is a minimum, where $L,M,N$ are the feet of the perpendiculars from $P$ to $BC,CA,AB$ respectively. [i]Proposed by United Kingdom.[/i]

1990 IMO Longlists, 75

Tags: number theory , divisibility , binary representation , minimization

Let $ n$ be a composite natural number and $ p$ a proper divisor of $ n.$ Find the binary representation of the smallest natural number $ N$ such that \[ \frac{(1 \plus{} 2^p \plus{} 2^{n\minus{}p})N \minus{} 1}{2^n}\] is an integer.

2001 China Team Selection Test, 3

Tags: algebra , function , calculus , polynomial , minimization

Let $F = \max_{1 \leq x \leq 3} |x^3 - ax^2 - bx - c|$. When $a$, $b$, $c$ run over all the real numbers, find the smallest possible value of $F$.

1986 IMO Shortlist, 19

Tags: geometry , 3d geometry , tetrahedron , circumcircle , minimization

A tetrahedron $ABCD$ is given such that $AD = BC = a; AC = BD = b; AB\cdot CD = c^2$. Let $f(P) = AP + BP + CP + DP$, where $P$ is an arbitrary point in space. Compute the least value of $f(P).$

1982 IMO Shortlist, 11

Tags: algebra , sequence , maximization , minimization , rearrangement

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$

1982 IMO Shortlist, 3

Tags: limit , geometric sequence , geometric series , inequality , minimization

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

1987 IMO Longlists, 22

Tags: geometry , circumcircle , triangle , minimization , circumcenter

Find, with proof, the point $P$ in the interior of an acute-angled triangle $ABC$ for which $BL^2+CM^2+AN^2$ is a minimum, where $L,M,N$ are the feet of the perpendiculars from $P$ to $BC,CA,AB$ respectively. [i]Proposed by United Kingdom.[/i]

1973 IMO, 1

Tags: geometry , triangle inequality , minimization , triangle , optimization

A soldier needs to check if there are any mines in the interior or on the sides of an equilateral triangle $ABC.$ His detector can detect a mine at a maximum distance equal to half the height of the triangle. The soldier leaves from one of the vertices of the triangle. Which is the minimum distance that he needs to traverse so that at the end of it he is sure that he completed successfully his mission?

1974 IMO Longlists, 45

Tags: inequality , polynomial , distance , minimization , optimization

The sum of the squares of five real numbers $a_1, a_2, a_3, a_4, a_5$ equals $1$. Prove that the least of the numbers $(a_i - a_j)^2$, where $i, j = 1, 2, 3, 4,5$ and $i \neq j$, does not exceed $\frac{1}{10}.$

1982 IMO Longlists, 53

Tags: limit , geometric sequence , geometric series , inequality , minimization

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

1983 IMO Longlists, 35

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

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 \]

1973 IMO Shortlist, 9

Tags: geometry , 3d geometry , tetrahedron , perimeter , minimization

Let $Ox, Oy, Oz$ be three rays, and $G$ a point inside the trihedron $Oxyz$. Consider all planes passing through $G$ and cutting $Ox, Oy, Oz$ at points $A,B,C$, respectively. How is the plane to be placed in order to yield a tetrahedron $OABC$ with minimal perimeter ?

1974 IMO Shortlist, 4

Tags: inequality , polynomial , distance , minimization , optimization

The sum of the squares of five real numbers $a_1, a_2, a_3, a_4, a_5$ equals $1$. Prove that the least of the numbers $(a_i - a_j)^2$, where $i, j = 1, 2, 3, 4,5$ and $i \neq j$, does not exceed $\frac{1}{10}.$

1973 IMO Shortlist, 14

Tags: geometry , triangle inequality , minimization , triangle , optimization

A soldier needs to check if there are any mines in the interior or on the sides of an equilateral triangle $ABC.$ His detector can detect a mine at a maximum distance equal to half the height of the triangle. The soldier leaves from one of the vertices of the triangle. Which is the minimum distance that he needs to traverse so that at the end of it he is sure that he completed successfully his mission?

1990 IMO Shortlist, 21

Tags: number theory , divisibility , binary representation , minimization

Let $ n$ be a composite natural number and $ p$ a proper divisor of $ n.$ Find the binary representation of the smallest natural number $ N$ such that \[ \frac{(1 \plus{} 2^p \plus{} 2^{n\minus{}p})N \minus{} 1}{2^n}\] is an integer.

1989 IMO Shortlist, 26

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.

1968 IMO Shortlist, 1

Tags: calculus , minimum value , minimization , algebra , function

Two ships sail on the sea with constant speeds and fixed directions. It is known that at $9:00$ the distance between them was $20$ miles; at $9:35$, $15$ miles; and at $9:55$, $13$ miles. At what moment were the ships the smallest distance from each other, and what was that distance ?

1982 IMO, 3

Tags: limit , geometric sequence , geometric series , inequality , minimization

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

1995 IMO Shortlist, 8

Tags: number theory , prime number , inequality , minimization

Let $ p$ be an odd prime. Determine positive integers $ x$ and $ y$ for which $ x \leq y$ and $ \sqrt{2p} \minus{} \sqrt{x} \minus{} \sqrt{y}$ is non-negative and as small as possible.

2018 Brazil Undergrad MO, 5

Tags: algebra , minimum value , minimization , set

Consider the set $A = \left\{\frac{j}{4}+\frac{100}{j}|j=1,2,3,..\right\} $ What is the smallest number that belongs to the $ A $ set?