Let a, b, c be the sidelengths and S the area of a triangle ABC. Denote $x=a+\frac{b}{2}$, $y=b+\frac{c}{2}$ and $z=c+\frac{a}{2}$. Prove that there exists a triangle with sidelengths x, y, z, and the area of this triangle is $\geq\frac94 S$.

Consider the set of numbers $\{1,10,10^2,10^3, ... 10^{10} \}$. The ratio of the largest element of the set to the sum of the other ten elements of the set is closest to which integer? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 101 $

Given an integer $n\geq 3$, determine the smallest positive number $k$ such that any two points in any $n$-gon (or at its boundary) in the plane can be connected by a polygonal path consisting of $k$ line segments contained in the $n$-gon (including its boundary).

Find the maximum number of subsets from $\left \{ 1,...,n \right \}$ such that for any two of them like $A,B$ if $A\subset B$ then $\left | B-A \right |\geq 3$. (Here $\left | X \right |$ is the number of elements of the set $X$.)

Determine the minimum possible amount of distinct prime divisors of $19^{4n}+4$, for a positive integer $n$.

A [i]Benelux n-square[/i] (with $n\geq 2$) is an $n\times n$ grid consisting of $n^2$ cells, each of them containing a positive integer, satisfying the following conditions: $\bullet$ the $n^2$ positive integers are pairwise distinct. $\bullet$ if for each row and each column we compute the greatest common divisor of the $n$ numbers in that row/column, then we obtain $2n$ different outcomes. (a) Prove that, in each Benelux n-square (with $n \geq 2$), there exists a cell containing a number which is at least $2n^2.$ (b) Call a Benelux n-square [i]minimal[/i] if all $n^2$ numbers in the cells are at most $2n^2.$ Determine all $n\geq 2$ for which there exists a minimal Benelux n-square.

Given a sequence $a_n$: \[ 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, \dots \] (one '1', two '2' and so on) and another sequence $b_n$ such that $a_{b_n}=b_{a_n}$ for all positive integers $n$. It is known that $b_k=1$ for some $k>100$. Prove that $b_m=1$ for all $m>k$.

Determine all polynomials $P(x)$ with real coefficients such that $(x+1)P(x-1)-(x-1)P(x)$ is a constant polynomial.

A gas diffuses one-third as fast as $\ce{O2}$ at $100^{\circ}\text{C}$. This gas could be: $ \textbf{(A)}\hspace{.05in}\text{He (M=4)}\qquad\textbf{(B)}\hspace{.05in}\ce{C2H5F}(\text{M=48})$ $\qquad\textbf{(C)}\hspace{.05in}\ce{C7H12}\text{(M=96)}\qquad\textbf{(D)}\hspace{.05in}\ce{C5F12}\text{(M=288)}\qquad$

If $x$ and $y$ are positive integers, and $x^4+y^4=4721$, find all possible values of $x+y$

How many solutions does the equation system \[\dfrac{x-1}{xy-3}=\dfrac{3-x-y}{7-x^2-y^2} = \dfrac{y-2}{xy-4}\] have? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4 $

In a $n\times n$ table ($n>1$) $k$ unit squares are marked.One wants to rearrange rows and columns so that all the marked unit squares are above the main diagonal or on it.For what maximum $k$ is it always possible?

In the plane the points with integer coordinates are the vertices of unit squares. The squares are coloured alternately black and white (as on a chessboard). For any pair of positive integers $ m$ and $ n$, consider a right-angled triangle whose vertices have integer coordinates and whose legs, of lengths $ m$ and $ n$, lie along edges of the squares. Let $ S_1$ be the total area of the black part of the triangle and $ S_2$ be the total area of the white part. Let $ f(m,n) \equal{} | S_1 \minus{} S_2 |$. a) Calculate $ f(m,n)$ for all positive integers $ m$ and $ n$ which are either both even or both odd. b) Prove that $ f(m,n) \leq \frac 12 \max \{m,n \}$ for all $ m$ and $ n$. c) Show that there is no constant $ C\in\mathbb{R}$ such that $ f(m,n) < C$ for all $ m$ and $ n$.

On the plane is drawn a triangle $ABC$ and a circle $\omega$ passing through the vertex $C$, the midpoints of the sides $AC$ and $BC$ and the point of intersection of the medians of the triangle $ABC$. The point $K$ lies on the circle $\omega$ such that $\angle AKB=90^o$. Using only with a ruler, draw a tangent to the circle $\omega$ at point $K$.

Determine all the integers $n > 1$ such that $$\sum_{i=1}^{n}x_i^2 \ge x_n \sum_{i=1}^{n-1}x_i$$ for all real numbers $x_1, x_2, ... , x_n$.

