Ali chooses one of the stones from a group of $2005$ stones, marks this stone in a way that Betül cannot see the mark, and shuffles the stones. At each move, Betül divides stones into three non-empty groups. Ali removes the group with more stones from the two groups that do not contain the marked stone (if these two groups have equal number of stones, Ali removes one of them). Then Ali shuffles the remaining stones. Then it's again Betül's turn. And the game continues until two stones remain. When two stones remain, Ali confesses the marked stone. At least in how many moves can Betül guarantee to find out the marked stone? $ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18 \qquad\textbf{(E)}\ 19 $

For how many integer values of $ k$ do the graphs of $ x^2 \plus{} y^2 \equal{} k^2$ and $ xy \equal{} k$ [u]not[/u] intersect? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

What is the period of the function $f(x)=\cos(\cos(x))$?

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Let $A_i$ and $A_i^{'}$ $(i=1,2,3,4)$ be diametrically opposite vertexes of a rectangular cuboid and $M{}$ a point inside it. Prove that $S\leq\sum_{i=1}^{4}MA_i\cdot MA_i^{'}$, where $S{}$ is the total surface area of the rectangular cuboid.

a) Let $UVW$ , $U'V'W'$ be two triangles such that $ VW = V'W' , UV = U'V' , \angle WUV = \angle W'U'V'.$ Prove that the angles $\angle VWU , \angle V'W'U'$ are equal or supplementary. b) $ABC$ is a triangle where $\angle A$ is [b]obtuse[/b]. take a point $P$ inside the triangle , and extend $AP,BP,CP$ to meet the sides $BC,CA,AB$ in $K,L,M$ respectively. Suppose that $PL = PM .$ 1) If $AP$ bisects $\angle A$ , then prove that $AB = AC$ . 2) Find the angles of the triangle $ABC$ if you know that $AK,BL,CM$ are angle bisectors of the triangle $ABC$ and that $2AK = BL$.

Draw a circle $k$ with diameter $\overline{EF}$, and let its tangent in $E$ be $e$. Consider all possible pairs $A,B\in e$ for which $E\in \overline{AB}$ and $AE\cdot EB$ is a fixed constant. Define $(A_1,B_1)=(AF\cap k,BF\cap k)$. Prove that the segments $\overline{A_1B_1}$ all concur in one point.

Given a collection of sets $X = \{A_1, A_2, ..., A_n\}$. A set $\{a_1, a_2, ..., a_n\}$ is called a single representation of $X$ if $a_i \in A_i$ for all i. Let $|S| = mn$, $S = A_1\cup A_2 \cup ... \cup A_n = B_1 \cup B_2 \cup ... \cup B_n$ with $|A_i| = |B_i| = m$ for all $i$. Prove that $S = C_1 \cup C_2 \cup ... \cup C_n$ where for every $i, C_i $ is a single represenation for $\{A_j\}_{j=1}^n $and $\{B_j\}_{j=1}^n$.

Elisa has $2023$ treasure chests, all of which are unlocked and empty at first. Each day, Elisa adds a new gem to one of the unlocked chests of her choice, and afterwards, a fairy acts according to the following rules: [list=disc] [*]if more than one chests are unlocked, it locks one of them, or [*]if there is only one unlocked chest, it unlocks all the chests. [/list] Given that this process goes on forever, prove that there is a constant $C$ with the following property: Elisa can ensure that the difference between the numbers of gems in any two chests never exceeds $C$, regardless of how the fairy chooses the chests to unlock.

Let $ABCD$ be a square with side $10$. Let $M$ and $N$ be the midpoints of $[AB]$ and $[BC]$ respectively. Three circles are drawn: one with midpoint $D$ and radius $|AD|$, one with midpoint $M$ and radius $|AM|$, and one with midpoint $N$ and radius $|BN|$. The three circles intersect in the points $R, S$ and $T$ inside the square. Determine the area of $\triangle RST$.

Does there exist any function $f: \mathbb{R}^+ \to \mathbb{R}$ such that for every positive real number $x,y$ the following is true : $$f(xf(x)+yf(y)) = xy$$

Let $ABC$ be an acute triangle with $AB = AC$. Let $D$ be the point on $BC$ such that $AD$ is perpendicular to $BC$. Let $O,H,G$ be the circumcenter, orthocenter and centroid of triangle $ABC$ respectively. Suppose that $2 \cdot OD = 23 \cdot HD$. Prove that $G$ lies on the incircle of triangle $ABC$.

