Consider the four lines $y = mx-k^2$ for different integer $k$. Let $(x_i,y_i)$, $i = 1,2,3,4$ be four different points , such that each belongs to two different lines and on each line pass through just the two of them. Lat $x_1\leq x_2\leq x_3\leq x_4$. Show that $x_1 + x_4 =x_2+x_3$ and $y_1y_4 =y_2y_3$.

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

Given a line segment $PQ$ with endpoints on the parabola $y=x^2$ such that the area bounded by $PQ$ and the parabola always equal to $\frac 43.$ Find the equation of the locus of the midpoint $M$.

A liquid is moving in an infinite pipe. For each molecule if it is at point with coordinate $x$ then after $t$ seconds it will be at a point of $p(t,x)$. Prove that if $p(t,x)$ is a polynomial of $t,x$ then speed of all molecules are equal and constant.

Consider the $ 12$-sided polygon $ ABCDEFGHIJKL$, as shown. Each of its sides has length $ 4$, and each two consecutive sides form a right angle. Suppose that $ \overline{AG}$ and $ \overline{CH}$ meet at $ M$. What is the area of quadrilateral $ ABCM$? [asy]unitsize(13mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); dotfactor=4; pair A=(1,3), B=(2,3), C=(2,2), D=(3,2), Ep=(3,1), F=(2,1), G=(2,0), H=(1,0), I=(1,1), J=(0,1), K=(0,2), L=(1,2); pair M=intersectionpoints(A--G,H--C)[0]; draw(A--B--C--D--Ep--F--G--H--I--J--K--L--cycle); draw(A--G); draw(H--C); dot(M); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,NE); label("$D$",D,NE); label("$E$",Ep,SE); label("$F$",F,SE); label("$G$",G,SE); label("$H$",H,SW); label("$I$",I,SW); label("$J$",J,SW); label("$K$",K,NW); label("$L$",L,NW); label("$M$",M,W);[/asy]$ \textbf{(A)}\ \frac {44}{3}\qquad \textbf{(B)}\ 16 \qquad \textbf{(C)}\ \frac {88}{5}\qquad \textbf{(D)}\ 20 \qquad \textbf{(E)}\ \frac {62}{3}$

We define a lattice point as a point whose coordinates are integers, zero admitted. Then the number of lattice points on the boundary and inside the region bounded by the $ x$-axis, the line $ x \equal{} 4$, and the parabola $ y \equal{} x^2$ is: $ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 35\qquad \textbf{(C)}\ 34\qquad \textbf{(D)}\ 30\qquad \textbf{(E)}\ \text{not finite}$

Edward starts in his house, which is at (0,0) and needs to go point (6,4), which is coordinate for his school. However, there is a park that shaped as a square and has coordinates (2,1),(2,3),(4,1), and (4,3). There is no road for him to walk inside the park but there is a road for him to walk around the perimeter of the square. How many different shortest road routes are there from Edward's house to his school?

An object in the plane moves from one lattice point to another. At each step, the object may move one unit to the right, one unit to the left, one unit up, or one unit down. If the object starts at the origin and takes a ten-step path, how many different points could be the final point? $ \textbf{(A) } 120 \qquad \textbf{(B) } 121 \qquad \textbf{(C) } 221 \qquad \textbf{(D) } 230 \qquad \textbf{(E) } 231$

The triangle $ABC$ acute with gravity center $M$ is such that $\angle AMB = 2 \angle ACB$. Prove that: [b](a)[/b] $AB^4=AC^4+BC^4-AC^2 \cdot BC^2,$ [b](b)[/b] $\angle ACB \geq 60^o$.

A square in the coordinate plane has vertices whose $y$-coordinates are $0$, $1$, $4$, and $5$. What is the area of the square? $ \textbf{(A)}\ 16\qquad\textbf{(B)}\ 17\qquad\textbf{(C)}\ 25\qquad\textbf{(D)}\ 26\qquad\textbf{(E)}\ 27 $

Chim Tu has a large rectangular table. On it, there are finitely many pieces of paper with nonoverlapping interiors, each one in the shape of a convex polygon. At each step, Chim Tu is allowed to slide one piece of paper in a straight line such that its interior does not touch any other piece of paper during the slide. Can Chim Tu always slide all the pieces of paper off the table in finitely many steps?

On the plane we consider $70$ points $A_1,A_2,...,A_{70}$ with integer coodinates. Suppose each pooints has weight $1$ and the centers of gravity of the triangles $ A_1A_2A_3$, $A_2A_3A_4$, $..$., $A_{68}A_{69}A_{70}$, $A_{69}A_{70}A_{1}$, $A_{70}A_{1}A_{2}$ have integer coodinates. Prove that the centers of gravity of any triple $A_i,A_j,...,A_{k}$ has integer coodinates.

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$

