a) Let $ABC$ be a triangle and a point $I$ lies inside the triangle. Assume $\angle IBA > \angle ICA$ and $\angle IBC >\angle ICB$. Prove that, if extensions of $BI$, $CI$ intersect $AC$, $AB$ at $B'$, $C'$ respectively, then $BB' < CC'$. b) Let $ABC$ be a triangle with $AB < AC$ and angle bisector $AD$. Prove that for every point $I, J$ on the segment $[AD]$ and $I \ne J$, we always have $\angle JBI > \angle JCI$. c) Let $ABC$ be a triangle with $AB < AC$ and angle bisector $AD$. Choose $M, N$ on segments $CD$ and $BD$, respectively, such that $AD$ is the bisector of angle $\angle MAN$. On the segment $[AD]$ take an arbitrary point $I$ (other than $D$). The lines $BI$, $CI$ intersect $AM$, $AN$ at $B', C'$. Prove that $BB' < CC'$.

Figure 1 shows a road-map connecting 14 cities. Is there a path passing through each city exactly once?

Some boys and girls are having a car wash to raise money for a class trip to China. Initially $ 40 \%$ of the group are girls. Shortly thereafter two girls leave and two boys arrive, and then $ 30 \%$ of the group are girls. How many girls were initially in the group? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 12$

Initially, there are $111$ pieces of clay on the table of equal mass. In one turn, you can choose several groups of an equal number of pieces and push the pieces into one big piece for each group. What is the least number of turns after which you can end up with $11$ pieces no two of which have the same mass?

There are $85$ soldiers with different heigth and age. Every day commander chooses random soldier and send him and also all soldiers that are taller and older than this soldier, or all soldiers that are lower and younger than this soldier to color grass. Prove that after $10$ days we can find two soldiers, that color grass at same days.

Let $a$ be a non-zero real number. For each integer $n$, we define $S_n = a^n + a^{-n}$. Prove that if for some integer $k$, the sums $S_k$ and $S_{k+1}$ are integers, then the sums $S_n$ are integers for all integers $n$.

In the figure below, circle $O$ has two tangents, $\overline{AC}$ and $\overline{BC}$. $\overline{EF}$ is drawn tangent to circle $O$ such that $E$ is on $\overline{AC}$, $F$ is on $\overline{BC}$, and $\overline{EF} \perp \overline{FC}$. Given that the diameter of circle $O$ has length $10$ and that $CO = 13$, what is the area of triangle $EFC$? [img]https://cdn.artofproblemsolving.com/attachments/b/d/4a1bc818a5e138ae61f1f3d68f6ee5adc1ed6f.png[/img]

It is necessary to construct an angle whose sine is three times greater than its cosine. Describe how this can be done.

Let $\Delta A_1A_2A_3, \Delta B_1B_2B_3, \Delta C_1C_2C_3$ be three equilateral triangles. The vertices in each triangle are numbered [u]clockwise[/u]. It is given that $A_3=B_3=C_3$. Let $M$ be the center of mass of $\Delta A_1B_1C_1$, and let $N$ be the center of mass of $\Delta A_2B_2C_2$. Prove that $\Delta A_3MN$ is an equilateral triangle.

Suppose that \[S_n=\frac 59 \times \frac{14}{20} \times \frac{27}{35} \times \cdots \times \frac{2n^2-n-1}{2n^2+n-1}\] Find $\lim_{n \to \infty} S_n.$

Determine the number of $n$-tuples of integers $(x_1,x_2,\cdots ,x_n)$ such that $|x_i| \le 10$ for each $1\le i \le n$ and $|x_i-x_j| \le 10$ for $1 \le i,j \le n$.

Prove that for all natural $n\ge 6 000$ any convex $1994$-gon can be cut into $n$ such quadrilaterals thata circle can be circumscribed around each of them

Find all real solutions of the system of equations $$\begin{cases} x^2 + y^2 + u^2 + v^2 = 4 \\ xu + yv + xv + yu = 0 \\ xyu + yuv + uvx + vxy = - 2 \\ xyuv = -1 \end{cases}$$

