A line, which passes through the incentre $I$ of the triangle $ABC$, meets its sides $AB$ and $BC$ at the points $M$ and $N$ respectively. The triangle $BMN$ is acute. The points $K,L$ are chosen on the side $AC$ such that $\angle ILA=\angle IMB$ and $\angle KC=\angle INB$. Prove that $AM+KL+CN=AC$. [i]S. Berlov[/i]

An $n$-tuple $(x_1, x_2,\dots, x_n)$ is called unearthly if $q_1x_1 +q_2x_2 +\dots+q_nx_n$ is irrational for any non-negative rational coefficients $q_1, q_2, \dots, q_n$ where $q_i$’s are not all zero. Prove that it is possible to select an unearthly $n$-tuple from any $2n-1$ distinct irrational numbers.

How many different prime numbers are factors of $ N$ if \[ \log_2 (\log_3 (\log_5 (\log_7 N))) \equal{} 11? \]$ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 7$

Let $N$ be the set of positive integers. Find all the functions $f: N\to N$ with $f (1) = 2$ and such that $max \{f(m)+f(n), m+n\}$ divides $min\{2m+2n,f (m+ n)+1\}$ for all $m, n$ positive integers

On the plane $n$ points are chosen so that exactly $m$ of them lie on one straight line and no three points not included in these $m$ points lie on one straight line. What is the number of all lines, each of which contains at least two of these points?

$n$ players are playing a game. Each player has $n$ tokens. Every turn, two players with at least one token are randomly selected. The player with less tokens gives one token to the player with more tokens. If both players have the same number of tokens, a coin flip decides which player receives a token and which player gives a token. The game ends when one player has all the tokens. If $n = 2019$, suppose the maximum number of turns the game could take to end can be written as $\frac{1}{d} (a \cdot 2019^3 + b \cdot 2019^2 + c \cdot 2019)$ for integers $a, b, c, d$. Find $\frac{abc}{d}$ .

There are $2022$ black balls numbered $1$ to $2022$ and $2022$ white balls numbered $1$ to $2022$ as well. There are also $1011$ black boxes and white boxes each. In each box we put two balls that are the same color as the the box. Prove that no matter how the balls are distributed, we can always pick one ball from each box such that the $2022$ balls we chose have all the numbers from $1$ to $2022$.

Let $n$ be an odd natural number and $A,B \in \mathcal{M}_n(\mathbb{C})$ be two matrices such that $(A-B)^2=O_n.$ Prove that $\det(AB-BA)=0.$

Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?

For any positive integer $b\ge2$, we write the base-$b$ numbers as follows: \[(d_kd_{k-1}\dots d_0)_b=d_kb^k+d_{k-1}b^{k-1}+\dots+d_1b^1+d_0b^0,\]where each digit $d_i$ is a member of the set $S=\{0,1,2,\dots,b-1\}$ and either $d_k\not=0$ or $k=0$. There is a unique way to write any nonnegative integer in the above form. If we select the digits from a different set $S$ instead, we may obtain new representations of all positive integers or, in some cases, all integers. For example, if $b=3$ and the digits are selected from $S=\{-1,0,1\}$, we obtain a way to uniquely represent all integers, known as a $\emph{balanced ternary}$ representation. As further examples, the balanced ternary representation of numbers $5$, $-3$, and $25$ are: \[5=(1\ {-1}\ {-1})_3,\qquad{-3}=({-1}\ 0)_3,\qquad25=(1\ 0\ {-1}\ 1)_3.\]However, not all digit sets can represent all integers. If $b=3$ and $S=\{-2,0,2\}$, then no odd number can be represented. Also, if $b=3$ and $S=\{0,1,2\}$ as in the usual base-$3$ representation, then no negative number can be represented. Given a set $S$ of four integers, one of which is $0$, call $S$ a $\emph{4-basis}$ if every integer $n$ has at least one representation in the form \[n=(d_kd_{k-1}\dots d_0)_4=d_k4^k+d_{k-1}4^{k-1}+\dots+d_14^1+d_04^0,\]where $d_k,d_{k-1},\dots,d_0$ are all elements of $S$ and either $d_k\not=0$ or $k=0$. [list=a] [*]Show that there are infinitely many integers $a$ such that $\{-1,0,1,4a+2\}$ is not a $4$-basis. [*]Show that there are infinitely many integers $a$ such that $\{-1,0,1,4a+2\}$ is a $4$-basis.[/list]

Does there exist an infinite set $ S$ such that for every $ a, b \in S$ we have $ a^2 \plus{} b^2 \minus{} ab \mid (ab)^2$.

