Given are positive reals $a, b, c$, such that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=3$. Prove that $\frac{\sqrt{a+\frac{b}{c}}+\sqrt{b+\frac{c}{a}}+\sqrt{c+\frac{a}{b}}}{3}\leq \frac{a+b+c-1}{\sqrt{2}}$. [i]Albania[/i]

$N$ boxes are arranged in a circle and are numbered $1,2,3,.....N$ In a clockwise direction. A ball is assigned a number from${1,2,3,....N}$ and is placed in one of the boxes.A round consist of the following; if the current number on the ball is $n$, the ball is moved $n$ boxes in the clockwise direction and the number on the ball is changed to $n+1$ if $n<N$ and to $1$ if $n=N$. Is it possible to choose $N$, the initial number on the ball, and the first position of the ball in such a way that the ball gets back to the same box with the same number on it for the first time after exactly $2020$ rounds

Let \( H \) be the orthocenter of an acute triangle \( ABC \), and let \( AT \) be the diameter of the circumcircle of this triangle. Points \( X \) and \( Y \) are chosen on sides \( AC \) and \( AB \), respectively, such that \( TX = TY \) and \( \angle XTY + \angle XAY = 90^\circ \). Prove that \( \angle XHY = 90^\circ \). [i] Proposed by Matthew Kurskyi[/i]

A natural number is written in each square of an $ m \times n$ chess board. The allowed move is to add an integer $ k$ to each of two adjacent numbers in such a way that non-negative numbers are obtained. (Two squares are adjacent if they have a common side.) Find a necessary and sufficient condition for it to be possible for all the numbers to be zero after finitely many operations.

Consider the L-shaped region formed by three unit squares joined at their sides, as shown below. Two points $A$ and $B$ are chosen independently and uniformly at random from inside this region. The probability that the midpoint of $\overline{AB}$ also lies inside this L-shaped region can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(2.5cm); draw((0,0)--(0,2)--(1,2)--(1,1)--(2,1)--(2,0)--cycle); draw((0,1)--(1,1)--(1,0), dotted); [/asy]

For some positive integer $n$, Katya wrote on the board next to each other numbers $2^n$ and $14^n$ (in this order), thus forming a new number $A$. Can the number $A - 1$ be prime? [i]Proposed by Oleksii Masalitin[/i]

Let $n>2$ be an integer. A deck contains $\frac{n(n-1)}{2}$ cards,numbered \[1,2,3,\cdots , \frac{n(n-1)}{2}\] Two cards form a [i]magic pair[/i] if their numbers are consecutive , or if their numbers are $1$ and $\frac{n(n+1)}{2}$. For which $n$ is it possible to distribute the cards into $n$ stacks in such a manner that, among the cards in any two stacks , there is exactly one [i]magic pair[/i]?

For a convex pentagon, prove that $ \frac{\text{area} (ABC)}{\text{area} (ABCD)} +\frac{\text{area} (CDE)}{\text{area} (BCDE)} <1. $ [i]Dan Ismailescu[/i]

Let $n$ be a positive integer. For a positive integer $m$, we partition the set $\{1, 2, 3,...,m\}$ into $n$ subsets, so that the product of two different elements in the same subset is never a perfect square. In terms of $n$, find the largest positive integer $m$ for which such a partition exists.

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

Prove that for any integer $a$ there exist infinitely many positive integers $n$ such that $a^{2^n}+2^n$ is not a prime. [b]proposed by S. Berlov[/b]

What is the minimum number of planes determined by $6$ points in space which are not all coplanar, and among which no three are collinear?

A square is drawn on a sheet of grid paper on the sides of the cells $ABCD$ with side $8$. Point $E$ is the midpoint of side $BC$, $Q$ is such a point on the diagonal $AC$ such that $AQ: QC = 3: 1$. Find the angle between straight lines $AE$ and $DQ$.

Let $n$ and $k$ be integers satisfying $\binom{2k}{2} + n = 60$. It is known that $n$ days before Evan's 16th birthday, something happened. Compute $60-n$. [i]Proposed by Evan Chen[/i]