In the space given three segments $A_1A_2, B_1B_2$ and $C_1C_2$, do not lie in one plane and intersect at a point $P$. Let $O_{ijk}$ be center of sphere that passes through the points $A_i, B_j, C_k$ and $P$. Prove that $O_{111}O_{222}, O_{112}O_{221}, O_{121}O_{212}$ and$O_{211}O_{122}$ intersect at one point. (P.Kozhevnikov)

In the plane we have $16$ lines(not parallel and not concurrents), we have $120$ point(s) of intersections of this lines. Sebastian has to paint this $120$ points such that in each line all the painted points are with colour differents, find the minimum(quantity) of colour(s) that Sebastian needs to paint this points. If we have have $15$ lines(in this situation we have $105$ points), what's the minimum(quantity) of colour(s)?

Let $ABCDEF$ be a convex hexagon and denote by $A',B',C',D',E',F'$ the middle points of the sides $AB$, $BC$, $CD$, $DE$, $EF$ and $FA$ respectively. Given are the areas of the triangles $ABC'$, $BCD'$, $CDE'$, $DEF'$, $EFA'$ and $FAB'$. Find the area of the hexagon. [i]Kvant Magazine[/i]

In one of the hotels of the wellness planet Oxys, there are $2019$ saunas. The managers have decided to accommodate $k$ couples for the upcoming long weekend. We know the following about the guests: if two women know each other then their husbands also know each other, and vice versa. There are several restrictions on the usage of saunas. Each sauna can be used by either men only, or women only (but there is no limit on the number of people using a sauna at once, as long as they are of a single gender). Each woman is only willing to share a sauna with women whom she knows, and each man is only willing to share a sauna with men whom he does not know. What is the greatest possible $k$ for which we can guarantee, without knowing the exact relationships between the couples, that all the guests can use the saunas simultaneously while respecting the restrictions above?

Find all positive integers $n$ for which $$3x^n + n(x + 2) - 3 \geq nx^2$$ holds for all real numbers $x.$

Let $P_1P_2\ldots P_n$ be an $n$-gon such that for all $i,j \in \{1,2,\ldots,n\}$ where $i \neq j$, there exists $k \neq i,j$ such that $\angle P_iP_kP_j = 60^\circ$. Prove that $n=3$.

Find the smallest positive integer $k$ for which there exists a colouring of the positive integers $\mathbb{Z}_{>0}$ with $k$ colours and a function $f:\mathbb{Z}_{>0}\to \mathbb{Z}_{>0}$ with the following two properties: $(i)$ For all positive integers $m,n$ of the same colour, $f(m+n)=f(m)+f(n).$ $(ii)$ There are positive integers $m,n$ such that $f(m+n)\ne f(m)+f(n).$ [i]In a colouring of $\mathbb{Z}_{>0}$ with $k$ colours, every integer is coloured in exactly one of the $k$ colours. In both $(i)$ and $(ii)$ the positive integers $m,n$ are not necessarily distinct.[/i]

Let $BC$ be a fixed chord of a circle $\omega$. Let $A$ be a variable point on the major arc $BC$ of $\omega$. Let $H$ be the orthocenter of $ABC$. The points $D, E$ lie on $AB, AC$ such that $H$ is the midpoint of $DE$. $O_A$ is the circumcenter of $ADE$. Prove that as $A$ varies, $O_A$ lies on a fixed circle.

A [i]short-sighted[/i] rook is a rook that beats all squares in the same column and in the same row for which he can not go more than $60$-steps. What is the maximal amount of short-sighted rooks that don't beat each other that can be put on a $100\times 100$ chessboard.

Let $ABC$ be an acute, scalene triangle, and let $P$ be an arbitrary point in its interior. Let $\mathcal{P}_A$ be the parabola with focus $P$ and directrix $BC$, and define $\mathcal{P}_B$ and $\mathcal{P}_C$ similarly. (a) Show that if $Q$ is an intersection point of $\mathcal{P}_B$ and $\mathcal{P}_C$, then $P$ and $Q$ are on the same side of $AB$, and $P$ and $Q$ are on the same side of $AC$. (b) You are given that $\mathcal{P}_B$ and $\mathcal{P}_C$ intersect at exactly two points. Let $\ell_A$ be the line between these points, and define $\ell_B$ and $\ell_C$ similarly. Show that $\ell_A$, $\ell_B$, and $\ell_C$ concur. [i]Note: A parabola with focus point $X$ and directrix line $\ell$ is the set of all points $Z$ that are the same distance from $X$ and $\ell$.[/i]