In triangle $ABC$, $I$ is the centre of the incircle. There is a circle tangent to $AI$ at $I$ which passes through $B$. This circle intersects $AB$ once more in $P$ and intersects $BC$ once more in $Q$. The line $QI$ intersects $AC$ in $R$. Prove that $|AR|\cdot |BQ|=|P I|^2$

Let $K$ and $K'$ be two squares in the same plane, their sides of equal length. Is it possible to decompose $K$ into a finite number of triangles $T_1, T_2, \ldots, T_p$ with mutually disjoint interiors and find translations $t_1, t_2, \ldots, t_p$ such that \[K'=\bigcup_{i=1}^{p} t_i(T_i) \ ? \]

Let $n$ be a positive integer, and let $[n]=\{1,2,\dots,n\}$. Find the maximum posible cardinality of a subset $S$ of $[n]$ with the property that there aren't any distinct $a,b,c\in S$ such that $a+b=c$.

Find the sum of all integers $n$ with $2 \le n \le 999$ and the following property: if $x$ and $y$ are randomly selected without replacement from the set $\left\{ 1,2,\dots,n \right\}$, then $x+y$ is even with probability $p$, where $p$ is the square of a rational number. [i]Proposed by Ivan Koswara[/i]

Prove that if $n$ and $k$ are positive integers such that $1<k<n-1$,Then the binomial coefficient $\binom nk$ is divisible by at least two different primes.

Let $a_1, b_1, a_2, b_2, \dots , a_n, b_n$ be nonnegative real numbers. Prove that \[ \sum_{i, j = 1}^{n} \min\{a_ia_j, b_ib_j\} \le \sum_{i, j = 1}^{n} \min\{a_ib_j, a_jb_i\}. \]

A function $f(x)$ satisfies $f(x)=f\left(\frac{c}{x}\right)$ for some real number $c(>1)$ and all positive number $x$. If $\int_1^{\sqrt{c}} \frac{f(x)}{x} dx=3$, evaluate $\int_1^c \frac{f(x)}{x} dx$

Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute $\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.

Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.

Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.

Let $\{u_n\}_ {n\ge 1}$ be given sequence satisfying the conditions: $u_1 = 0$, $u_2 = 1$, $u_{n+1} = u_{n-1} + 2n - 1$ for $n \ge 2$. 1) Calculate $u_5$. 2) Calculate $u_{100} + u_{101}$.

Determine the polynomial $P\in \mathbb{R}[x]$ for which there exists $n\in \mathbb{Z}_{>0}$ such that for all $x\in \mathbb{Q}$ we have: \[P\left(x+\frac1n\right)+P\left(x-\frac1n\right)=2P(x).\] [i]Dumitru Bușneag[/i]

Let $ABCD$ be a cyclic quadrilateral with $AB=4,BC=5,CD=6,$ and $DA=7$. Let $A_1$ and $C_1$ be the feet of the perpendiculars from $A$ and $C$, respectively, to line $BD,$ and let $B_1$ and $D_1$ be the feet of the perpendiculars from $B$ and $D,$ respectively, to line $AC$. The perimeter of $A_1B_1C_1D_1$ is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $ABC$ be an acute triangle. Let $\omega$ be a circle whose centre $L$ lies on the side $BC$. Suppose that $\omega$ is tangent to $AB$ at $B'$ and $AC$ at $C'$. Suppose also that the circumcentre $O$ of triangle $ABC$ lies on the shorter arc $B'C'$ of $\omega$. Prove that the circumcircle of $ABC$ and $\omega$ meet at two points. [i]Proposed by Härmel Nestra, Estonia[/i]

Let $P$ be a regular hexagon. For a point $A$, let $d_1\le d_2\le ...\le d_6$ the distances from $A$ to the six vertices of $P$, ordered by magnitude. Find the locus of all points $A$ in the interior or on the boundary of $P$ such that: (a) $d_3$ takes the smallest possible value. (b) $d_4$ takes the smallest possible value.

Consider an infinite strip, divided into unit squares. A finite number of nuts is placed in some of these squares. In a step, we choose a square $A$ which has more than one nut and take one of them and put it on the square on the right, take another nut (from $A$) and put it on the square on the left. The procedure ends when all squares has at most one nut. Prove that, given the initial configuration, any procedure one takes will end after the same number of steps and with the same final configuration.

Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses. An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise. Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.

There are $315$ marbles divided into three piles of $81, 115$ and $119$. In each move Ah Meng can either merge several piles into a single pile or divide a pile with an even number of marbles into $2$ equal piles. Can Ah Meng divide the marbles into $315$ piles, each with a single marble?

Given a triangle $ABC$, a line in its plane is called a [i]cool[/i] if it divides the triangle into two parts with equal areas and perimeters. a) Does there exist a triangle $ABC$ with at least seven [i]cool[/i] lines? b) Prove that all [i]cool[/i] lines intersect at a point $X$. If $\angle AXB = 126^\circ$, prove that $(8\sin^2 \angle ACB - 5)^2$ is an integer.

Given a natural number $n{}$ find the smallest $\lambda$ such that\[\gcd(x(x + 1)\cdots(x + n - 1), y(y + 1)\cdots(y + n - 1)) \leqslant (x-y)^\lambda,\] for any positive integers $y{}$ and $x \geqslant y + n$.

An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that: $ (i)$ Each player plays in each round, and every two players meet at most once. $ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$. Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament. [i]Proposed by Carlos di Fiore, Argentina[/i]

A powderman set a fuse for a blast to take place in $ 30$ seconds. He ran away at a rate of $ 8$ yards per second. Sound travels at the rate of $ 1080$ feet per second. When the powderman heard the blast, he had run approximately: $ \textbf{(A)}\ 200 \text{ yd.} \qquad\textbf{(B)}\ 352 \text{ yd.} \qquad\textbf{(C)}\ 300 \text{ yd.} \qquad\textbf{(D)}\ 245 \text{ yd.} \qquad\textbf{(E)}\ 512 \text{ yd.}$

At a company, there are several workers, some of which are enemies. They go to their job with 100 buses, in such a way that there aren't any enemies in either bus. Having arrived at the job, their chief wants to assign them to brigades of at least two people, without assigning two enemies to the same brigade. Prove that the chief can split the workers in at most 100 brigades, or he cannot split them at all in any number of brigades.

Let f be a function from the set Z of all integers into itself, that satisfies the condition for all $m \in Z$, $$f(f(m)) =-m. \ \ (1)$$ Then: (a) $f$ is a mutually unique mapping, i.e. a simple mapping of the set $Z$ onto the set $Z$ , (b) for all $m \in Z$ holds that $f(-m) = -f(m)$ , (c) $f(m) = 0$ if and only if $m = 0$ . Prove these statements and construct an example of a mapping f that satisfies condition (1).

Let $ABCD$ be a quadrilateral with parallel sides $AD$ and $BC$, $M$ and $N$ are the midpoints of its sides $AB$ and $CD$, respectively. The straight line $MN$ bisects the segment connecting the centers of the circumcircles of triangles $ABC$ and $ADC$. Prove that $ABCD$ is a parallelogram.