In a right-angled triangle $ABC$ with the hypotenuse $BC$, $D$ is the foot of the altitude from $A$. The line through the incenters of the triangles $ABD$ and $ADC$ intersects the legs of $\triangle ABC$ at $E$ and $F$. Prove that $A$ is the circumcenter of triangle $DEF$.

Let $ABC$ be an acute, scalene triangle. Let $H$ be the orthocenter and $O$ be the circumcenter of triangle $ABC$, and let $P$ be a point interior to the segment $HO.$ The circle with center $P$ and radius $PA$ intersects the lines $AB$ and $AC$ again at $R$ and $S$, respectively. Denote by $Q$ the symmetric point of $P$ with respect to the perpendicular bisector of $BC$. Prove that points $P$, $Q$, $R$ and $S$ lie on the same circle.

In trapezoid $ABCD$ , the sides $AB$ and $CD$ are equal. The perimeter of $ABCD$ is [asy] draw((0,0)--(4,3)--(12,3)--(16,0)--cycle); draw((4,3)--(4,0),dashed); draw((3.2,0)--(3.2,.8)--(4,.8)); label("$A$",(0,0),SW); label("$B$",(4,3),NW); label("$C$",(12,3),NE); label("$D$",(16,0),SE); label("$8$",(8,3),N); label("$16$",(8,0),S); label("$3$",(4,1.5),E);[/asy] $ \text{(A)}\ 27\qquad\text{(B)}\ 30\qquad\text{(C)}\ 32\qquad\text{(D)}\ 34\qquad\text{(E)}\ 48 $

