The Evil League of Evil is plotting to poison the city's water supply. They plan to set out from their headquarters at $(5, 1)$ and put poison in two pipes, one along the line $y=x$ and one along the line $x=7$. However, they need to get the job done quickly before Captain Hammer catches them. What's the shortest distance they can travel to visit both pipes and then return to their headquarters?

Let $\vec{v_1},\vec{v_2},\vec{v_3},\vec{v_4}$ and $\vec{v_5}$ be vectors in three dimensions. Show that for some $i,j$ in $1,2,3,4,5$, $\vec{v_i}\cdot \vec{v_j}\ge 0$.

In isosceles triangle $ABC(AC=BC)$ the point $M$ is in the segment $AB$ such that $AM=2MB,$ $F$ is the midpoint of $BC$ and $H$ is the orthogonal projection of $M$ in $AF.$ Prove that $\angle BHF=\angle ABC.$

In acute triangle $ ABC,$ points $ P,Q$ lie on its sidelines $ AB,AC,$ respectively. The circumcircle of triangle $ ABC$ intersects of triangle $ APQ$ at $ X$ (different from $ A$). Let $ Y$ be the reflection of $ X$ in line $ PQ.$ Given $ PX>PB.$ Prove that $ S_{\bigtriangleup XPQ}>S_{\bigtriangleup YBC}.$ Where $ S_{\bigtriangleup XYZ}$ denotes the area of triangle $ XYZ.$

Given a real number $\lambda > 1$, let $P$ be a point on the arc $BAC$ of the circumcircle of $\bigtriangleup ABC$. Extend $BP$ and $CP$ to $U$ and $V$ respectively such that $BU = \lambda BA$, $CV = \lambda CA$. Then extend $UV$ to $Q$ such that $UQ = \lambda UV$. Find the locus of point $Q$.

This is the one with the 8 circles? I made each circle into the square in which the circle is inscribed, then calculated it with that. It got the right answer but I don't think that my method is truly valid...

The points $P$ and $Q$ lie on the diagonals $AC$ and $BD$, respectively, of a quadrilateral $ABCD$ such that $\frac{AP}{AC} + \frac{BQ}{BD} =1$. The line $PQ$ meets the sides $AD$ and $BC$ at points $M$ and $N$. Prove that the circumcircles of the triangles $AMP$, $BNQ$, $DMQ$, and $CNP$ are concurrent.

Consider a circle $(O)$ and two fixed points $B,C$ on $(O)$ such that $BC$ is not the diameter of $(O)$. $A$ is an arbitrary point on $(O)$, distinct from $B,C$. Let $D,J,K$ be the midpoints of $BC,CA,AB$, respectively, $E,M,N$ be the feet of perpendiculars from $A$ to $BC$, $B$ to $DJ$, $C$ to $DK$, respectively. The two tangents at $M,N$ to the circumcircle of triangle $EMN$ meet at $T$. Prove that $T$ is a fixed point (as $A$ moves on $(O)$).

Two segment $AB,CD$ of the same length are given in plane such that lines $AB,CD$ are not parallel. Consider a point $S$ with the following property: the image of segment $AB$ under point reflection with respect to $S$ is identical to the mirror-image of segment $CD$ with respect to some axis. Find the locus of all such points $S.$

Let $ABC$ be a right triangle with $A = 90^{\circ}$ and $D \in (AC)$. Denote by $E$ the reflection of $A$ in the line $BD$ and $F$ the intersection point of $CE$ with the perpendicular in $D$ to $BC$. Prove that $AF, DE$ and $BC$ are concurrent.

Let $z = a + bi$ be the complex number with $|z| = 5$ and $b > 0$ such that the distance between $(1 + 2i)z^3$ and $z^5$ is maximized, and let $z^4 = c + di$. Find $c+d$.

Let the circle $ {\omega}_{1}$ be internally tangent to another circle $ {\omega}_{2}$ at $ N$.Take a point $ K$ on $ {\omega}_{1}$ and draw a tangent $ AB$ which intersects $ {\omega}_{2}$ at $ A$ and $ B$. Let $M$ be the midpoint of the arc $ AB$ which is on the opposite side of $ N$. Prove that, the circumradius of the $ \triangle KBM$ doesnt depend on the choice of $ K$.

