For every natural number $n$, let $Q(n)$ denote the sum of the decimal digits of $n$. Prove that there are infinitely many positive integers $k$ with $Q(3^k) \ge Q(3^{k+1})$.

Circles $\omega_1$ and $\omega_2$ are externally tangent to each other at $P$. A random line $\ell$ cuts $\omega_1$ at $A$ and $C$ and $\omega_2$ at $B$ and $D$ (points $A,C,B,D$ are in this order on $\ell$). Line $AP$ meets $\omega_2$ again at $E$ and line $BP$ meets $\omega_1$ again at $F$. Prove that the radical axis of circles $(PCD)$ and $(PEF)$ is parallel to $\ell$. \\ \\ [i](Vlad Robu)[/i]

Solve for $x$: $2x+7=21$ $\textbf{(A) } 5\qquad\textbf{(B) } 6\qquad\textbf{(C) } 7\qquad\textbf{(D) } 8\qquad\textbf{(E) } 9$

The polynomial $f(z)=az^{2018}+bz^{2017}+cz^{2016}$ has real coefficients not exceeding $2019$, and $f(\tfrac{1+\sqrt{3}i}{2})=2015+2019\sqrt{3}i$. Find the remainder when $f(1)$ is divided by $1000$.

Three clever monkeys divide a pile of bananas. The first monkey takes some bananas from the pile, keeps three-fourths of them, and divides the rest equally between the other two. The second monkey takes some bananas from the pile, keeps one-fourth of them, and divides the rest equally between the other two. The third monkey takes the remaining bananas from the pile, keeps one-twelfth of them, and divides the rest equally between the other two. Given that each monkey receives a whole number of bananas whenever the bananas are divided, and the numbers of bananas the first, second, and third monkeys have at the end of the process are in the ratio $3: 2: 1$, what is the least possible total for the number of bananas?

In a convex quadrilateral $ABCD$, $\angle ABC = 90^o$ , $\angle BAC = \angle CAD$, $AC = AD, DH$ is the alltitude of the triangle $ACD$. In what ratio does the line $BH$ divide the segment $CD$?

Prove that for every natural number $k$ there exists an infinite set of such natural numbers $t$, that the decimal notation of $t$ does not contain zeroes and the sums of the digits of the numbers $t$ and $kt$ are equal.

Let $\vec{v_1},\vec{v_2},\vec{v_3},\vec{v_4}$ and $\vec{v_5}$ be vectors in three dimensions. Show that for some $i,j$ in $1,2,3,4,5$, $\vec{v_i}\cdot \vec{v_j}\ge 0$.

Let $\Gamma$ be a circle, and $\omega_1$ and $\omega_2$ be two non-intersecting circles inside $\Gamma$ that are internally tangent to $\Gamma$ at $X_1$ and $X_2$, respectively. Let one of the common internal tangents of $\omega_1$ and $\omega_2$ touch $\omega_1$ and $\omega_2$ at $T_1$ and $T_2$, respectively, while intersecting $\Gamma$ at two points $A$ and $B$. Given that $2X_1T_1=X_2T_2$ and that $\omega_1$, $\omega_2$, and $\Gamma$ have radii $2$, $3$, and $12$, respectively, compute the length of $AB$. [i]Proposed by James Lin.[/i]

For the nonzero numbers $ a$, $ b$, and $ c$, define \[(a,b,c)\equal{}\frac{abc}{a\plus{}b\plus{}c}.\] Find $(2,4,6)$. $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 24$

Find all functions $f : R \to R$ satisfying $f(x)f(y) = f(x + y) + xy$ for all $x, y \in R$.

Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.

A square with side $2008$ is broken into regions that are all squares with side $1$. In every region, either $0$ or $1$ is written, and the number of $1$'s and $0$'s is the same. The border between two of the regions is removed, and the numbers in each of them are also removed, while in the new region, their arithmetic mean is recorded. After several of those operations, there is only one square left, which is the big square itself. Prove that it is possible to perform these operations in such a way, that the final number in the big square is less than $\frac{1}{2^{10^6}}$.

Find all integer solutions $(x,y,z)$ of the equation $xy+yz+zx-xyz = 2$.

Determine all possible values of $m+n$, where $m$ and $n$ are positive integers satisfying \[\operatorname{lcm}(m,n) - \gcd(m,n) = 103.\]

