In one peculiar family, the mother and the three children have exactly the same birthday. Currently, the mother is $37$ years old while each of children are $9$ years old. How old will the mother be when the sum of the ages of the three children equals her age? $\textbf{(A) }14\qquad\textbf{(B) }27\qquad\textbf{(C) }42\qquad\textbf{(D) }57\qquad\textbf{(E) }66$

Let triangle \( ABC \) be an acute-angled triangle. Square \( AEFB \) and \( ADGC \) lie outside triangle \( ABC \). \( BD \) intersects \( CE \) at point \( H \), and \( BG \) intersects \( CF \) at point \( I \). The circumcircle of triangle \( BFI \) intersects the circumcircle of triangle \( CGI \) again at point \( K \). Prove that line segment \( HK \) bisects \( BC \).

Let $T$ be a tree. Prove that there is a constant $c>0$ (independent of $n$) such that every graph with $n$ vertices that does not contain a subgraph isomorphic to $T$ has at most $cn$ edges. [i]David Yang.[/i]

Some unit squares of $ 2007\times 2007 $ square board are colored. Let $ (i,j) $ be a unit square belonging to the $ith$ line and $jth$ column and $ S_{i,j} $ be the set of all colored unit squares $(x,y)$ satisfying $ x\leq i, y\leq j $. At the first step in each colored unit square $(i,j)$ we write the number of colored unit squares in $ S_{i,j} $ . In each step, in each colored unit square $(i,j)$ we write the sum of all numbers written in $ S_{i,j} $ in the previous step. Prove that after finite number of steps, all numbers in the colored unit squares will be odd.

Suppose $a,b,$ and $c$ are real numbers such that \begin{align*} a^2-bc &= \ 14, \\ b^2-ca &= \ 14, \text{ and} \\ c^2-ab &=-3. \end{align*} Compute $|a+b+c|.$

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function. [i]Proposed by James Rickards, Canada[/i]

A [i]labyrinth[/i] is a system of $2024$ caves and $2023$ non-intersecting (bidirectional) corridors, each of which connects exactly two caves, where each pair of caves is connected through some sequence of corridors. Initially, Erik is standing in a corridor connecting some two caves. In a move, he can walk through one of the caves to another corridor that connects that cave to a third cave. However, when doing so, the corridor he was just in will magically disappear and get replaced by a new one connecting the end of his new corridor to the beginning of his old one (i.e., if Erik was in a corridor connecting caves $a$ and $b$ and he walked through cave $b$ into a corridor that connects caves $b$ and $c$, then the corridor between caves $a$ and $b$ will disappear and a new corridor between caves $a$ and $c$ will appear). Since Erik likes designing labyrinths and has a specific layout in mind for his next one, he is wondering whether he can transform the labyrinth into that layout using these moves. Prove that this is in fact possible, regardless of the original layout and his starting position there.

In a company of $n$ persons, each person has no more than $d$ acquaintances, and in that company there exists a group of $k$ persons, $k\ge d$, who are not acquainted with each other. Prove that the number of acquainted pairs is not greater than $\left[ \frac{n^2}{4}\right]$.

Let $A', B' , C'$ be the projections of a point $M$ inside a triangle $ABC$ onto the sides $BC, CA, AB$, respectively. Define $p(M ) = \frac{MA'\cdot MB'\cdot MC'}{MA \cdot MB \cdot MC}$ . Find the position of point $M$ that maximizes $p(M )$.

A sphere is inscribed into a quadrangular pyramid. The point of contact of the sphere with the base of the pyramid is projected to the edges of the base. Prove that these projections are concyclic.

(a) Let $k$ be an natural number so that the equation $ab + (a + 1) (b + 1) = 2^k$ does not have a positive integer solution $(a, b)$. Show that $k + 1$ is a prime number. (b) Show that there are natural numbers $k$ so that $k + 1$ is prime numbers and equation $ab + (a + 1) (b + 1) = 2^k$ has a positive integer solution $(a, b)$.

Bela and Jenn play the following game on the closed interval $[0, n]$ of the real number line, where $n$ is a fixed integer greater than $4$. They take turns playing, with Bela going first. At his first turn, Bela chooses any real number in the interval $[0, n]$. Thereafter, the player whose turn it is chooses a real number that is more than one unit away from all numbers previously chosen by either player. A player unable to choose such a number loses. Using optimal strategy, which player will win the game? $\textbf{(A) } \text{Bela will always win.}$ $\textbf{(B) } \text{Jenn will always win.} $ $\textbf{(C) } \text{Bela will win if and only if }n \text{ is odd.}$ $\textbf{(D) } \text{Jenn will win if and only if }n \text{ is odd.} $ $\textbf{(E) } \text{Jenn will win if and only if }n > 8.$