Let $n \ge 4$ be a positive integer and there exist $n$ positive integers that are arranged on a circle such that: $\bullet$ The product of each pair of two non-adjacent numbers is divisible by $2015 \cdot 2016$. $\bullet$ The product of each pair of two adjacent numbers is not divisible by $2015 \cdot 2016$. Find the maximum value of $n$

Let $ABC$ be an acute triangle ($AB < BC < AC$) with circumcircle $\Gamma$. Assume there exists $X \in AC$ satisfying $AB=BX$ and $AX=BC$. Points $D, E \in \Gamma$ are taken such that $\angle ADB<90^{\circ}$, $DA=DB$ and $BC=CE$. Let $P$ be the intersection point of $AE$ with the tangent line to $\Gamma$ at $B$, and let $Q$ be the intersection point of $AB$ with tangent line to $\Gamma$ at $C$. Show that the projection of $D$ onto $PQ$ lies on the circumcircle of $\triangle PAB$.

Find all polynomials $P(x)$ with real coefficients such that for all real $x$ holds the equality $$(1 + 2x)P(2x) = (1 + 2^{1999}x)P(x) .$$

Evaluate $$\lim_{n\to \infty} \sum_{j=1}^{n^{2}} \frac{n}{n^2 +j^2 }.$$

On a particular January day, the high temperature in Lincoln, Nebraska, was 16 degrees higher than the low temperature, and the average of the high and low temperatures was $3^{\circ}$. In degrees, what was the low temperature in Lincoln that day? $\textbf{(A) }-13\qquad\textbf{(B) }-8\qquad\textbf{(C) }-5\qquad\textbf{(D) }3\qquad\textbf{(E) }11$

Show that, if $a,b,...,n$ are distinct natural numbers, none divisible by any primes greater than $3$, then $$\frac{1}{a}+\frac{1}{b}+...+ \frac{1}{n}< 3$$

Show that there is no positive integer $n$ such that $n + k^2$ is a perfect square for at least $n$ positive integer values of $k$.

For which real values of $ m$ are the simultaneous equations \begin{align*} y &= mx + 3 \\ y &= (2m - 1)x + 4 \end{align*} satisfied by at least one pair of real numbers $ (x,y)$? $ \textbf{(A)}\ \text{all } m \qquad \textbf{(B)}\ \text{all } m \neq 0 \qquad \textbf{(C)}\ \text{all } m \neq 1/2 \qquad \textbf{(D)}\ \text{all } m \neq 1 \qquad$ $ \textbf{(E)}\ \text{no values of } m$

Let $C$ be a circle, and let $A, B, P$ be three points on $C$. Let $L_A$ and $L_B$ be the tangent lines to $C$ passing through $A$ and $B$, respectively. Let $a$ and $b$ be the distances from $P$ to $L_A$ and $L_B$, respectively, and let $c$ be the distance from $P$ to the chord of $C$ determined by $A$ and $B$. Prove that $c^2 = a \cdot b$.

Divide the plane into an infinite square grid by drawing all the lines $x=m$ and $y=n$ for $m,n \in \mathbb Z$. Next, if a square's upper-right corner has both coordinates even, color it black; otherwise, color it white (in this way, exactly $1/4$ of the squares are black and no two black squares are adjacent). Let $r$ and $s$ be odd integers, and let $(x,y)$ be a point in the interior of any white square such that $rx-sy$ is irrational. Shoot a laser out of this point with slope $r/s$; lasers pass through white squares and reflect off black squares. Prove that the path of this laser will form a closed loop.

\[\int_e^{e^2} (\log(x))^{\log(x)}(2+\log(\log(x)))\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

If $T(n)$ is the numbers of triangles with integers sizes(not congruent with each other) with it´s perimeter is equal to $n$, prove that: $$T(2012)<T(2015)$$ $$T(2013)=T(2016)$$

Let $S$ be a set of integers such that [list][*] there exist $a, b \in S$ with $\gcd(a, b)=\gcd(a-2,b-2)=1$, [*] if $x,y\in S$, then $x^2 -y\in S$.[/list] Prove that $S=\mathbb{Z}$.