Let $ABC$ be a triangle with orthocenter $H$ and circumcenter $O$. Let $P$ be a point in the plane such that $AP \perp BC$. Let $Q$ and $R$ be the reflections of $P$ in the lines $CA$ and $AB$, respectively. Let $Y$ be the orthogonal projection of $R$ onto $CA$. Let $Z$ be the orthogonal projection of $Q$ onto $AB$. Assume that $H \neq O$ and $Y \neq Z$. Prove that $YZ \perp HO$. [asy] import olympiad; unitsize(30); pair A,B,C,H,O,P,Q,R,Y,Z,Q2,R2,P2; A = (-14.8, -6.6); B = (-10.9, 0.3); C = (-3.1, -7.1); O = circumcenter(A,B,C); H = orthocenter(A,B,C); P = 1.2 * H - 0.2 * A; Q = reflect(A, C) * P; R = reflect(A, B) * P; Y = foot(R, C, A); Z = foot(Q, A, B); P2 = foot(A, B, C); Q2 = foot(P, C, A); R2 = foot(P, A, B); draw(B--(1.6*A-0.6*B)); draw(B--C--A); draw(P--R, blue); draw(R--Y, red); draw(P--Q, blue); draw(Q--Z, red); draw(A--P2, blue); draw(O--H, darkgreen+linewidth(1.2)); draw((1.4*Z-0.4*Y)--(4.6*Y-3.6*Z), red+linewidth(1.2)); draw(rightanglemark(R,Y,A,10), red); draw(rightanglemark(Q,Z,B,10), red); draw(rightanglemark(C,Q2,P,10), blue); draw(rightanglemark(A,R2,P,10), blue); draw(rightanglemark(B,P2,H,10), blue); label("$\textcolor{blue}{H}$",H,NW); label("$\textcolor{blue}{P}$",P,N); label("$A$",A,W); label("$B$",B,N); label("$C$",C,S); label("$O$",O,S); label("$\textcolor{blue}{Q}$",Q,E); label("$\textcolor{blue}{R}$",R,W); label("$\textcolor{red}{Y}$",Y,S); label("$\textcolor{red}{Z}$",Z,NW); dot(A, filltype=FillDraw(black)); dot(B, filltype=FillDraw(black)); dot(C, filltype=FillDraw(black)); dot(H, filltype=FillDraw(blue)); dot(P, filltype=FillDraw(blue)); dot(Q, filltype=FillDraw(blue)); dot(R, filltype=FillDraw(blue)); dot(Y, filltype=FillDraw(red)); dot(Z, filltype=FillDraw(red)); dot(O, filltype=FillDraw(black)); [/asy]

Aaron takes a square sheet of paper, with one corner labeled $A$. Point $P$ is chosen at random inside of the square and Aaron folds the paper so that points $A$ and $P$ coincide. He cuts the sheet along the crease and discards the piece containing $A$. Let $p$ be the probability that the remaining piece is a pentagon. Find the integer nearest to $100p$. [i]Proposed by Aaron Lin[/i]

Let $P$ be a square pyramid whose base consists of the four vertices $(0, 0, 0), (3, 0, 0), (3, 3, 0)$, and $(0, 3, 0)$, and whose apex is the point $(1, 1, 3)$. Let $Q$ be a square pyramid whose base is the same as the base of $P$, and whose apex is the point $(2, 2, 3)$. Find the volume of the intersection of the interiors of $P$ and $Q$.

Given a set $ M$ of points $ (x,y)$ with integral coordinates satisfying $ x^2 + y^2\leq 10^{10}$. Two players play a game. One of them marks a point on his first move. After this, on each move the moving player marks a point, which is not yet marked and joins it with the previous marked point. Players are not allowed to mark a point symmetrical to the one just chosen. So, they draw a broken line. The requirement is that lengths of edges of this broken line must strictly increase. The player, which can not make a move, loses. Who have a winning strategy?