For function $f:\mathbb Z^+ \to \mathbb R$ and coprime positive integers $p,q$ ; define $f_p,f_q$ as $$f_p(x)=f(px)-f(x), f_q(x)=f(qx)-f(x) \space \space (x\in\mathbb Z^+)$$ $f$ satisfies following conditions. $ $ $ $ $(i)$ $ $ for all $r$ that isn't multiple of $pq$, $f(r)=0$ $ $ $ $ $(ii)$ $ $ $\exists m\in \mathbb Z^+$ $ $ $s.t.$ $ $ $\forall x\in \mathbb Z^+, f_p(x+m)=f_p(x)$ and $f_q(x+m)=f_q(x)$ Prove that if $x\equiv y$ $ $ $(mod m)$, then $f(x)=f(y)$ $ $ ($x, y\in \mathbb Z^+$).

A number is called polite if it can be written as $ m + (m+1)+...+ n$, for certain positive integers $ m <n$ . For example: $18$ is polite, since $18 =5 + 6 + 7$. A number is called a power of two if it can be written as $2^{\ell}$ for some integer $\ell \ge 0$. (a) Show that no number is both polite and a power of two. (b) Show that every positive integer is polite or a power of two.

Let $k$ be a real number. Show that the polynomial $p (x) = x^3-24x + k$ has at most an integer root.

Let $p=1601$. Prove that if \[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n},\] where we only sum over terms with denominators not divisible by $p$ (and the fraction $\dfrac {m} {n}$ is in reduced terms) then $p \mid 2m+n$. [i]Proposed by A. Golovanov[/i]

Let $n$ be the smallest positive integer such that the number obtained by taking $n$’s rightmost digit (decimal expansion) and moving it to be the leftmost digit is $7$ times $n$. Determine the number of digits in $n$.

In the coordinate space, consider the cubic with vertices $ O(0,\ 0,\ 0),\ A(1,\ 0,\ 0),\ B(1,\ 1,\ 0),\ C(0,\ 1,\ 0),\ D(0,\ 0,\ 1),\ E(1,\ 0,\ 1),\ F(1,\ 1,\ 1),\ G(0,\ 1,\ 1)$. Find the volume of the solid generated by revolution of the cubic around the diagonal $ OF$ as the axis of rotation.

Consider four points $A,B,C,D$ not in the same plane such that \[AB=BD=CD=AC=\sqrt{2} AD=\frac{\sqrt{2}}{2}BC=a\] Prove that: a)There is a point $M\in [BC]$ such that $MA=MB=MC=MD$. b)$2m(\sphericalangle(AD,BC))=3m(\sphericalangle((ABC),(BCD)))$ c)$6(d(A,CD))^2=7(d(A,(BCD)))^2$ [i]Ion Trandafir[/i]

The point $M$ is the midpoint of the side $BC$ of triangle $ABC$. A circle is passing through $B$, is tangent to the line $AM$ at $M$, and intersects the segment $AB$ secondary at the point $P$. Prove that the circle, passing through $A$, $P$, and the midpoint of the segment $AM$, is tangent to the line $AC$. [i](A. Voidelevich)[/i]

Determine all real values of $x$ for which \[\frac{1}{\sqrt{x} + \sqrt{x - 2}} + \frac{1}{\sqrt{x} + \sqrt{x + 2}} = \frac{1}{4}.\]

Find all sequences $(a_n)$ of positive integers satisfying the equality $a_n=a_{a_{n-1}}+a_{a_{n+1}}$ a) for all $n\ge 2$ b) for all $n \ge 3$ (I. Gorodnin)

Determine the number of distinct positive real solutions to $$\lfloor x \rfloor ^{\{x\}} = \frac{1}{2022}x^2$$ . Note: $\lfloor x \rfloor$ is known as the floor function, which returns the greatest integer less than or equal to $x$. Furthermore, $\{x\}$ is defined as $x - \lfloor x \rfloor$.

Let $n$ be a positive integer. Tasty and Stacy are given a circular necklace with $3n$ sapphire beads and $3n$ turquoise beads, such that no three consecutive beads have the same color. They play a cooperative game where they alternate turns removing three consecutive beads, subject to the following conditions: [list] [*]Tasty must remove three consecutive beads which are turquoise, sapphire, and turquoise, in that order, on each of his turns. [*]Stacy must remove three consecutive beads which are sapphire, turquoise, and sapphire, in that order, on each of her turns. [/list] They win if all the beads are removed in $2n$ turns. Prove that if they can win with Tasty going first, they can also win with Stacy going first. [i]Yannick Yao[/i]

Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying \[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\] for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set \[X_v=\{x\in\mathbb Z:f(x)=v\}\] is finite and nonempty. (a) Prove that there exists such a function $f$ for which there is an $f$-rare integer. (b) Prove that no such function $f$ can have more than one $f$-rare integer. [i]Netherlands[/i]

Which of the following has the greatest number of line of symmetry? $ \textbf{(A)}\ \text{ Equilateral Triangle}$ $\textbf{(B)}\ \text{Non-square rhombus} $ $\textbf{(C)}\ \text{Non-square rectangle}$ $\textbf{(D)}\ \text{Isosceles Triangle}$ $\textbf{(E)}\ \text{Square} $