In the Cartesian plane, a line segment is called [i]tame[/i] if it lies parallel to one of the coordinate axes and its distance to this axis is an integer. Otherwise it is called [i]wild[/i]. Let $m$ and $n$ be odd positive integers. The rectangle with vertices $(0,0),(m,0),(m,n)$ and $(0,n)$ is partitioned into finitely many triangles. Let $M$ be the set of these triangles. Assume that (1) Each triangle from $M$ has at least one tame side. (2) For each tame side of a triangle from $M$, the corresponding altitude has length $1$. (3) Each wild side of a triangle from $M$ is a common side of exactly two triangles from $M$. Show that at least two triangles from $M$ have two tame sides each.

In the usual coordinate system $ xOy$ a line $ d$ intersect the circles $ C_1:$ $ (x\plus{}1)^2\plus{}y^2\equal{}1$ and $ C_2:$ $ (x\minus{}2)^2\plus{}y^2\equal{}4$ in the points $ A,B,C$ and $ D$ (in this order). It is known that $ A\left(\minus{}\frac32,\frac{\sqrt3}2\right)$ and $ \angle{BOC}\equal{}60^{\circ}$. All the $ Oy$ coordinates of these $ 4$ points are positive. Find the slope of $ d$.

Let $ a<a'<b<b'$ be real numbers and let the real function $ f$ be continuous on the interval $ [a,b']$ and differentiable in its interior. Prove that there exist $ c \in (a,b), c'\in (a',b')$ such that \[ f(b)\minus{}f(a)\equal{}f'(c)(b\minus{}a),\] \[ f(b')\minus{}f(a')\equal{}f'(c')(b'\minus{}a'),\] and $ c<c'$. [i]B. Szokefalvi Nagy[/i]

Let $ P$ be a point in the plane of a triangle $ ABC$. Lines $ AP,BP,CP$ respectively meet lines $ BC,CA,AB$ at points $ A',B',C'$. Points $ A'',B'',C''$ are symmetric to $ A,B,C$ with respect to $ A',B',C',$ respectively. Show that: $ S_{A''B''C''}\equal{}3S_{ABC}\plus{}4S_{A'B'C'}$.

A line through the origin passes through the curve whose equation is $5y=2x^2-9x+10$ at two points whose $x-$coordinates add up to $77.$ Find the slope of the line.

Show that a polynomial of odd degree $2m+1$ over $\mathbb{Z}$, \[f(x)=c_{2m+1}x^{2m+1}+\cdots+c_{1}x+c_{0},\] is irreducible if there exists a prime $p$ such that \[p \not\vert c_{2m+1}, p \vert c_{m+1}, c_{m+2}, \cdots, c_{2m}, p^{2}\vert c_{0}, c_{1}, \cdots, c_{m}, \; \text{and}\; p^{3}\not\vert c_{0}.\]

A rectangular pool table has a hole at each of three of its corners. The lengths of sides of the table are the real numbers $a$ and $b$. A billiard ball is shot from the fourth corner along its angle bisector. The ball falls in one of the holes. What should the relation between $a$ and $b$ be for this to happen?

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...

Let $ABXC$ be a parallelogram. Points $K,P,Q$ lie on $\overline{BC}$ in this order such that $BK = \frac{1}{3} KC$ and $BP = PQ = QC = \frac{1}{3} BC$. Rays $XP$ and $XQ$ meet $\overline{AB}$ and $\overline{AC}$ at $D$ and $E$, respectively. Suppose that $\overline{AK} \perp \overline{BC}$, $EK-DK=9$ and $BC=60$. Find $AB+AC$. [i]Proposed by Evan Chen[/i]

A parallelogram $ABCD$ is given. The excircle of triangle $\triangle{ABC}$ touches the sides $AB$ at $L$ and the extension of $BC$ at $K$. The line $DK$ meets the diagonal $AC$ at point $X$; the line $BX$ meets the median $CC_1$ of trianlge $\triangle{ABC}$ at ${Y}$. Prove that the line $YL$, median $BB_1$ of triangle $\triangle{ABC}$ and its bisector $CC^\prime$ have a common point. [i](A. Golovanov)[/i]

Let be a number $ x $ and three positive numbers $ a,b,c $ such that $ a^x+b^x=c^x. $ Prove that $ a^y,b^y,c^y $ are the lenghts of the sides of an obtuse triangle if and only if $ y<x<2y. $

Let $ABC$ be an acute-angled triangle with $AB<AC$ and let $O$ be the centre of its circumcircle $\omega$. Let $D$ be a point on the line segment $BC$ such that $\angle BAD = \angle CAO$. Let $E$ be the second point of intersection of $\omega$ and the line $AD$. If $M$, $N$ and $P$ are the midpoints of the line segments $BE$, $OD$ and $AC$, respectively, show that the points $M$, $N$ and $P$ are collinear.

A polynomial $p(x)$ has remainder three when divided by $x-1$ and remainder five when divided by $x-3$. The remainder when $p(x)$ is divided by $(x-1)(x-3)$ is $\textbf{(A) }x-2\qquad\textbf{(B) }x+2\qquad\textbf{(C) }2\qquad\textbf{(D) }8\qquad \textbf{(E) }15$

In the $3$-dimensional coordinate space nd the distance from the point $(36, 36, 36)$ to the plane that passes through the points $(336, 36, 36)$, $(36, 636, 36)$, and $(36, 36, 336)$.

Prove that a circle centered at point $(\sqrt{2},\sqrt{3})$ in the cartesian plane passes through at most one point with integer coordinates. I tried to prove that any circle with center at $(0,0)$ has at most one point with coordinates $(a-\sqrt{2},b-\sqrt{3})$;$a,b \in \mathbb{Z}$. So that when we translate the center to $(\sqrt{2},\sqrt{3})$ we have what we wanted to show.

Let $K$ be a convex polygon in the plane and suppose that $K$ is positioned in the coordinate system in such a way that \[\text{area } (K \cap Q_i) =\frac 14 \text{area } K \ (i = 1, 2, 3, 4, ),\] where the $Q_i$ denote the quadrants of the plane. Prove that if $K$ contains no nonzero lattice point, then the area of $K$ is less than $4.$

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$.

A circle centered at a point $(0, 1)$ on the coordinate plane intersects the parabola $y = x^2$ at four points: $A, B, C, D.$ Find the largest possible value of the area of ​​the quadrilateral $ABCD$.

Let $ABC$ be a triangle with $AB = 5$, $AC = 8$, and $BC = 7$. Let $D$ be on side $AC$ such that $AD = 5$ and $CD = 3$. Let $I$ be the incenter of triangle $ABC$ and $E$ be the intersection of the perpendicular bisectors of $\overline{ID}$ and $\overline{BC}$. Suppose $DE = \frac{a\sqrt{b}}{c}$ where $a$ and $c$ are relatively prime positive integers, and $b$ is a positive integer not divisible by the square of any prime. Find $a+b+c$. [i]Proposed by Ray Li[/i]

In the coordinate plane a parabola passes through the points $(7,6)$, $(7,12)$, $(18,19)$, and $(18,48)$. The axis of symmetry of the parabola is a line with slope $\tfrac{r}{s}$ where r and s are relatively prime positive integers. Find $r + s$.

A particle is placed on the parabola $ y \equal{} x^2 \minus{} x \minus{} 6$ at a point $ P$ whose $ y$-coordinate is $ 6$. It is allowed to roll along the parabola until it reaches the nearest point $ Q$ whose $ y$-coordinate is $ \minus{}6$. The horizontal distance traveled by the particle (the numerical value of the difference in the $ x$-coordinates of $ P$ and $ Q$) is: $ \textbf{(A)}\ 5\qquad \textbf{(B)}\ 4\qquad \textbf{(C)}\ 3\qquad \textbf{(D)}\ 2\qquad \textbf{(E)}\ 1$

We play the following game in a Cartesian coordinate system in the plane. Given the input $(x,y)$, in one step, we may move to the point $(x,y\pm 2x)$ or to the point $(x\pm 2y,y)$. There is also an additional rule: it is not allowed to make two steps that lead back to the same point (i.e, to step backwards). Prove that starting from the point $\left(1;\sqrt 2\right)$, we cannot return to it in finitely many steps.

Let $l,\ m$ be the tangent lines passing through the point $A(a,\ a-1)$ on the line $y=x-1$ and touch the parabola $y=x^2$. Note that the slope of $l$ is greater than that of $m$. (1) Exress the slope of $l$ in terms of $a$. (2) Denote $P,\ Q$ be the points of tangency of the lines $l,\ m$ and the parabola $y=x^2$. Find the minimum area of the part bounded by the line segment $PQ$ and the parabola $y=x^2$. (3) Find the minimum distance between the parabola $y=x^2$ and the line $y=x-1$.

Two circles of radius 1 are to be constructed as follows. The center of circle $ A$ is chosen uniformly and at random from the line segment joining $ (0,0)$ and $ (2,0)$. The center of circle $ B$ is chosen uniformly and at random, and independently of the first choice, from the line segment joining $ (0,1)$ to $ (2,1)$. What is the probability that circles $ A$ and $ B$ intersect? $ \textbf{(A)} \; \frac{2\plus{}\sqrt{2}}{4} \qquad \textbf{(B)} \; \frac{3\sqrt{3}\plus{}2}{8} \qquad \textbf{(C)} \; \frac{2 \sqrt{2} \minus{} 1}{2} \qquad \textbf{(D)} \; \frac{2\plus{}\sqrt{3}}{4} \qquad \textbf{(E)} \; \frac{4 \sqrt{3} \minus{} 3}{4}$