Let $C_1$ be a circle with center $O$ and let $B$ and $C$ be points in $C_1$ such that $BOC$ is an equilateral triangle. Let $D$ be the midpoint of the minor arc $BC$ of $C_1$. Let $C_2$ be the circle with center $C$ that passes through $B$ and $O$. Let $E$ be the second intersection of $C_1$ and $C_2$. The parallel to $DE$ through $B$ intersects $C_1$ for second time in $A$. Let $C_3$ be the circumcircle of triangle $AOC$. The second intersection of $C_2$ and $C_3$ is $F$. Show that $BE$ and $BF$ trisect the angle $\angle ABC$.

Let \( n \geq 3 \) be a positive integer. In a convex polygon with \( n \) sides, all the internal bisectors of its \( n \) internal angles are drawn. Determine, as a function of \( n \), the smallest possible number of distinct lines determined by these bisectors.

Given a set of $2^{2016}$ cards with the numbers $1,2, ..., 2^{2016}$ written on them. We divide the set of cards into pairs arbitrarily, from each pair, we keep the card with larger number and discard the other. We now again divide the $2^{2015}$ remaining cards into pairs arbitrarily, from each pair, we keep the card with smaller number and discard the other. We now have $2^{2014}$ cards, and again divide these cards into pairs and keep the larger one in each pair. We keep doing this way, alternating between keeping the larger number and keeping the smaller number in each pair, until we have just one card left. Find all possible values of this final card.

Let $a, b, c$ be the lengths of the sides of a triangle, and let $S$ be it's area. Prove that $$S \le \frac{a^2+b^2+c^2}{4\sqrt3}$$ and the equality is achieved only for an equilateral triangle.

Suppose that the roots of $x^3+3x^2+4x-11=0$ are $a, b,$ and $c,$ and that the roots of $x^3+rx^2+sx+t=0$ are $a+b, b+c,$ and $c+a.$ Find $t.$

Let $ABC$ be a triangle with incenter $I$. Suppose the reflection of $AB$ across $CI$ and the reflection of $AC$ across $BI$ intersect at a point $X$. Prove that $XI$ is perpendicular to $BC$.

We call a triple of natural numbers $(a, b, c)$ [i]square [/i] if they form an arithmetic progression (in exactly this order), the number $b$ is coprime to each of the numbers $a$ and $c$, and the number $abc$ is a perfect square. Prove that for any given a square triple, there is another square triple that has at least one common number with it.

Amber and Brian are playing a game using $2010$ coins. Throughout the game, the coins are divided into a number of piles of at least 1 coin each. A move consists of choosing one or more piles and dividing each of them into two smaller piles. (So piles consisting of only $1$ coin cannot be chosen.) Initially, there is only one pile containing all $2010$ coins. Amber and Brian alternatingly take turns to make a move, starting with Amber. The winner is the one achieving the situation where all piles have only one coin. Show that Amber can win the game, no matter which moves Brian makes.

Prove that pentagon $ ABCDE$ is cyclic if and only if \[\mathrm{d(}E,AB\mathrm{)}\cdot \mathrm{d(}E,CD\mathrm{)} \equal{} \mathrm{d(}E,AC\mathrm{)}\cdot \mathrm{d(}E,BD\mathrm{)} \equal{} \mathrm{d(}E,AD\mathrm{)}\cdot \mathrm{d(}E,BC\mathrm{)}\] where $ \mathrm{d(}X,YZ\mathrm{)}$ denotes the distance from point $ X$ ot the line $ YZ$.

A positive integer is called [i]vaivém[/i] when, considering its representation in base ten, the first digit from left to right is greater than the second, the second is less than the third, the third is bigger than the fourth and so on alternating bigger and smaller until the last digit. For example, $2021$ is [i]vaivém[/i], as $2 > 0$ and $0 < 2$ and $2 > 1$. The number $2023$ is not [i]vaivém[/i], as $2 > 0$ and $0 < 2$, but $2$ is not greater than $3$. a) How many [i]vaivém[/i] positive integers are there from $2000$ to $2100$? b) What is the largest [i]vaivém[/i] number without repeating digits? c) How many distinct $7$-digit numbers formed by all the digits $1, 2, 3, 4, 5, 6$ and $7$ are [i]vaivém[/i]?

Numbers $x,y,z$ are positive integers and satisfy the equation $x+y+z=2013$. (E) a) Find the number of the triplets $(x,y,z)$ that are solutions of the equation (E). b) Find the number of the solutions of the equation (E) for which $x=y$. c) Find the solution $(x,y,z)$ of the equation (E) for which the product $xyz$ becomes maximum.