A triangle and two points inside it are marked. It is known that one of the triangle’s angles is equal to $58^{\circ}$, one of two remaining angles is equal to $59^{\circ}$, one of two given points is the incenter of the triangle and the second one is its circumcenter. Using only the ruler without partitions determine where is each of the angles and where is each of the centers.

As shown in the figure below, $ABCD$ is a trapezoid, $AB \parallel CD$. The sides $DA$, $AB$, $BC$ are tangent to $\odot O_1$ and $AB$ touches $\odot O_1$ at $P$. The sides $BC$, $CD$, $DA$ are tangent to $\odot O_2$, and $CD$ touches $\odot O_2$ at $Q$. Prove that the lines $AC$, $BD$, $PQ$ meet at the same point. [asy] size(200); defaultpen(linewidth(0.8)+fontsize(10pt)); pair A=origin,B=(1,-7),C=(30,-15),D=(26,6); pair bisA=bisectorpoint(B,A,D),bisB=bisectorpoint(A,B,C),bisC=bisectorpoint(B,C,D),bisD=bisectorpoint(C,D,A); path bA=A--(bisA+100*(bisA-A)),bB=B--(bisB+100*(bisB-B)),bC=C--(bisC+100*(bisC-C)),bD=D--(bisD+100*(bisD-D)); pair O1=intersectionpoint(bA,bB),O2=intersectionpoint(bC,bD); dot(O1^^O2,linewidth(2)); pair h1=foot(O1,A,B),h2=foot(O2,C,D); real r1=abs(O1-h1),r2=abs(O2-h2); draw(circle(O1,r1)^^circle(O2,r2)); draw(A--B--C--D--cycle); draw(A--C^^B--D^^h1--h2); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,dir(350)); label("$D$",D,dir(350)); label("$P$",h1,dir(200)); label("$Q$",h2,dir(350)); label("$O_1$",O1,dir(150)); label("$O_2$",O2,dir(300)); [/asy]

Let $ABC$ be a triangle with $AB = 5$, $BC = 4$, and $CA = 3$. Initially, there is an ant at each vertex. The ants start walking at a rate of $1$ unit per second, in the direction $A \to B \to C \to A$ (so the ant starting at $A$ moves along ray $\overrightarrow{AB}$, etc.). For a positive real number $t$ less than$ 3$, let $A(t)$ be the area of the triangle whose vertices are the positions of the ants after $t$ seconds have elapsed. For what positive real number $t$ less than $3$ is $A(t)$ minimized?

Suppose that $a$ cows give $b$ gallons of milk in $c$ days. At this rate, how many gallons of milk will $d$ cows give in $e$ days? ${ \textbf{(A)}\ \frac{bde}{ac}\qquad\textbf{(B)}\ \frac{ac}{bde}\qquad\textbf{(C)}\ \frac{abde}{c}\qquad\textbf{(D)}}\ \frac{bcde}{a}\qquad\textbf{(E)}\ \frac{abc}{de}$

For what positive integers $n\geq 4$ does there exist a set $S$ of $n$ points on the plane, not all collinear, such that for any three non-collinear points $A,B,C$ in $S$, either the incenter, $A$-excenter, $B$-excenter, or $C$-excenter of triangle $ABC$ is also contained in $S$?

Triangle $ ABC$, with sides of length $ 5$, $ 6$, and $ 7$, has one vertex on the positive $ x$-axis, one on the positive $ y$-axis, and one on the positive $ z$-axis. Let $ O$ be the origin. What is the volume of tetrahedron $ OABC$? $ \textbf{(A)}\ \sqrt{85} \qquad \textbf{(B)}\ \sqrt{90} \qquad \textbf{(C)}\ \sqrt{95} \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ \sqrt{105}$

A certain function $f$ has the properties that $f(3x)=3f(x)$ for all positive real values of $x$, and that $f(x)=1-\mid x-2 \mid$ for $1\leq x \leq 3$. Find the smallest $x$ for which $f(x)=f(2001)$.

The inscribed circle of the triangle $ABC$ is tangent to the sides $BC, AC$ and $AB$ at points $D, E$ and $F$, respectively. Let $M$ be the midpoint of $EF$. The circle circumscribed around the triangle $DMF$ intersects line $AB$ at $L$, the circle circumscribed around the triangle $DME$ intersects the line $AC$ at $K$. Prove that the circle circumscribed around the triangle $AKL$ is tangent to the line $BC$.

Jane has two bags $X$ and $Y$. Bag $X$ contains 4 red marbles and 5 blue marbles (and nothing else). Bag $Y$ contains 7 red marbles and 6 blue marbles (and nothing else). Jane will choose one of her bags at random (each bag being equally likely). From her chosen bag, she will then select one of the marbles at random (each marble in that bag being equally likely). What is the probability that she will select a red marble?

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

Kikoriki live on the shores of a pond in the form of an equilateral triangle with a side of $600$ m, Krash and Wally live on the same shore, $300$ m from each other. In summer, Dokko to Krash walk $900$ m, and Wally to Rosa - also $900$ m. Prove that in winter, when the pond freezes and it will be possible to walk directly on the ice, Dokko will walk as many meters to Krash as Wally to Rosa. [url=https://en.wikipedia.org/wiki/Kikoriki]about Kikoriki/GoGoRiki / Smeshariki [/url]

A $9 \times 10$ board is divided into $90$ unit cells. There are certain rules for moving a non-standard chess queen from one square to another: [list] [*]The queen can only move along the column or row it is in each step. [*]For any natural number $n$, if $x$ cells move made in $(2n-1)$th step, then $9-x$ cells move will be done in $(2n)$th step. The last cell it stops at during these steps is considered the visited cell. [/list] Is it possible for the queen to move from any square on the board and return to the square where it started after visiting all the squares of the board exactly once? Note: At each step, the queen chooses the right, left, up, and down direction within the above condition can choose.

Two players, Red and Blue, play in alternating turns on a 10x10 board. Blue goes first. In his turn, a player picks a row or column (not chosen by any player yet) and color all its squares with his own color. If any of these squares was already colored, the new color substitutes the old one. The game ends after 20 turns, when all rows and column were chosen. Red wins if the number of red squares in the board exceeds at least by 10 the number of blue squares; otherwise Blue wins. Determine which player has a winning strategy and describe this strategy.

Let $(a_n)$ be the integer sequence which is defined by $a_1= 1$ and $$ a_{n+1}=a_n^2 + n \cdot a_n \,\, , \,\, \forall n \ge 1.$$ Let $S$ be the set of all primes $p$ such that there exists an index $i$ such that $p|a_i$. Prove that the set $S$ is an infinite set and it is not equal to the set of all primes.

The points $A, B$ and $C$ lie on the surface of a sphere with center $O$ and radius 20. It is given that $AB=13, BC=14, CA=15,$ and that the distance from $O$ to triangle $ABC$ is $\frac{m\sqrt{n}}k,$ where $m, n,$ and $k$ are positive integers, $m$ and $k$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+k.$