For a positive integer $n$ let $S(n)$ be the sum of digits in the decimal representation of $n$. Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of $n$ is called a [i]stump[/i] of $n$. Let $T(n)$ be the sum of all stumps of $n$. Prove that $n=S(n)+9T(n)$.

Let the continuous functions $ f_n(x), \; n\equal{}1,2,3,...,$ be defined on the interval $ [a,b]$ such that every point of $ [a,b]$ is a root of $ f_n(x)\equal{}f_m(x)$ for some $ n \not\equal{} m$. Prove that there exists a subinterval of $ [a,b]$ on which two of the functions are equal.

Let be given a triangle $ ABC$ and its internal angle bisector $ BD$ $ (D\in BC)$. The line $ BD$ intersects the circumcircle $ \Omega$ of triangle $ ABC$ at $ B$ and $ E$. Circle $ \omega$ with diameter $ DE$ cuts $ \Omega$ again at $ F$. Prove that $ BF$ is the symmedian line of triangle $ ABC$.

In a movie theatre there are $6$ VIP chairs labelled from $1$ to $6$. We call a few consecutive vacant chairs a block. In the online VIP seat reservation process the reservation of a seat consists of two steps: in the first step we choose the block, in the second step we reserve the first, last or middle seat (in case of a block of size even this means the middle chair with the smaller number) of that block. (In the second step the online system offers the three possibilities even though they might mean the same seat.) Benedek reserved all seats at some screeining. In how many ways could he do it if we distinguish two reservation if there were a step when Benedek chose a different option? For instance, if the seats $ 1$ and $6$ are reserved, then there are two blocks, the first one consists of the seat $ 1$, the second block consists of the seats $3, 4$ and $5$. Two reservation orders are different if there is a chair that was reserved in a different step, or there is a chair that was reserved with different option (first, last or middle). So if there were $2$ VIP chairs, then the answer would have been $9$.

Some lattice points in the Cartesian coordinate system are colored red, the rest of the lattice points are colored blue. Such a coloring is called [i]finitely universal[/i], if for any finite, non-empty $A\subset \mathbb Z$ there exists $k\in\mathbb Z$ such that the point $(x,k)$ is colored red if and only if $x\in A$. $a)$ Does there exist a finitely universal coloring such that each row has finitely many lattice points colored red, each row is colored differently, and the set of lattice points colored red is connected? $b)$ Does there exist a finitely universal coloring such that each row has a finite number of lattice points colored red, and both the set of lattice points colored red and the set of lattice points colored blue are connected? A set $H$ of lattice points is called [i]connected[/i] if, for any $x,y\in H$, there exists a path along the grid lines that passes only through lattice points in $H$ and connects $x$ to $y$. [i]Submitted by Anett Kocsis, Budapest[/i]

Let $S$ be the set of all rational numbers whose denominators are powers of 3. Let $a$, $b$ and $c$ be given non-zero real numbers. Determine all real-valued functions $f$ that are defined for $x \in S$, satisfy \[ f(x) = af(3x) + bf(3x - 1) + cf(3x - 2) \textrm{ if }0 \leq x \leq 1, \] and are zero elsewhere.

Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers. (a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$. (b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.

Show that $\binom{n}{m},\binom{n}{m+1},\binom{n}{m+2}$ and $\binom{n}{m+3}$ cannot be in arithmetic progression, where $n,m>0$ and $n\geq m+3$.

The bisector $BL$ was drawn in the triangle $ABC$. Let the points $I_1$ and $I_2$ be centers of the circles inscribed in the triangles $ABL$ and $CBL$, and the points $J_1$ and $J_2$ be centers of the excircles of these triangles touching the side $BL$. Prove that the points $I_1$, $I_2$, $J_1$ and $J_2$ lie on the same circle.

Bicycle license plates in Flatville each contain three letters. The first is chosen from the set $\{C,H,L,P,R\}$, the second from $\{A,I,O\}$, and the third from $\{D,M,N,T\}$. When Flatville needed more license plates, they added two new letters. The new letters may both be added to one set or one letter may be added to one set and one to another set. What is the largest possible number of $\text{ADDITIONAL}$ license plates that can be made by adding two letters? $ \text{(A)}\ 24\qquad\text{(B)}\ 30\qquad\text{(C)}\ 36\qquad\text{(D)}\ 40\qquad\text{(E)}\ 60 $