Let $S$ be the set of positive integers $n$ for which $\tfrac{1}{n}$ has the repeating decimal representation $0.\overline{ab} = 0.ababab\cdots,$ with $a$ and $b$ different digits. What is the sum of the elements of $S$? $ \textbf{(A)}\ 11\qquad\textbf{(B)}\ 44\qquad\textbf{(C)}\ 110\qquad\textbf{(D)}\ 143\qquad\textbf{(E)}\ 155\qquad $

a) A game is played on an infinite plane. There are fifty one pieces, one “wolf” and $50$ “sheep”. There are two players. The first commences by moving the wolf. Then the second player moves one of the sheep, the first player moves the wolf, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction through a distance of up to one metre per move. Is it true that for any starting position the wolf will be able to capture at least one sheep? b) A game is played on an infinite plane. There are two players. One has a piece known as a “wolf”, while the other has $K$ pieces known as “sheep”. The first player moves the wolf, then the second player moves a sheep, the first player moves the wolf again, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction, with a maximum distance of one metre per move. Is it true that for any value of $K$ there exists an initial position from which the wolf can not capture any sheep? PS. (a) was the junior version, (b) the senior one

For a polynomial $P$ and a positive integer $n$, define $P_n$ as the number of positive integer pairs $(a,b)$ such that $a<b \leq n$ and $|P(a)|-|P(b)|$ is divisible by $n$. Determine all polynomial $P$ with integer coefficients such that $P_n \leq 2021$ for all positive integers $n$.

Ada is taking a math test from 12:00 to 1:30, but her brother, Samuel, will be disruptive for two ten-minute periods during the test. If the probability that her brother is not disruptive while she is solving the challenge problem from 12:45 to 1:00 can be expressed as $\frac{m}{n}$, find $m+n$. [i]Proposed by Ada Tsui[/i]

Consider a $4 \times 4$ grid of squares. Aziraphale and Crowley play a game on this grid, alternating turns, with Aziraphale going first. On Aziraphale's turn, he may color any uncolored square red, and on Crowley's turn, he may color any uncolored square blue. The game ends when all the squares are colored, and Aziraphale's score is the area of the largest closed region that is entirely red. If Aziraphale wishes to maximize his score, Crowley wishes to minimize it, and both players play optimally, what will Aziraphale's score be?

A bug travels in the coordinate plane, moving only along the lines that are parallel to the $x$-axis or $y$-axis. Let $A=(-3, 2)$ and $B=(3, -2)$. Consider all possible paths of the bug from $A$ to $B$ of length at most $20$. How many points with integer coordinates lie on at least one of these paths? $ \textbf{(A)}\ 161 \qquad \textbf{(B)}\ 185 \qquad \textbf{(C)}\ 195 \qquad \textbf{(D)}\ 227 \qquad \textbf{(E)}\ 255 $

Find all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying \[xf(f(x)+y)=f(xy)+x^2\] for all $x,y \in \mathbb{R}$.

Find all (weakly) increasing $f\colon \mathbb{R}\to \mathbb{R}$ for which \[f(f(x)+y)=f(f(y)+x)\] holds for all $x, y\in \mathbb{R}$.

Let be three real numbers $ u,v,t $ under the condition $ u+v+t=0. $ Prove that for any positive real number $ a\neq 1 $ the following inequality is true with equality only and only if $ u=v=t=0: $ $$ a^u/a^v+a^v/a^t+a^{v+t}\ge a^u+a^v+1 $$ [i]Ion Tecu[/i]

Ria has $4$ green marbles and 8 red marbles. She arranges them in a circle randomly, if the probability that no two green marbles are adjacent is $\frac{p}{q}$ where the positive integers $p,q$ have no common factors other than $1$, what is $p+q$?

In a kindergarten, a nurse took $n$ congruent cardboard rectangles and gave them to $n$ kids, one per each. Each kid has cut its rectangle into congruent squares(the squares of different kids could be of different sizes). It turned out that the total number of the obtained squares is a prime number. Prove that all the initial squares were in fact squares.

In every $1\times1$ square of an $m\times n$ table we have drawn one of two diagonals. Prove that there is a path including these diagonals either from left side to the right side, or from the upper side to the lower side.

The Matini company released a special album with the flags of the $ 12$ countries that compete in the CONCACAM Mathematics Cup. Each postcard envelope has two flags chosen randomly. Determine the minimum number of envelopes that need to be opened to that the probability of having a repeated flag is $50\%$.

Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$. (Australia)

Let $a,b,c>0$ and $abc\ge1.$ Prove that a) $\left(a+\frac{1}{a+1}\right)\left(b+\frac{1}{b+1}\right) \left(c+\frac{1}{c+1}\right)\ge\frac{27}{8}.$ b)$27(a^{3}+a^{2}+a+1)(b^{3}+b^{2}+b+1)(c^{3}+c^{2}+c+1)\ge$ $\ge 64(a^{2}+a+1)(b^{2}+b+1)(c^{2}+c+1).$ [hide="Generalization"]$n^{3}(a^{n}+\ldots+a+1)(b^{n}+\ldots+b+1)(c^{n}+\ldots+c+1)\ge$ $\ge (n+1)^{3}(a^{n-1}+\ldots+a+1)(b^{n-1}+\ldots+b+1)(c^{n-1}+\ldots+c+1),\ n\ge1.$ [/hide]