For a positive integer $n$, ($n\ge 2$), find the number of sets with $2n + 1$ points $P_0, P_1,..., P_{2n}$ in the coordinate plane satisfying the following as its elements: - $P_0 = (0, 0),P_{2n}= (n, n)$ - For all $i = 1,2,..., 2n - 1$, line $P_iP_{i+1}$ is parallel to $x$-axis or $y$-axis and its length is $1$. - Out of $2n$ lines$P_0P_1, P_1P_2,..., P_{2n-1}P_{2n}$, there are exactly $4$ lines that are enclosed in the domain $y \le x$.

Let be four positive integers $m, n, p, q$, with $p < m$ given and $q < n$. Take four points $A(0; 0), B(p; 0), C (m; q)$ and $D(m; n)$ in the coordinate plane. Consider the paths $f$ from $A$ to $D$ and the paths $g$ from $B$ to $C$ such that when going along $f$ or $g$, one goes only in the positive directions of coordinates and one can only change directions (from the positive direction of one axe coordinate into the the positive direction of the other axe coordinate) at the points with integral coordinates. Let $S$ be the number of couples $(f, g)$ such that $f$ and $g$ have no common points. Prove that \[S = \binom{n}{m+n} \cdot \binom{q}{m+q-p} - \binom{q}{m+q} \cdot \binom{n}{m+n-p}.\]

Let $K, L, M, N$ be the midpoints of sides $AB, BC, CD, DA$ of a cyclic quadrilateral $ABCD$. Prove that the orthocentres of triangles $ANK, BKL, CLM, DMN$ are the vertices of a parallelogram.

In triangle $ABC$, $AB=13$, $BC=14$, and $CA=15$. Distinct points $D$, $E$, and $F$ lie on segments $\overline{BC}$, $\overline{CA}$, and $\overline{DE}$, respectively, such that $\overline{AD}\perp\overline{BC}$, $\overline{DE}\perp\overline{AC}$, and $\overline{AF}\perp\overline{BF}$. The length of segment $\overline{DF}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? ${ \textbf{(A)}\ 18\qquad\textbf{(B)}\ 21\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 27\qquad\textbf{(E)}\ 30 $

Let $A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8$ be a regular octagon. Let $M_1$, $M_3$, $M_5$, and $M_7$ be the midpoints of sides $\overline{A_1 A_2}$, $\overline{A_3 A_4}$, $\overline{A_5 A_6}$, and $\overline{A_7 A_8}$, respectively. For $i = 1, 3, 5, 7$, ray $R_i$ is constructed from $M_i$ towards the interior of the octagon such that $R_1 \perp R_3$, $R_3 \perp R_5$, $R_5 \perp R_7$, and $R_7 \perp R_1$. Pairs of rays $R_1$ and $R_3$, $R_3$ and $R_5$, $R_5$ and $R_7$, and $R_7$ and $R_1$ meet at $B_1$, $B_3$, $B_5$, $B_7$ respectively. If $B_1 B_3 = A_1 A_2$, then $\cos 2 \angle A_3 M_3 B_1$ can be written in the form $m - \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.

If $a$ and $b$ are each randomly and independently chosen in the interval $[-1, 1]$, what is the probability that $|a|+|b|<1$?

Three unit squares and two line segments connecting two pairs of vertices are shown. What is the area of $\triangle ABC$? [asy] size(200); defaultpen(linewidth(.6pt)+fontsize(12pt)); dotfactor=4; draw((0,0)--(0,2)); draw((0,0)--(1,0)); draw((1,0)--(1,2)); draw((0,1)--(2,1)); draw((0,0)--(1,2)); draw((0,2)--(2,1)); draw((0,2)--(2,2)); draw((2,1)--(2,2)); label("$A$",(0,2),NW); label("$B$",(1,2),N); label("$C$",(4/5,1.55),W); dot((0,2)); dot((1,2)); dot((4/5,1.6)); dot((2,1)); dot((0,0)); [/asy] $ \textbf{(A)}\ \frac{1}{6}\qquad\textbf{(B)}\ \frac{1}{5}\qquad\textbf{(C)}\ \frac{2}{9}\qquad\textbf{(D)}\ \frac{1}{3}\qquad\textbf{(E)}\ \frac{\sqrt2}{4} $

Let $ k$ be a positive constant number. Denote $ \alpha ,\ \beta \ (0<\beta <\alpha)$ the $ x$ coordinates of the curve $ C: y\equal{}kx^2\ (x\geq 0)$ and two lines $ l: y\equal{}kx\plus{}\frac{1}{k},\ m: y\equal{}\minus{}kx\plus{}\frac{1}{k}$.　Find the minimum area of the part bounded by the curve $ C$ and two lines $ l,\ m$.

The graph of $ y \equal{} 2x^2 \plus{} 4x \plus{} 3$ has its: $ \textbf{(A)}\ \text{lowest point at } {(\minus{}1,9)}\qquad \textbf{(B)}\ \text{lowest point at } {(1,1)}\qquad \\ \textbf{(C)}\ \text{lowest point at } {(\minus{}1,1)}\qquad \textbf{(D)}\ \text{highest point at } {(\minus{}1,9)}\qquad \\ \textbf{(E)}\ \text{highest point at } {(\minus{}1,1)}$

Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.