Let $n$ be a given positive integer. Say that a set $K$ of points with integer coordinates in the plane is connected if for every pair of points $R, S\in K$, there exists a positive integer $\ell$ and a sequence $R=T_0,T_1, T_2,\ldots ,T_{\ell}=S$ of points in $K$, where each $T_i$ is distance $1$ away from $T_{i+1}$. For such a set $K$, we define the set of vectors \[\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\}\] What is the maximum value of $|\Delta(K)|$ over all connected sets $K$ of $2n+1$ points with integer coordinates in the plane? [i]Grigory Chelnokov, Russia[/i]

A marker is placed at the origin of an integer lattice. Calvin and Hobbes play the following game. Calvin starts the game and each of them takes turns alternatively. At each turn, one can choose two (not necessarily distinct) integers $a, b$, neither of which was chosen earlier by any player and move the marker by $a$ units in the horizontal direction and $b$ units in the vertical direction. Hobbes wins if the marker is back at the origin any time after the first turn. Prove or disprove that Calvin can prevent Hobbes from winning. Note: A move in the horizontal direction by a positive quantity will be towards the right, and by a negative quantity will be towards the left (and similar directions in the vertical case as well).

In a square lattice let us take a lattice triangle that has the smallest area among all the lattice triangles similar to it. Prove that the circumcenter of this triangle is not a lattice point.

$\Delta ABC$ is a right-angled triangle, $\angle C = 90^{\circ}$. Draw a circle centered at $B$ with radius $BC$. Let $D$ be a point on the side $AC$, and $DE$ is tangent to the circle at $E$. The line through $C$ perpendicular to $AB$ meets line $BE$ at $F$. Line $AF$ meets $DE$ at point $G$. The line through $A$ parallel to $BG$ meets $DE$ at $H$. Prove that $GE = GH$.