The incircle of a right-angled triangle $ABC$ ($\angle ABC =90^o$) touches $AB, BC, AC$ in points $C_1, A_1, B_1$, respectively. One of the excircles touches the side $BC$ in point $A_2$. Point $A_0$ is the circumcenter or triangle $A_1A_2B_1$, point $C_0$ is defined similarly. Find angle $A_0BC_0$.

Real numbers $x, y, z$ satisfy $$x + xy + xyz = 1, y + yz + xyz = 2, z + xz + xyz = 4.$$ The largest possible value of $xyz$ is $\frac{a+b\sqrt{c}}{d}$, where $a$, $b$, $c$, $d$ are integers, $d$ is positive, $c$ is square-free, and gcd$(a,b, d) = 1$. Find $1000a + 100b + 10c + d$.

Emperor Zorg wishes to found a colony on a new planet. Each of the $n$ cities that he will establish there will have to speak exactly one of the Empire's $2020$ official languages. Some towns in the colony will be connected by a direct air link, each link can be taken in both directions. The emperor fixed the cost of the ticket for each connection to $1$ galactic credit. He wishes that, given any two cities speaking the same language, it is always possible to travel from one to the other via these air links, and that the cheapest trip between these two cities costs exactly $2020$ galactic credits. For what values of $n$ can Emperor Zorg fulfill his dream?

In how many ways can $345$ be written as the sum of an increasing sequence of two or more consecutive positive integers? $\textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7$

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

Let $ABC$ be a triangle with a right angle at $C$. Let $I$ be the incentre of triangle $ABC$, and let $D$ be the foot of the altitude from $C$ to $AB$. The incircle $\omega$ of triangle $ABC$ is tangent to sides $BC$, $CA$, and $AB$ at $A_1$, $B_1$, and $C_1$, respectively. Let $E$ and $F$ be the reflections of $C$ in lines $C_1A_1$ and $C_1B_1$, respectively. Let $K$ and $L$ be the reflections of $D$ in lines $C_1A_1$ and $C_1B_1$, respectively. Prove that the circumcircles of triangles $A_1EI$, $B_1FI$, and $C_1KL$ have a common point.

A hollow box (with negligible thickness) shaped like a rectangular prism has a volume of $108$ cubic units. The top of the box is removed, exposing the faces on the inside of the box. What is the minimum possible value for the sum of the areas of the faces on the outside and inside of the box?

Given a regular triangle $ABC$, whose area is $1$, and the point $P$ on its circumscribed circle. Lines $AP, BP, CP$ intersect, respectively, lines $BC, CA, AB$ at points $A', B', C'$. Find the area of the triangle $A'B'C'$.

Let $n$ be a positive integer. Let $S$ be the set of $n^2$ cells in an $n\times n$ grid. Call a subset $T$ of $S$ a [b]double staircase [/b] if [list] [*] $T$ can be partitioned into $n$ horizontal nonoverlapping rectangles of dimensions $1 \times 1, 1 \times 2, ..., 1 \times n,$ and [*]$T$ can also be partitioned into $n$ vertical nonoverlapping rectangles of dimensions $1\times1, 2 \times 1, ..., n \times 1$. [/list] In terms of $n$, how many double staircases are there? (Rotations and reflections are considered distinct.) An example of a double staircase when $n = 3$ is shown below. [asy] unitsize(1cm); for (int i = 0; i <= 3; ++i) { draw((0,i)--(3,i),linewidth(0.2)); draw((i,0)--(i,3),linewidth(0.2)); } filldraw((0,0)--(1,0)--(1,1)--(0,1)--cycle, lightgray, linewidth(0.2)); filldraw((1,0)--(2,0)--(2,1)--(1,1)--cycle, lightgray, linewidth(0.2)); filldraw((2,0)--(3,0)--(3,1)--(2,1)--cycle, lightgray, linewidth(0.2)); filldraw((0,1)--(1,1)--(1,2)--(0,2)--cycle, lightgray, linewidth(0.2)); filldraw((1,1)--(2,1)--(2,2)--(1,2)--cycle, lightgray, linewidth(0.2)); filldraw((1,2)--(2,2)--(2,3)--(1,3)--cycle, lightgray, linewidth(0.2)); [/asy]

(a) Let $f: \mathbb{R}^{n\times n}\rightarrow\mathbb{R}$ be a linear mapping. Prove that $\exists ! C\in\mathbb{R}^{n\times n}$ such that $f(A)=Tr(AC), \forall A \in \mathbb{R}^{n\times n}$. (b) Suppose in addtion that $\forall A,B \in \mathbb{R}^{n\times n}: f(AB)=f(BA)$. Prove that $\exists \lambda \in \mathbb{R}: f(A)=\lambda Tr(A)$