Suppose that a parabola has vertex $\left(\tfrac{1}{4},-\tfrac{9}{8}\right)$, and equation $y=ax^2+bx+c$, where $a>0$ and $a+b+c$ is an integer. The minimum possible value of $a$ can be written as $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Let $ABC$ be an acute triangle such that $AB<AC$ and $AB<BC$. Let $P$ be a point on the segment $BC$ such that $\angle APB = \angle BAC$. The tangent to the circumcircle of triangle $ABC$ at $A$ meets the circumcircle of triangle $APB$ at $Q \neq A$. Let $Q'$ be the reflection of $Q$ with respect to the midpoint of $AB$. The line $PQ$ meets the segment $AQ'$ at $S$. Prove that $$\frac{1}{AB}+\frac{1}{AC} > \frac{1}{CS}.$$ [i]Authored by Nikola Velov[/i]

Ancient astronaut theorist Nutter B. Butter claims that the Caloprians from planet Calop, 30 light years away and at rest with respect to the Earth, wiped out the dinosaurs. The iridium layer in the crust, he claims, indicates spaceships with the fuel necessary to travel at 30% of the speed of light here and back, and that their engines allowed them to instantaneously hop to this speed. He also says that Caloprians can only reproduce on their home planet. Call the minimum life span, in years, of a Caloprian, assuming some had to reach Earth to wipe out the dinosaurs, $T$. Assume that, once a Caloprian reaches Earth, they instantaneously wipe out the dinosaurs. Then, $T$ can be expressed in the form $m\sqrt{n}$, where $n$ is not divisible by the square of a prime. Find $m+n$. [i](B. Dejean, 6 points)[/i]

Let $ ABC$ be a given triangle with the incenter $ I$, and denote by $ X$, $ Y$, $ Z$ the intersections of the lines $ AI$, $ BI$, $ CI$ with the sides $ BC$, $ CA$, and $ AB$, respectively. Consider $ \mathcal{K}_{a}$ the circle tangent simultanously to the sidelines $ AB$, $ AC$, and internally to the circumcircle $ \mathcal{C}(O)$ of $ ABC$, and let $ A^{\prime}$ be the tangency point of $ \mathcal{K}_{a}$ with $ \mathcal{C}$. Similarly, define $ B^{\prime}$, and $ C^{\prime}$. Prove that the circumcircles of triangles $ AXA^{\prime}$, $ BYB^{\prime}$, and $ CZC^{\prime}$ all pass through two distinct points.

This requires some imagination and creative thinking: Prove or disprove: There exists a solid such that, for all positive integers $n$ with $n \geq 3$, there exists a "parallel projection" (I hope the terminology is clear) such that the image of the solid under this projection is a convex $n$-gon.

We're given two congruent, equilateral triangles $ABC$ and $PQR$ with parallel sides, but one has one vertex pointing up and the other one has the vertex pointing down. One is placed above the other so that the area of intersection is a hexagon $A_1A_2A_3A_4A_5A_6$ (labelled counterclockwise). Prove that $A_1A_4$, $A_2A_5$ and $A_3A_6$ are concurrent.

Given triangle $ABC$. Find the locus of points $M$ such that there is a rotation with center at $M$ that takes $C$ to a certain point on side $AB$.

Let $ABC$ be an acute angled triangle. Let $D,E,F$ be points on $BC, CA, AB$ such that $AD$ is the median, $BE$ is the internal bisector and $CF$ is the altitude. Suppose that $\angle FDE=\angle C, \angle DEF=\angle A$ and $\angle EFD=\angle B.$ Show that $ABC$ is equilateral.

We want to place $2012$ pockets, including variously colored balls, into $k$ boxes such that [b]i)[/b] For any box, all pockets in this box must include a ball with the same color or [b]ii)[/b] For any box, all pockets in this box must include a ball having a color which is not included in any other pocket in this box Find the smallest value of $k$ for which we can always do this placement whatever the number of balls in the pockets and whatever the colors of balls.