Let $\mathbb N_0$ be the set of non-negative integers. There is a triple $(f,a,b)$, where $f$ is a function from $\mathbb N_0$ to $\mathbb N_0$ and $a,b\in\mathbb N_0$ that satisfies the following conditions: [list] [*]$f(1)=2$ [*]$f(a)+f(b)\leq 2\sqrt{f(a)}$ [*]For all $n>0$, we have $f(n)=f(n-1)f(b)+2n-f(b)$ [/list] Find the sum of all possible values of $f(b+100)$.

Prove that for all positive integers $ n$: $ \frac{2n}{3n\plus{}1} \le \displaystyle\sum_{k\equal{}n\plus{}1}^{2n}\frac{1}{k} \le \frac{3n\plus{}1}{4(n\plus{}1)}$.

Given is a convex polyhedron with $ k $ faces $ S_1, \ldots, S_k $. Let us denote the vector of length 1 perpendicular to the wall $ S_i $ ($ i = 1, \ldots, k $) directed outside the given polyhedron by $ \overrightarrow{n_i} $, and the surface area of this wall by $ P_i $. Prove that $$ \sum_{i=1}^k P_i \cdot \overrightarrow{n_i} = \overrightarrow{0}.$$

For a positive integer $n$, denote $A_n=\{(x,y)\in\mathbb Z^2|x^2+xy+y^2=n\}$. (a) Prove that the set $A_n$ is always finite. (b) Prove that the number of elements of $A_n$ is divisible by $6$ for all $n$. (c) For which $n$ is the number of elements of $A_n$ divisible by $12$?

Let $p, u, m, a, c$ be positive real numbers satisfying $5p^5+4u^5+3m^5+2a^5+c^5=91$. What is the maximum possible value of: \[18pumac + 2(2 + p)^2 + 23(1 + ua)^2 + 15(3 + mc)^2?\]

Let $c(O, R)$ be a circle, $AB$ a diameter and $C$ an arbitrary point on the circle different than $A$ and $B$ such that $\angle AOC > 90^o$. On the radius $OC$ we consider point $K$ and the circle $c_1(K, KC)$. The extension of the segment $KB$ meets the circle $(c)$ at point $E$. From $E$ we consider the tangents $ES$ and $ET$ to the circle $(c_1)$. Prove that the lines $BE, ST$ and $AC$ are concurrent.

In each unit square of square $100*100$ write any natural number. Called rectangle with sides parallel sides of square $good$ if sum of number inside rectangle divided by $17$. We can painted all unit squares in $good$ rectangle. One unit square cannot painted twice or more. Find maximum $d$ for which we can guaranteed paint at least $d$ points.

Given $15$ coins of the same appearance. It is known that one of them weighs $1$g, two coins weigh $2$g each, three coins weigh $3$g each, four coins weigh $4$g each, and five coins weigh $5$g each. There are inscriptions on the coins, indicating their weight. It is allowed to perform two weighings on a balance without additional weights. Find a way to check that there are no wrong inscriptions. (It is not required to check which inscriptions are wrong and which ones are correct.) (8 marks)

On an international conference there are 4 official languages. Each two of the attendees can have a conversation on one of the languages. Prove that at least 60% of the attendees can speak the same language.

Let $k$ be a positive integer. A natural number $m$ is called [i]$k$-typical[/i] if each divisor of $m$ leaves the remainder $1$ when being divided by $k$. Prove: [b]a)[/b] If the number of all divisors of a positive integer $n$ (including the divisors $1$ and $n$) is $k$-typical, then $n$ is the $k$-th power of an integer. [b]b)[/b] If $k > 2$, then the converse of the assertion [b]a)[/b] is not true.

Find an arithmetic progression of $2016$ natural numbers such that neither is a perfect power but its multiplication is a perfect power. Clarification: A perfect power is a number of the form $n^k$ where $n$ and $k$ are both natural numbers greater than or equal to $2$.

We call a positive integer [i]interesting [/i] if the number and the number with its digits written in reverse order both leave remainder $2$ in division by $4$. a) Determine if $2018$ is an interesting number. b) For every positive integer $n$, find how many interesting $n$-digit numbers there are.

Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$