Find the area of the triangle with vertices of $(1,2)$, $(1,10)$, and $(5, 5)$.

On the graph of a polynomial with integral coefficients are two points with integral coordinates. Prove that if the distance between these two points is integral, then the segment connecting them is parallel to the $x$-axis. [i](4 points)[/i]

Two different ellipses are given. One focus of the first ellipse coincides with one focus of the second ellipse. Prove that the ellipses have at most two points in common.

On the parabola $y = x^2$ lie three different points $P, Q$ and $R$. Their projections $P', Q'$ and $R'$ on the $x$-axis are equidistant and equal to $s$ , i.e. $| P'Q'| = | Q'R'| = s$. Determine the area of $\vartriangle PQR$ in terms of $s$

A point $ (x,y)$ is randomly picked from inside the rectangle with vertices $ (0,0)$, $ (4,0)$, $ (4,1)$, and $ (0,1)$. What is the probability that $ x<y$? $ \textbf{(A)}\ \frac{1}{8} \qquad \textbf{(B)}\ \frac{1}{4} \qquad \textbf{(C)}\ \frac{3}{8} \qquad \textbf{(D)}\ \frac{1}{2} \qquad \textbf{(E)}\ \frac{3}{4}$

Consider all points with integer coordinates in the carthesian plane. If one draws a circle with M(0,0) and a well-chose radius r, the circles goes through some of those points. (like circle with $r=2\sqrt2$ goes through 4 points) Prove that $\forall n\in \mathbb{N}, \exists r$ so that the circle with midpoint 0,0 and radius $r$ goes through at least $n$ points.

There are given points with integer coordinate $(m,n)$ such that $1\leq m,n\leq 4$. Two players, Ana and Ben, are playing a game: First Ana color one of the coordinates with red one, then she pass the turn to Ben who color one of the remaining coordinates with yellow one, then this process they repeate again one after other. The game win the first player who can create a rectangle with same color of vertices and the length of sides are positive integer numbers, otherwise the game is a tie. Does there exist a strategy for any of the player to win the game?

Players $ A,B$ alternately move a knight on a $ 1994\times 1994$ chessboard. Player $ A$ makes only horizontal moves, i.e. such that the knight is moved to a neighboring row, while $ B$ makes only vertical moves. Initally player $ A$ places the knight to an arbitrary square and makes the first move. The knight cannot be moved to a square that was already visited during the game. A player who cannot make a move loses. Prove that player $ A$ has a winning strategy.

Given a cube of unit side. Let $A$ and $B$ be two opposite vertex. Determine the radius of the sphere, with center inside the cube, tangent to the three faces of the cube with common point $A$ and tangent to the three sides with common point $B$.

Find $ [\sqrt{19992000}]$ where $ [x]$ is the greatest integer less than or equal to $ x$.

For a pair $ A \equal{} (x_1, y_1)$ and $ B \equal{} (x_2, y_2)$ of points on the coordinate plane, let $ d(A,B) \equal{} |x_1 \minus{} x_2| \plus{} |y_1 \minus{} y_2|$. We call a pair $ (A,B)$ of (unordered) points [i]harmonic[/i] if $ 1 < d(A,B) \leq 2$. Determine the maximum number of harmonic pairs among 100 points in the plane.

In the acute angle triangle $ABC$ the point $O$ is the center of the circumscribed circle and the lines $OA,OB,OC$ intersect sides $BC,CA,AB$ respectively in points $M,N,P$ such that $\angle NMP=90^o$. [b](a)[/b] Find the ratios $\frac{\angle AMN}{\angle NMC}$,$\frac{\angle AMP}{\angle PMB}$. [b](b)[/b] If any of the angles of the triangle $ABC$ is $60^o$, find the two other angles.

Consider the following transformation of the Cartesian plane: choose a lattice point and rotate the plane $90^\circ$ counterclockwise about that lattice point. Is it possible, through a sequence of such transformations, to take the triangle with vertices $(0,0)$, $(1,0)$ and $(0,1)$ to the triangle with vertices $(0,0)$, $(1,0)$ and $(1,1)$?

Assume there are $ n\ge3$ points in the plane, Prove that there exist three points $ A,B,C$ satisfying $ 1\le\frac{AB}{AC}\le\frac{n\plus{}1}{n\minus{}1}.$

Let $ABC$ be a triangle. Let $\Omega$ be the brocard point. Prove that $\left(\frac{A\Omega}{BC}\right)^2+\left(\frac{B\Omega}{AC}\right)^2+\left(\frac{C\Omega}{AB}\right)^2\ge 1$

