A [i]palindrome [/i] is a natural number that works in the decimal system forwards and backwards read is the same size (e.g. $1129211$ or $7337$). Determine all pairs $(m, n)$ of natural numbers, such that $$(\underbrace{11... 11}_{m}) \cdot (\underbrace{11... 11}_{n})$$ is a palindrome.

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

A positive integer $m$ is called [i]growing[/i] if its digits, read from left to right, are non-increasing. Prove that for each natural number $n$ there exists a growing number $m$ with $n$ digits such that the sum of its digits is a perfect square.

What is the area of the shaded region of the given $8 \times 5$ rectangle? [asy] size(6cm); defaultpen(fontsize(9pt)); draw((0,0)--(8,0)--(8,5)--(0,5)--cycle); filldraw((7,0)--(8,0)--(8,1)--(0,4)--(0,5)--(1,5)--cycle,gray(0.8)); label("$1$",(1/2,5),dir(90)); label("$7$",(9/2,5),dir(90)); label("$1$",(8,1/2),dir(0)); label("$4$",(8,3),dir(0)); label("$1$",(15/2,0),dir(270)); label("$7$",(7/2,0),dir(270)); label("$1$",(0,9/2),dir(180)); label("$4$",(0,2),dir(180)); [/asy] $\textbf{(A)}\ 4\dfrac{3}{5} \qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 5\dfrac{1}{4} \qquad \textbf{(D)}\ 6\dfrac{1}{2} \qquad \textbf{(E)}\ 8$

Find all real $x$ such that $$\sqrt{2+\frac{5}{2}\cos x}\leq\sin x.$$

For two arbitrary reals $x, y$ which are larger than $0$ and less than $1.$ Prove that$$\frac{x^2}{x+y}+\frac{y^2}{1-x}+\frac{(1-x-y)^2}{1-y}\geq\frac{1}{2}.$$

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a function such that $$\displaystyle{f(f(x)) = \frac{x^2 - x}{2}\cdot f(x) + 2-x,}$$ for all $x \in \mathbb{R}.$ Find all possible values of $f(2).$