[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$. [b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials. [b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? [b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1 [/u] [b]p1.[/b] In the Hundred Acre Wood, all the animals are either knights or liars. Knights always tell the truth and liars always lie. One day in the Wood, Winnie-the-Pooh, a knight, decides to visit his friend Rabbit, also a noble knight. Upon arrival, Pooh finds his friend sitting at a round table with $5$ other guests. One-by-one, Pooh asks each person at the table how many of his two neighbors are knights. Surprisingly, he gets the same answer from everybody! "Oh bother!" proclaims Pooh. "I still don't have enough information to figure out how many knights are at this table." "But it's my birthday," adds one of the guests. "Yes, it's his birthday!" agrees his neighbor. Now Pooh can tell how many knights are at the table. Can you? [b]p2.[/b] Harry has an $8 \times 8$ board filled with the numbers $1$ and $-1$, and the sum of all $64$ numbers is $0$. A magical cut of this board is a way of cutting it into two pieces so that the sum of the numbers in each piece is also $0$. The pieces should not have any holes. Prove that Harry will always be able to find a magical cut of his board. (The picture shows an example of a proper cut.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/98dec239cfc757e6f2996eef7876cbfd79d202.png[/img] [b]p3.[/b] Several girls participate in a tennis tournament in which each player plays each other player exactly once. At the end of the tournament, it turns out that each player has lost at least one of her games. Prove that it is possible to find three players $A$, $B$, and $C$ such that $A$ defeated $B$, $B$ defeated $C$, and $C$ defeated $A$. [b]p4.[/b] $120$ bands are participating in this year's Northwest Grunge Rock Festival, and they have $119$ fans in total. Each fan belongs to exactly one fan club. A fan club is called crowded if it has at least $15$ members. Every morning, all the members of one of the crowded fan clubs start arguing over who loves their favorite band the most. As a result of the fighting, each of them leaves the club to join another club, but no two of them join the same one. Is it true that, no matter how the clubs are originally arranged, all these arguments will eventually stop? [b]p5.[/b] In Infinite City, the streets form a grid of squares extending infinitely in all directions. Bonnie and Clyde have just robbed the Infinite City Bank, located at the busiest intersection downtown. Bonnie sets off heading north on her bike, and, $30$ seconds later, Clyde bikes after her in the same direction. They each bike at a constant speed of $1$ block per minute. In order to throw off any authorities, each of them must turn either left or right at every intersection. If they continue biking in this manner, will they ever be able to meet? [u]Round 2 [/u] [b]p6.[/b] In a certain herd of $33$ cows, each cow weighs a whole number of pounds. Farmer Dan notices that if he removes any one of the cows from the herd, it is possible to split the remaining $32$ cows into two groups of equal total weight, $16$ cows in each group. Show that all $33$ cows must have the same weight. [b]p7.[/b] Katniss is thinking of a positive integer less than $100$: call it $x$. Peeta is allowed to pick any two positive integers $N$ and $M$, both less than $100$, and Katniss will give him the greatest common divisor of $x+M$ and $N$ . Peeta can do this up to seven times, after which he must name Katniss' number $x$, or he will die. Can Peeta ensure his survival? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $n$ points in the plane such that at least $99\%$ of quadrilaterals with vertices from these points are convex. Can we find a convex polygon in the plane having at least $90\%$ of the points as vertices? [i]Proposed by Morteza Saghafian - Iran[/i]

[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$. [b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$. [b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Inside the equilateral triangle $ABC$ lies the point $T$. Prove that $TA$, $TB$ and $TC$ are the lengths of the sides of a triangle.

Let $ABCDEF$ be a regular hexagon of side length 1. Compute the area of the intersection of the circle centered at $A$ passing through $C$ and the circle centered at $D$ passing through $E$. [i]Proposed by Robert Trosten[/i]

Let $t_1,t_2,\ldots,t_k$ be different straight lines in space, where $k>1$. Prove that points $P_i$ on $t_i$, $i=1,\ldots,k$, exist such that $P_{i+1}$ is the projection of $P_i$ on $t_{i+1}$ for $i=1,\ldots,k-1$, and $P_1$ is the projection of $P_k$ on $t_1$.

Let $ABC$ be a triangle inscribed in the ellipse $\frac{x^2}{4} +\frac{y^2}{9}= 1$. If its centroid is the origin $(0,0)$, find its area.

Let $ d$ be a line and points $ M,N$ on the $ d$. Circles $ \alpha,\beta,\gamma,\delta$ with centers $ A,B,C,D$ are tangent to $ d$, circles $ \alpha,\beta$ are externally tangent at $ M$, and circles $ \gamma,\delta$ are externally tangent at $ N$. Points $ A,C$ are situated in the same half-plane, determined by $ d$. Prove that if exists an circle, which is tangent to the circles $ \alpha,\beta,\gamma,\delta$ and contains them in its interior, then lines $ AC,BD,MN$ are concurrent or parallel.

Let $O$ be the center of the circle of the triangle $ABC$ with $AB \ne AC$. Furthermore, let $S$ and $T$ be points on the rays $AB$ and $AC$, such that $\angle ASO = \angle ACO$ and $\angle ATO = \angle ABO$. Show that $ST$ bisects the segment $BC$.

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, and $AC = 15$. Let$ D$ and $E$ be the feet of the altitudes from $A$ and $B$, respectively. Find the circumference of the circumcircle of $\vartriangle CDE$

$MD$ is a chord of length $2$ in a circle of radius $1,$ and $L$ is chosen on the circle so that the area of $\triangle MLD$ is the maximized. Find $\angle MLD.$

On the plane there is a finite set of points $Z$ with the property that no two distances of the points of the set $Z$ are equal. We connect the points $ A, B $ belonging to $ Z $ if and only if $ A $ is the point closest to $ B $ or $ B $ is the point closest to $ A $. Prove that no point in the set $Z$ will be connected to more than five others.

A rectangle has area $1100$. If the length is increased by ten percent and the width is decreased by ten percent, what is the area of the new rectangle?

We have a square of side $1$ and a number $\ell$ such that $0 <\ell <\sqrt2$. Two players $A$ and $B$, in turn, draw in the square an open segment (without its two ends) of length $\ell $, starts A. Each segment after the first cannot have points in common with the previously drawn segments. He loses the player who cannot make his play. Determine if either player has a winning strategy.

Consider a cube and two of its vertices $A$ and $B$, which are the endpoints of a face diagonal. A [i]path [/i] is a sequence of cube angles, each step of one angle along a cube edge is walked to one of the three adjacent angles. Let $a$ be the number of paths of length $2012$ that starts at point $A$ and ends at $A$ and let b be the number of ways of length $2012$ that starts in $A$ and ends in $B$. Decide which of the two numbers $a$ and $b$ is the larger.

Let ABCD be a square inscribed in a circle k and P be an arbitrary point of that circle. Prove that at least one of the numbers PA, PB, PC and PD is not rational.

In a parallelogram $ABCD$, let $M$ be the point on the $BC$ side such that $MC = 2BM$ and let $N$ be the point of side $CD$ such that $NC = 2DN$. If the distance from point $B$ to the line $AM$ is $3$, calculate the distance from point $N$ to the line $AM$.

There exist right triangles with integer side lengths such that the legs differ by $ 1$. For example, $3-4-5$ and $20-21-29$ are two such right triangles. What is the perimeter of the next smallest Pythagorean right triangle with legs differing by $ 1$?

The excircle of right-angled triangle $ABC$ ($\angle B =90^o$) touches side $BC$ at point $A_1$ and touches line $AC$ in point $A_2$. Line $A_1A_2$ meets the incircle of $ABC$ for the first time at point $A'$, point $C'$ is defined similarly. Prove that $AC||A'C'$.

The sides of a $10$ by $10$ square $ABCD$ are reflective on the inside. A beam of light enters the square via the vertex $A$ and heads to the point $P$ on $CD$ with $CP = 3$ and $PD = 7$. In $P$ it naturally reflects on the $CD$ side. The light beam can only leave the square via one of the angular points $A, B, C$ or $D$. What is the distance that the light beam travels within the square before it leaves the square again? By which vertex does that happen?

Given a circle $\Omega$ tangent to side $AB$ of angle $\angle BAC$ and lying outside this angle. We consider circles $w$ inscribed in angle $BAC$. The internal tangent of $\Omega$ and $w$, different from $AB$, touches $w$ at a point $K$. Let $L$ be the point of tangency of $w$ and $AC$. Prove that all such lines $KL$ pass through a fixed point without depending on the choice of circle $w$.