Three points $A,B,C$ are such that $B \in ]AC[$. On the side of $AC$ we draw the three semicircles with diameters $[AB], [BC]$ and $[AC]$. The common interior tangent at $B$ to the first two semi-circles meets the third circle in $E$. Let $U$ and $V$ be the points of contact of the common exterior tangent to the first two semi-circles. Denote the area of the triangle $ABC$ as $S(ABC)$. Evaluate the ratio $R=\frac{S(EUV)}{S(EAC)}$ as a function of $r_1 = \frac{AB}{2}$ and $r_2 = \frac{BC}{2}$.

An arbitrary point $M$ inside an equilateral triangle $ABC$ was connected to vertices. Prove that on each side the triangle can be selected one point at a time so that the distances between them would be equal to $AM, BM, CM$.

$p=3k+1$ is a prime number. For each $m \in \mathbb Z_p$, define function $L$ as follow: $L(m) = \sum_{x \in \mathbb{Z}_p}^{ } \left ( \frac{x(x^3 + m)}{p} \right )$ [i]a)[/i] For every $m \in \mathbb Z_p$ and $t \in {\mathbb Z_p}^{*}$ prove that $L(m) = L(mt^3)$. (5 points) [i]b)[/i] Prove that there is a partition of ${\mathbb Z_p}^{*} = A \cup B \cup C$ such that $|A| = |B| = |C| = \frac{p-1}{3}$ and $L$ on each set is constant. Equivalently there are $a,b,c$ for which $L(x) = \left\{\begin{matrix} a & & &x \in A \\ b& & &x \in B \\ c& & & x \in C \end{matrix}\right.$ . (7 points) [i]c)[/i] Prove that $a+b+c = -3$. (4 points) [i]d)[/i] Prove that $a^2 + b^2 + c^2 = 6p+3$. (12 points) [i]e)[/i] Let $X= \frac{2a+b+3}{3},Y= \frac{b-a}{3}$, show that $X,Y \in \mathbb Z$ and also show that :$p= X^2 + XY +Y^2$. (2 points) (${\mathbb Z_p}^{*} = \mathbb Z_p \setminus \{0\}$)

suppose that $0\le p \le 1$ and we have a wooden square with side length $1$. in the first step we cut this square into $4$ smaller squares with side length $\frac{1}{2}$ and leave each square with probability $p$ or take it with probability $1-p$. in the next step we cut every remaining square from the previous step to $4$ smaller squares (as above) and take them with probability $1-p$. it's obvios that at the end what remains is a subset of the first square. [b]a)[/b] show that there exists a number $0<p_0<1$ such that for $p>p_0$ the probability that the remainig set is not empty is positive and for $p<p_0$ this probability is zero. [b]b)[/b] show that for every $p\neq 1$ with probability $1$, the remainig set has size zero. [b]c)[/b] for this statement that the right side of the square is connected to the left side of the square with a path, write anything that you can.

On a circle $k$, we marked four points $(A, B, C, D)$ and drew pairwise their connecting segments. We denoted angles as seen on the diagram. We know that $\alpha_1 : \alpha_2 = 2 : 5$, $\beta_1 : \beta_2 = 7 : 11$, and $\gamma_1 : \gamma_2 = 10 : 3$. If $\delta_1 : \delta_2 = p : q$, where $p$ and $q$ are coprime positive integers, then what is $p$? [img]https://cdn.artofproblemsolving.com/attachments/c/e/b532dd164a7cf99cea7b3b7d98f81796622da5.png[/img]

Let $P(x) = x^2 + rx + s$ be a polynomial with real coefficients. Suppose $P(x)$ has two distinct real roots, both of which are less than $-1$ and the difference between the two is less than $2$. Prove that $P(P(x)) > 0$ for all real $x$.

We call a [i]ship[/i] a figure made up of unit squares connected by common edges. Prove that if there is an odd number of possible different ships consisting of n unit squares on a $ 10 \times 10$ board, then n is divisible by 4.

How many dominoes can be placed on a at least $3 \times 12$ board, such so that it is impossible to place a $1\times 3$, $3 \times 1$, or $ 2 \times 2$ tile on what remains of the board? Clarification: Each domino covers exactly two squares on the board. The chips cannot overlap.

Teresa the bunny has a fair $8$-sided die. Seven of its sides have fixed labels $1, 2, \cdots , 7,$ and the label on the eighth side can be changed and begins as $1$. She rolls it several times, until each of $1, 2, \dots, 7$ appears at least once. After each roll, if $k$ is the smallest positive integer that she has not rolled so far, she relabels the eighth side with $k$. The probability that $7$ is the last number she rolls is $\tfrac ab,$ where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$.

Consider rectangle $ABCD$ with $AB = 6$ and $BC = 8$. Pick points $E, F, G, H$ such that the angles $\angle AEB, \angle BFC, \angle CGD, \angle AHD$ are all right. What is the largest possible area of quadrilateral $EFGH$? [i]Proposed by Akshar Yeccherla (TopNotchMath)[/i]

At a dance, Abhinav starts from point $(a, 0)$ and moves along the negative $x$ direction with speed $v_a$, while Pei-Hsin starts from $(0,6)$ and glides in the negative $y$-direction with speed $v_b$. What is the distance of closest approach between the two?

The numbers $1, 2, . . . , 10$ are randomly arranged in a circle. Let $p$ be the probability that for every positive integer $k < 10$, there exists an integer $k' > k$ such that there is at most one number between $k$ and $k'$ in the circle. If $p$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$ and $b$, compute $100a + b$.

Let $ABC$ be a triangle . Let $A'$ be the center of the circle through the midpoint of the side $BC$ and the orthogonal projections of $B$ and $C$ on the lines of support of the internal bisectrices of the angles $ACB$ and $ABC$ , respectively ; the points $B'$ and $C'$ are defined similarly . Prove that the nine-point circle of the triangle $ABC$ and the circumcircle of $A'B'C'$ are concentric.

A point $K$ is taken inside parallelogram $ABCD$ so that the midpoint of $AD$ is equidistant from $K$ and $C$, and the midpoint of $CD$ is equidistant form $K$ and $A$. Let $N$ be the midpoint of $BK$. Prove that the angles $NAK$ and $NCK$ are equal.

For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied: [list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$, [*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list] Determine $N(n)$ for all $n\geq 2$. [i]Proposed by Dan Schwarz, Romania[/i]

A rectangular floor that is $10$ feet wide and $17$ feet long is tiled with $170$ one-foot square tiles. A bug walks from one corner to the opposite corner in a straight line. Including the first and the last tile, how many tiles does the bug visit? $\textbf{(A) } 17 \qquad\textbf{(B) } 25 \qquad\textbf{(C) } 26 \qquad\textbf{(D) } 27 \qquad\textbf{(E) } 28$