Find the smallest positive integer $x$ such that $2^{254}$ divides $x^{2005} + 1$.

In the triangle $ABC$, the inscribed circle touches the sides $CA{}$ and $AB{}$ at the points $B_1{}$ and $C_1{}$, respectively. An arbitrary point $D{}$ is selected on the side $AB{}$. The point $L{}$ is the center of the inscribed circle of the triangle $BCD$. The bisector of the angle $ACD$ intersects the line $B_1C_1$ at the point $M{}$. Prove that $\angle CML=90^\circ$. [i]Proposed by Chan Quang Heung (Vietnam)[/i]

Find all twice differentiable functions $f : \mathbb{R} \to \mathbb{R}$ such that $$f''(x) \cos(f(x))\geq(f'(x))^2 \sin(f(x)) $$ for every $x\in \mathbb{R}$. [i]Proposed by Orif Ibrogimov (Czech Technical University of Prague), Karim Rakhimov (University of Pisa)[/i]

Let $ABC$ be a triangle with circumcenter $O$. Let $P$ be a point inside $ABC$, so let the points $D, E, F$ be on $BC, AC, AB$ respectively so that the Miquel point of $DEF$ with respect to $ABC$ is $P$. Let the reflections of $D, E, F$ over the midpoints of the sides that they lie on be $R, S, T$. Let the Miquel point of $RST$ with respect to the triangle $ABC$ be $Q$. Show that $OP = OQ$. [i]Proposed by Yang Liu[/i]

The extensions of the sides $AB$ and $CD$ of the trapezoid $ABCD$ intersect at point $E$. Denote by $H$ and $G$ the midpoints of $BD$ and $AC$. Find the ratio of the area $AEGH$ to the area $ABCD$.

Let $a>1$ and $b>1$ be rational numbers. Denote by $\mathcal{F}_{a,b}$ the set of functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $$f(ax)=bf(x), \text{ for all }x\geq 0.$$ a) Prove that the set $\mathcal{F}_{a,b}$ contains both Riemann integrable functions on any interval and functions that are not Riemann integrable on any interval. b) If $f\in\mathcal{F}_{a,b}$ is Riemann integrable on $[0,\infty)$ and $\int_{\frac{1}{a}}^{a}f(x)dx=1$, calculate $$\int_a^{a^2} f(x)dx\text{ and }\int_0^1 f(x)dx.$$ [i]Vasile Pop[/i]

Suppose $a$ is $150\%$ of $b$. What percent of $a$ is $3b$? $\textbf{(A) } 50 \qquad \textbf{(B) } 66\frac{2}{3} \qquad \textbf{(C) } 150 \qquad \textbf{(D) } 200 \qquad \textbf{(E) } 450$

There are finitely many primes dividing the numbers $\{ a \cdot b^n + c\cdot d^n : n=1, 2, 3,... \}$ where $a, b, c, d$ are positive integers. Prove that $b=d$.

A convex polygon has at least one side with length $1$. If all diagonals of the polygon have integer lengths, at most how many sides does the polygon have? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $S =\{1, 2,..., 6\}$. How many functions $f : S \to S$ are there such that for all $s \in S$, $$f^5(s) = f(f(f(f(f(s))))) = 1?$$

Let $x, y, z \in R^+$. Prove that $$\frac{x}{x +\sqrt{(x + y)(x + z)}}+\frac{y}{y +\sqrt{(y + z)(y + x)}}+\frac{z}{z +\sqrt{(x + z)(z + y)}} \le 1$$

In the triangle $ABC$, let $P$, $Q$, and $R$ lie on the sides $BC$, $AC$, and $AB$ respectively, such that $AQ = AR$, $BP = BR$ and $CP = CQ$. Let $\angle PQR=75^o$ and $\angle PRQ=35^o$. Calculate the measures of the angles of the triangle $ABC$.

A $\triangle$ or $\bigcirc$ is placed in each of the nine squares in a 3-by-3 grid. Shown below is a sample configuration with three $\triangle$s in a line. [asy] //diagram by kante314 size(3.3cm); defaultpen(linewidth(1)); real r = 0.37; path equi = r * dir(-30) -- (r+0.03) * dir(90) -- r * dir(210) -- cycle; draw((0,0)--(0,3)--(3,3)--(3,0)--cycle); draw((0,1)--(3,1)--(3,2)--(0,2)--cycle); draw((1,0)--(1,3)--(2,3)--(2,0)--cycle); draw(circle((3/2,5/2),1/3)); draw(circle((5/2,1/2),1/3)); draw(circle((3/2,3/2),1/3)); draw(shift(0.5,0.38) * equi); draw(shift(1.5,0.38) * equi); draw(shift(0.5,1.38) * equi); draw(shift(2.5,1.38) * equi); draw(shift(0.5,2.38) * equi); draw(shift(2.5,2.38) * equi); [/asy] How many configurations will have three $\triangle$s in a line and three $\bigcirc$s in a line? $\textbf{(A) } 39 \qquad \textbf{(B) } 42 \qquad \textbf{(C) } 78 \qquad \textbf{(D) } 84 \qquad \textbf{(E) } 96$