Rosencrantz plays $n \leq 2015$ games of question, and ends up with a win rate $\left(\text{i.e.}\: \frac{\text{\# of games won}}{\text{\# of games played}}\right)$ of $k$. Guildenstern has also played several games, and has a win rate less than $k$. He realizes that if, after playing some more games, his win rate becomes higher than $k$, then there must have been some point in time when Rosencrantz and Guildenstern had the exact same win-rate. Find the product of all possible values of $k$.

Two circles in a plane intersect. $A$ is one of the points of intersection. Starting simultaneously from $A$ two points move with constant speed, each travelling along its own circle in the same sense. The two points return to $A$ simultaneously after one revolution. Prove that there is a fixed point $P$ in the plane such that the two points are always equidistant from $P.$

How many solutions, depending on the value of the parameter $a$, has the equation $$\sqrt{x^2-4}+\sqrt{2x^2-7x+5}=a ?$$

In quadrilateral $ ABCD$, $ AB \equal{} 5$, $ BC \equal{} 17$, $ CD \equal{} 5$, $ DA \equal{} 9$, and $ BD$ is an integer. What is $ BD$? [asy]unitsize(4mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair C=(0,0), B=(17,0); pair D=intersectionpoints(Circle(C,5),Circle(B,13))[0]; pair A=intersectionpoints(Circle(D,9),Circle(B,5))[0]; pair[] dotted={A,B,C,D}; draw(D--A--B--C--D--B); dot(dotted); label("$D$",D,NW); label("$C$",C,W); label("$B$",B,E); label("$A$",A,NE);[/asy]$ \textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$

Let $n$ be a natural number. Prove that there is a multiple of $n$ that can be written only with the digits $0$ and $1$.

Let $ABC$ be a triangle such that $$S^2=2R^2+8Rr+3r^2$$ Then prove that $\frac Rr=2$ or $\frac Rr\ge\sqrt2+1$. [i]Proposed by Marian Cucoanoeş and Marius Drăgan[/i]

There is a board numbered $-10$ to $10$. Each square is coloured either red or white, and the sum of the numbers on the red squares is $n$. Maureen starts with a token on the square labeled $0$. She then tosses a fair coin ten times. Every time she flips heads, she moves the token one square to the right. Every time she flips tails, she moves the token one square to the left. At the end of the ten flips, the probability that the token finishes on a red square is a rational number of the form $\frac a b$. Given that $a + b = 2001$, determine the largest possible value for $n$.

The cost of producing each item is inversely proportional to the square root of the number of items produced. The cost of producing ten items is $ \$2100$. If items sell for $ \$30$ each, how many items need to be sold so that the producers break even?

Five persons wearing badges with numbers $1, 2, 3, 4, 5$ are seated on $5$ chairs around a circular table. In how many ways can they be seated so that no two persons whose badges have consecutive numbers are seated next to each other? (Two arrangements obtained by rotation around the table are considered different)

The $\emph{Stooge sort}$ is a particularly inefficient recursive sorting algorithm defined as follows: given an array $A$ of size $n$, we swap the first and last elements if they are out of order; we then (if $n\ge3$) Stooge sort the first $\lceil\tfrac{2n}3\rceil$ elements, then the last $\lceil\tfrac{2n}3\rceil$, then the first $\lceil\tfrac{2n}3\rceil$ elements again. Given that this runs in $O(n^\alpha)$, where $\alpha$ is minimal, find the value of $(243/32)^\alpha$.

Let $ n$ be an even positive integer. Let $ A_1, A_2, \ldots, A_{n \plus{} 1}$ be sets having $ n$ elements each such that any two of them have exactly one element in common while every element of their union belongs to at least two of the given sets. For which $ n$ can one assign to every element of the union one of the numbers 0 and 1 in such a manner that each of the sets has exactly $ \frac {n}{2}$ zeros?

Starting from an equilateral triangle with perimeter $P_0$, we carry out the following iterations: the first iteration consists of dividing each side of the triangle into three segments of equal length, construct an exterior equilateral triangle on each of the middle segments, and then remove these segments (bases of each new equilateral triangle formed). The second iteration consists of apply the same process of the first iteration on each segment of the resulting figure after the first iteration. Successively, follow the other iterations. Let $A_n$ be the area of the figure after the $n$- th iteration, and let $P_n$ the perimeter of the same figure. If $A_n = P_n$, find the value of $P_0$ (in its simplest form).

On a circle, 2022 points are chosen such that distance between two adjacent points is always the same. There are $k$ arcs, each having endpoints on chosen points, with different lengths. Arcs do not contain each other. What is the maximum possible number of $k$?

Initially, a positive integer $N$ is written on a blackboard. We repeatedly replace the number according to the following rules: 1) replace the number by a positive multiple of itself 2) replace the number by a number with the same digits in a different order. (The new number is allowed to have leading digits, which are then deleted.) [i]A possible sequence of moves is given by $5 \to 20 \to 140 \to 041=41$.[/i] Determine for which values of $N$ it is possible to obtain $1$ after a finite number of such moves.

The permutations of $OLYMPIAD$ are arranged in lexicographical order, with $ADILMOPY$ being arrangement 1 and its reverse being arrangement $40320$. Yu Semo and Yu Sejmo both choose a uniformly random arrangement. The immature Yu Sejmo exclaims, ``My fourth letter is $L$!" while Yu Semo remains silent. Given this information, let $E_1$ be the expected arrangement number of Yu Semo and $E_2$ be the expected arrangement number of Yu Sejmo. Compute $E_2 - E_1$.

In an $n$-gon $A_{1}A_{2}\ldots A_{n}$, all of whose interior angles are equal, the lengths of consecutive sides satisfy the relation \[a_{1}\geq a_{2}\geq \dots \geq a_{n}. \] Prove that $a_{1}=a_{2}= \ldots= a_{n}$.

A game board consists of $64$ squares that alternate in color between black and white. The figure below shows square $P$ in the bottom and square $Q$ in the top row. A marker is placed at $P$. A [i]step[/i] consists of moving the marker onto one of the adjoining white squares in the row above. How many $7$-step paths are there from $P$ to $Q$? (The figure shows a sample path.) [asy]//diagram by SirCalcsALot size(200); int[] x = {6, 5, 4, 5, 6, 5, 6}; int[] y = {1, 2, 3, 4, 5, 6, 7}; int N = 7; for (int i = 0; i < 8; ++i) { for (int j = 0; j < 8; ++j) { draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)); if ((i+j) % 2 == 0) { filldraw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--(i,j)--cycle,black); } } } for (int i = 0; i < N; ++i) { draw(circle((x[i],y[i])+(0.5,0.5),0.35)); } label("$P$", (5.5, 0.5)); label("$Q$", (6.5, 7.5)); [/asy] $\textbf{(A)}\ 28 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 35$

Let a non-isosceles acute triangle ABC with tha attitude AD, BE, CF and the orthocenter H. DE, DF intersect (AD) at M, N respectively. $P\in AB,Q\in AC$ satisfy $NP\perp AB,MQ\perp AC$ a) Prove that EF is the tangent line of (APQ) b) Let T be the tangency point of (APQ) with EF,.DT $\cap$ MN={K}. L is the reflection of A in MN. Prove that MN, EF ,(DLK) pass through a piont