Let $w_1, w_2, \dots, w_n$ be complex numbers. A line $L$ in the complex plane is called a mean line for the points $w_1, w_2, \dots, w_n$ if $L$ contains points (complex numbers) $z_1, z_2, \dots, z_n$ such that \[ \sum_{k = 1}^n (z_k - w_k) = 0. \] For the numbers $w_1 = 32 + 170i$, $w_2 = -7 + 64i$, $w_3 = -9 +200i$, $w_4 = 1 + 27i$, and $w_5 = -14 + 43i$, there is a unique mean line with $y$-intercept 3. Find the slope of this mean line.

Given a quadrilateral $ABCD$ such that $AB^2 + CD^2 = AD^2 + BC^2$, prove that $AC \perp BD$.

Let $\omega$ be incircle of $ABC$. $P$ and $Q$ are on $AB$ and $AC$, such that $PQ$ is parallel to $BC$ and is tangent to $\omega$. $AB,AC$ touch $\omega$ at $F,E$. Prove that if $M$ is midpoint of $PQ$, and $T$ is intersection point of $EF$ and $BC$, then $TM$ is tangent to $\omega$. [i]By Ali Khezeli[/i]

Let $S$ be the set of all positive integers of the form $19a+85b$, where $a,b$ are arbitrary positive integers. On the real axis, the points of $S$ are colored in red and the remaining integer numbers are colored in green. Find, with proof, whether or not there exists a point $A$ on the real axis such that any two points with integer coordinates which are symmetrical with respect to $A$ have necessarily distinct colors.

In a rhombus, $ ABCD$, line segments are drawn within the rhombus, parallel to diagonal $ BD$, and terminated in the sides of the rhombus. A graph is drawn showing the length of a segment as a function of its distance from vertex $ A$. The graph is: $ \textbf{(A)}\ \text{A straight line passing through the origin.} \\ \textbf{(B)}\ \text{A straight line cutting across the upper right quadrant.} \\ \textbf{(C)}\ \text{Two line segments forming an upright V.} \\ \textbf{(D)}\ \text{Two line segments forming an inverted V.} \\ \textbf{(E)}\ \text{None of these.}$

Let $n$ be a fixed positive odd integer. Take $m+2$ [b]distinct[/b] points $P_0,P_1,\ldots ,P_{m+1}$ (where $m$ is a non-negative integer) on the coordinate plane in such a way that the following three conditions are satisfied: 1) $P_0=(0,1),P_{m+1}=(n+1,n)$, and for each integer $i,1\le i\le m$, both $x$- and $y$- coordinates of $P_i$ are integers lying in between $1$ and $n$ ($1$ and $n$ inclusive). 2) For each integer $i,0\le i\le m$, $P_iP_{i+1}$ is parallel to the $x$-axis if $i$ is even, and is parallel to the $y$-axis if $i$ is odd. 3) For each pair $i,j$ with $0\le i<j\le m$, line segments $P_iP_{i+1}$ and $P_jP_{j+1}$ share at most $1$ point. Determine the maximum possible value that $m$ can take.

The graph of $r=2+\cos2\theta$ and its reflection over the line $y=x$ bound five regions in the plane. Find the area of the region containing the origin.

Given a set $C$ of points in the plane, it is called the distance of a point $P$ from the plane to the set $C$ at the smallest of the distances from $P$ to each of the points of $C$. Let the sets be $C = \{A,B\}$, with $A = (1, 0)$ and $B = (2, 0)$; and $C'= \{A',B'\}$ with $A' = (0, 1)$ and $B' = (0, 7)$, in an orthogonal reference system. Find and draw the set $M$ of points in the plane that are equidistant from $C$ and $C'$ . Study whether the function whose graph is the set $M$ previously obtained is derivable.

A circle with center $O$ has radius 25. Chord $\overline{AB}$ of length 30 and chord $\overline{CD}$ of length 14 intersect at point $P$. The distance between the midpoints of the two chords is 12. The quantity $OP^2$ can be represented as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find the remainder where $m+n$ is divided by 1000.

The parallelogram bounded by the lines $ y \equal{} ax \plus{} c,y \equal{} ax \plus{} d,y \equal{} bx \plus{} c$ and $ y \equal{} bx \plus{} d$ has area $ 18$. The parallelogram bounded by the lines $ y \equal{} ax \plus{} c,y \equal{} ax \minus{} d,y \equal{} bx \plus{} c,$ and $ y \equal{} bx \minus{} d$ has area $ 72.$ Given that $ a,b,c,$ and $ d$ are positive integers, what is the smallest possible value of $ a \plus{} b \plus{} c \plus{} d$? $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$