In rectangle $ ABCD$, points $ F$ and $ G$ lie on $ \overline{AB}$ so that $ AF \equal{} FG \equal{} GB$ and $ E$ is the midpoint of $ \overline{DC}$. Also, $ \overline{AC}$ intersects $ \overline{EF}$ at $ H$ and $ \overline{EG}$ at $ J$. The area of the rectangle $ ABCD$ is $ 70$. Find the area of triangle $ EHJ$. [asy] size(180); pair A, B, C, D, E, F, G, H, J; A = origin; real length = 6; real width = 3.5; B = length*dir(0); C = (length, width); D = width*dir(90); F = length/3*dir(0); G = 2*length/3*dir(0); E = (length/2, width); H = extension(A, C, E, F); J = extension(A, C, E, G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$", A, dir(180)); label("$D$", D, dir(180)); label("$B$", B, dir(0)); label("$C$", C, dir(0)); label("$F$", F, dir(270)); label("$E$", E, dir(90)); label("$G$", G, dir(270)); label("$H$", H, dir(140)); label("$J$", J, dir(340)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {5}{2} \qquad \textbf{(B)} \ \frac {35}{12} \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ \frac {7}{2} \qquad \textbf{(E)} \ \frac {35}{8}$

A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points. Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.

Divide the plane into an infinite square grid by drawing all the lines $x=m$ and $y=n$ for $m,n \in \mathbb Z$. Next, if a square's upper-right corner has both coordinates even, color it black; otherwise, color it white (in this way, exactly $1/4$ of the squares are black and no two black squares are adjacent). Let $r$ and $s$ be odd integers, and let $(x,y)$ be a point in the interior of any white square such that $rx-sy$ is irrational. Shoot a laser out of this point with slope $r/s$; lasers pass through white squares and reflect off black squares. Prove that the path of this laser will form a closed loop.

Consider a $ n \times n$ checkerboard with $ n > 1, n \in \mathbb{N}.$ How many possibilities are there to put $ 2n \minus{} 2$ identical pebbles on the checkerboard (each on a different field/place) such that no two pebbles are on the same checkerboard diagonal. Two pebbles are on the same checkerboard diagonal if the connection segment of the midpoints of the respective fields are parallel to one of the diagonals of the $ n \times n$ square.

Suppose $a$ and $b$ are real numbers such that \[\lim_{x\to 0}\frac{\sin^2 x}{e^{ax}-bx-1}=\frac{1}{2}.\] Determine all possible ordered pairs $(a, b)$.

A cube side 3 is divided into 27 unit cubes. The unit cubes are arbitrarily labeled 1 to 27 (each cube is given a different number). A move consists of swapping the cube labeled 27 with one of its 6 neighbours. Is it possible to find a finite sequence of moves at the end of which cube 27 is in its original position, but cube $n$ has moved to the position originally occupied by $27-n$ (for each $n = 1, 2, \ldots , 26$)?

Let a triangle $ABC$ satisfy $AC = BC$; in other words, let $ABC$ be an isosceles triangle with base $AB$. Let $P$ be a point inside the triangle $ABC$ such that $\angle PAB = \angle PBC$. Denote by $M$ the midpoint of the segment $AB$. Show that $\angle APM + \angle BPC = 180^{\circ}$.

Three distinct points with integer coordinates lie in the plane on a circle of radius $r>0$. Show that two of these points are separated by a distance of at least $r^{1/3}$.

Coordinate axes (without any marks, with the same scale) and the graph of a quadratic trinomial $y = x^2 + ax + b$ are drawn in the plane. The numbers $a$ and $b$ are not known. How to draw a unit segment using only ruler and compass?

A coordinate system was constructed on the board, points $A (1,2)$ and B $(3, 1)$ were marked, and then the coordinate system was erased. Restore the coordinate system at the two marked points.

On the coordinate plane, draw a set of points $M(x,y)$, the coordinates of which satisfy the inequality $$\log_{x+y} (x^2+y^2) \le 1.$$

Consider the points $A(0,12)$, $B(10,9)$, $C(8,0)$, and $D(-4,7)$. There is a unique square $S$ such that each of the four points is on a different side of $S$. Let $K$ be the area of $S$. Find the remainder when $10K$ is divided by $1000$.

An ellipse has foci at $(9,20)$ and $(49,55)$ in the $xy$-plane and is tangent to the $x$-axis. What is the length of its major axis?

A circle with center $ O$ is tangent to the coordinate axes and to the hypotenuse of the $ 30^\circ$-$ 60^\circ$-$ 90^\circ$ triangle $ ABC$ as shown, where $ AB \equal{} 1$. To the nearest hundredth, what is the radius of the circle? [asy]defaultpen(linewidth(.8pt)); dotfactor=3; pair A = origin; pair B = (1,0); pair C = (0,sqrt(3)); pair O = (2.33,2.33); dot(A);dot(B);dot(C);dot(O); label("$A$",A,SW);label("$B$",B,SE);label("$C$",C,W);label("$O$",O,NW); label("$1$",midpoint(A--B),S);label("$60^\circ$",B,2W + N); draw((3,0)--A--(0,3)); draw(B--C); draw(Arc(O,2.33,163,288.5));[/asy]$ \textbf{(A)}\ 2.18\qquad \textbf{(B)}\ 2.24\qquad \textbf{(C)}\ 2.31\qquad \textbf{(D)}\ 2.37\qquad \textbf{(E)}\ 2.41$

An integer lattice point in the Cartesian plane is a point $(x,y)$ where $x$ and $y$ are both integers. Suppose nine integer lattice points are chosen such that no three of them lie on the same line. Out of all 36 possible line segments between pairs of those nine points, some line segments may contain integer lattice points besides the original nine points. What is the minimum number of line segments that must contain an integer lattice point besides the original nine points? Prove your answer.

Construct triangle given all lenght of it altitudes. Please, do it elementary with Euclidian geometry (no trigonometry or coordinate geometry).

A knight is placed at the origin of the Cartesian plane. Each turn, the knight moves in an chess $\text{L}$-shape ($2$ units parallel to one axis and $1$ unit parallel to the other) to one of eight possible location, chosen at random. After $2016$ such turns, what is the expected value of the square of the distance of the knight from the origin?

The two lines with slopes $2$ and $1/2$ pass through an arbitrary point $T$ on the axis $Oy$ and intersect the hyperbola $y=1/x$ at two points. [b]a)[/b] Prove that these four points lie on a circle. [b]b)[/b] The point $T$ runs through the entire $y$-axis. Find the locus of centers of such circles. [i](I. Gorodnin)[/i]

Let $C$ be the graph of $xy = 1$, and denote by $C^*$ the reflection of $C$ in the line $y = 2x$. Let the equation of $C^*$ be written in the form \[ 12x^2 + bxy + cy^2 + d = 0. \] Find the product $bc$.

Consider the points $O = (0,0), A = (- 2,0)$ and $B = (0,2)$ in the coordinate plane. Let $E$ and $F$ be the midpoints of $OA$ and $OB$ respectively. We rotate the triangle $OEF$ with a center in $O$ clockwise until we obtain the triangle $OE'F'$ and, for each rotated position, let $P = (x, y)$ be the intersection of the lines $AE'$ and $BF'$. Find the maximum possible value of the $y$-coordinate of $P$.

Let $l$ some line, that is not parallel to the coordinate axes. Find minimal $d$ that always exists point $A$ with integer coordinates, and distance from $A$ to $l$ is $\leq d$