Prove that for every positive integer $n$ and a non-negative real number $a$, the following inequality holds: $$n(n+1)a+2n \geqslant 4\sqrt{a}(\sqrt{1}+\sqrt{2}+\dots+\sqrt{n}).$$

There are $n$ children around a round table. Erika is the oldest among them and she has $n$ candies, while no other child has any candy. Erika decided to distribute the candies according to the following rules. In every round, she chooses a child with at least two candies and the chosen child sends a candy to each of his/her two neighbors. (So in the first round Erika must choose herself). For which $n \ge 3$ is it possible to end the distribution after a finite number of rounds with every child having exactly one candy?

Show that there doesn't exist two infinite and separate sets $A,B$ of points such that [b](i)[/b] There are no three collinear points in $A \cup B$, [b](ii)[/b] The distance between every two points in $A \cup B$ is at least $1$, and [b](iii)[/b] There exists at least one point belonging to set $B$ in interior of each triangle which all of its vertices are chosen from the set $A$, and there exists at least one point belonging to set $A$ in interior of each triangle which all of its vertices are chosen from the set $B$.

Given a positive integer $n$, find the greatest integer $p$ with the property that for any function $f : \mathbb P(X) \to C$, where $X$ and $C$ are sets of cardinality $n$ and $p$, respectively, there exist two distinct sets $A,B \in \mathbb P(X)$ such that $f(A) = f(B) = f(A \cup B)$. ($\mathbb P(X)$ is the family of all subsets of $X$.)

Find all solutions of the equation $$p ^ 2 + q ^ 2 + 49r ^ 2 = 9k ^ 2-101$$ with $ p$, $q$ and $r$ positive prime numbers and $k$ a positive integer.

Suppose that $\triangle ABC$ is an equilateral triangle of side length $s$, with the property that there is a unique point $P$ inside the triangle such that $AP = 1$, $BP = \sqrt{3}$, and $CP = 2$. What is $s?$ $\textbf{(A) } 1 + \sqrt{2} \qquad \textbf{(B) } \sqrt{7} \qquad \textbf{(C) } \frac{8}{3} \qquad \textbf{(D) } \sqrt{5 + \sqrt{5}} \qquad \textbf{(E) } 2\sqrt{2}$

Peter and Basil play the following game on a horizontal table $1\times{2019}$. Initially Peter chooses $n$ positive integers and writes them on a board. After that Basil puts a coin in one of the cells. Then at each move, Peter announces a number s among the numbers written on the board, and Basil needs to shift the coin by $s$ cells, if it is possible: either to the left, or to the right, by his decision. In case it is not possible to shift the coin by $s$ cells neither to the left, nor to the right, the coin stays in the current cell. Find the least $n$ such that Peter can play so that the coin will visit all the cells, regardless of the way Basil plays.

Consider all right triangles with integer side lengths that form an arithmetic sequence. Compute the $2014$th smallest perimeter of all such right triangles.

Define two sequences $x_n, y_n$ for $n = 1, 2, \ldots$ by \[x_n = \left(\sum^n_{k=0} \binom{2n}{2k}49^k 48^{n-k} \right) -1, \quad \text{and} \quad y_n = \sum^{n-1}_{k=0} \binom{2n}{2k + 1} 49^k 48^{n-k}\] Prove there is a positive integer $m$ for which for every integer $n > m,$ the greatest common factor of $x_n$ and $y_n$ is more than $10^{2024}.$

Prove that the number $ 9^{(a_1 + a_2)(a_2 + a_3)(a_3 + a_4)...(a_{98} + a_{99})(a_{99} + a_1)}$ − $1$ is divisible by $10$, for any choice of positive integers $a_1, a_2, a_3, . . . , a_{99}$.

A quadrilateral $ABCD$ is inscribed in a circle $\omega$. The tangent to $\omega$ at $A$ intersects the ray $CB$ at $K$, and the tangent to $\omega$ at $B$ intersects the ray $DA$ at $M$. Prove that if $AM=AD$ and $BK=BC$, then $ABCD$ is a trapezoid.

What $n$ is the smallest such that “there is a $n$-gon that can be cut into a triangle, a quadrilateral, ..., a $2006$-gon''?