Let $\lfloor x\rfloor$ denote the greatest integer function and $\{x\}=x-\lfloor x\rfloor$ denote the fractional part of $x$. Let $1\leq x_1<\ldots<x_{100}$ be the $100$ smallest values of $x\geq 1$ such that $\sqrt{\lfloor x\rfloor\lfloor x^3\rfloor}+\sqrt{\{x\}\{x^3\}}=x^2.$ Compute \[\sum_{k=1}^{50}\dfrac{1}{x_{2k}^2-x_{2k-1}^2}.\]

The ratio of the sides of a parallelogram is $\lambda>1$. Given $\lambda$, determine the maximum of the acute angle subtended by the diagonals of the parallelogram.

Tina randomly selects two distinct numbers from the set $ \{1,2,3,4,5\}$ and Sergio randomly selects a number from the set $ \{1,2,...,10\}$. The probability that Sergio's number is larger than the sum of the two numbers chosen by Tina is $ \textbf{(A)}\ 2/5 \qquad \textbf{(B)}\ 9/20 \qquad \textbf{(C)}\ 1/2\qquad \textbf{(D)}\ 11/20 \qquad \textbf{(E)}\ 24/25$

Let $f (n)$ be a function satisfying the following three conditions for all positive integers $n$: (a) $f (n)$ is a positive integer, (b) $f (n + 1) > f (n)$, (c) $f ( f (n)) = 3n$. Find $f (2001)$.

A jar contains 4 blue marbles, 3 green marbles, and 5 red marbles. If Helen reaches in the jar and selects a marble at random, then the probability that she selects a red marble can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $a,b,c,\alpha,\beta,\gamma \in\mathbb{R}$ such as $a^2+b^2+c^2 \neq 0 \neq \alpha\beta\gamma$ and $24^{\alpha}\neq 3^{\beta} \neq 2012^{\gamma} \neq 24^{\alpha}$. Prove that the equation \[ a \cdot 24^{\alpha x}+b \cdot 3^{\beta x} + c \cdot 2012^{\gamma x}=0 \] has at most two real solutions.

$\mathbb{Z}[x]$ represents the set of all polynomials with integer coefficients. Find all functions $f:\mathbb{Z}[x]\rightarrow \mathbb{Z}[x]$ such that for any 2 polynomials $P,Q$ with integer coefficients and integer $r$, the following statement is true. \[P(r)\mid Q(r) \iff f(P)(r)\mid f(Q)(r).\] (We define $a|b$ if and only if $b=za$ for some integer $z$. In particular, $0|0$.) [i]Proposed by the4seasons.[/i]

A single bench section at a school event can hold either $7$ adults or $11$ children. When $N$ bench sections are connected end to end, an equal number of adults and children seated together will occupy all the bench space. What is the least possible positive integer value of $N?$ $\textbf{(A) } 9 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 27 \qquad \textbf{(D) } 36 \qquad \textbf{(E) } 77$

Let's call a number of the form $x^3+y^2$ with natural $x, y$ [i]successful[/i]. Are there infinitely many natural $m$ such that among the numbers from $m + 1$ to $m + 2016^2$ exactly 2017 are successful?

Determine all injective functions defined on the set of positive integers into itself satisfying the following condition: If $S$ is a finite set of positive integers such that $\sum\limits_{s\in S}\frac{1}{s}$ is an integer, then $\sum\limits_{s\in S}\frac{1}{f\left( s\right) }$ is also an integer.

Prove that one can always mark $50$ points inside of any convex $100$-gon, so that each its vertix is on a straight line connecting some two marked points. (4)

Let $P$ be a cubic polynomial with $P(0) = k, P(1) = 2k,$ and $P(-1) = 3k$. What is $P(2) + P(-2)$? $ \textbf{(A) }0 \qquad\textbf{(B) }k \qquad\textbf{(C) }6k \qquad\textbf{(D) }7k\qquad\textbf{(E) }14k\qquad $