Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.

Let $S$ be a finite set of points on a plane, where no three points are collinear, and the convex hull of $S$, $\Omega$, is a $2016-$gon $A_1A_2\ldots A_{2016}$. Every point on $S$ is labelled one of the four numbers $\pm 1,\pm 2$, such that for $i=1,2,\ldots , 1008,$ the numbers labelled on points $A_i$ and $A_{i+1008}$ are the negative of each other. Draw triangles whose vertices are in $S$, such that any two triangles do not have any common interior points, and the union of these triangles is $\Omega$. Prove that there must exist a triangle, where the numbers labelled on some two of its vertices are the negative of each other.

The center of a circle and nine randomly selected points on this circle are colored in red. Every pair of those points is connected by a line segment, and every point of intersection of two line segments inside the circle is colored in red. What is the largest possible number of red points? A. $235$ B. $245$ C. $250$ D. $220$ E. $265$

Let $A_1,\ldots,A_n$ be different collinear points. Every point is dyed by one of four colors and every of these colors is used at least once. Show that there is a line segment where two colors are used exactly once and the other two are used at least once.

Given convex $1000$-gon. Inside this polygon, $1020$ points are chosen so that no $3$ of the $2020$ points do not lie on one line. Polygon is cut into triangles so that these triangles have vertices only those specified $2020$ points and each of these points is the vertex of at least one of cutting triangles. How many such triangles were formed?

Prove that for every $n \in N$, $n > 6$, every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.

Given an equilateral triangle, cut it into four polygonal shapes so that, reassembled appropriately, these figures form a square.

An $m \times n$ rectangle is divided into mn unit squares by lines parallel to its sides. A gnomon is the figure of three unit squares formed by deleting one unit square from a $2 \times 2$ square. For what $m, n$ can we divide the rectangle into gnomons so that no two gnomons form a rectangle and no vertex is in four gnomons?

The distance between any two of six given points in the plane is at least $1$. Prove that the distance between some two points is at least $\sqrt{\frac{5+\sqrt5}{2}}$

In Cartesian space, let $\Omega = \{(a, b, c) : a, b, c$ are integers between $1$ and $30\}$. A point of $\Omega$ is said to be [i]visible [/i] from the origin if the segment that joins said point with the origin does not contain any other elements of $\Omega$. Find the number of points of $\Omega$ that are [i]visible [/i] from the origin.

An $8 \times 8$ chessboard is covered completely and without overlaps by $32$ dominoes of size $1 \times 2$. Show that there are two dominoes forming a $2 \times 2$ square.

Let $P$ be a convex polygon in the plane. Show that there exists a circle containing the entire polygon $P$ and having at least three adjacent vertices of $P$ on its boundary.

Let us call "[i]big[/i]" a triangle with all sides longer than $1$. Given a equilateral triangle with all the sides equal to $5$. Prove that: a) You can cut $100$ [i]big [/i] triangles out of given one. b) You can divide the given triangle onto $100$ [i]big [/i] nonintersecting ones fully covering the initial one. c) The same as b), but the triangles either do not have common points, or have one common side, or one common vertex. d) The same as c), but the initial triangle has the side $3$.

Let $n$ be a positive integer and let $0\leq k\leq n$ be an integer. Show that there exist $n$ points in the plane with no three on a line such that the points can be divided into two groups satisfying the following properties. $\text{(i)}$ The first group has $k$ points and the distance between any two distinct points in this group is irrational. $\text{(ii)}$ The second group has $n-k$ points and the distance between any two distinct points in this group is an integer. $\text{(iii)}$ The distance between a point in the first group and a point in the second group is irrational.

A grasshopper is hopping in the angle $x\ge 0, y\ge 0$ of the coordinate plane (that means that it cannot land in the point with negative coordinate). If it is in the point $(x,y)$, it can either jump to the point $(x+1,y-1)$, or to the point $(x-5,y+7)$. Draw a set of such an initial points $(x,y)$, that having started from there, a grasshopper cannot reach any point farther than $1000$ from the point $(0,0)$. Find its area.

We are given $2001$ lines in the plane, no two of which are parallel and no three of which are concurrent. These lines partition the plane into regions (not necessarily finite) bounded by segments of these lines. These segments are called [i]sides[/i], and the collection of the regions is called a [i]map[/i]. Intersection points of the lines are called [i]vertices[/i]. Two regions are [i]neighbors [/i]if they share a side, and two vertices are neighbors if they lie on the same side. A [i]legal coloring[/i] of the regions (resp. vertices) is a coloring in which each region (resp. vertex) receives one color, such that any two neighboring regions (vertices) have different colors. (a) What is the minimum number of colors required for a legal coloring of the regions? (b) What is the minimum number of colors required for a legal coloring of the vertices?

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

Prove that the only way to cover a square of side $1$ with a finite number of circles that do not overlap, it is with only one circle of radius greater than or equal to $\frac{1}{\sqrt2}$. Circles can occupy part of the outside of the square and be of different radii.

$2013$ people run a marathon on a straight road $4m$ wide broad. At any given moment, no two runners are closer $2$ m from each other. Prove that there are two runners that at that moment are more than $1052$ m from each other. Note: Consider runners as points.

We are given $3n$ points $A_1,A_2, \ldots , A_{3n}$ in the plane, no three of them collinear. Prove that one can construct $n$ disjoint triangles with vertices at the points $A_i.$

A kingdom consists of $12$ cities located on a one-way circular road. A magician comes on the $13$th of every month to cast spells. He starts at the city which was the 5th down the road from the one that he started at during the last month (for example, if the cities are numbered $1–12$ clockwise, and the direction of travel is clockwise, and he started at city #$9$ last month, he will start at city #$2$ this month). At each city that he visits, the magician casts a spell if the city is not already under the spell, and then moves on to the next city. If he arrives at a city which is already under the spell, then he removes the spell from this city, and leaves the kingdom until the next month. Last Thanksgiving the capital city was free of the spell. Prove that it will be free of the spell this Thanksgiving as well.

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

Given two distinct points $A_1,A_2$ in the plane, determine all possible positions of a point $A_3$ with the following property: There exists an array of (not necessarily distinct) points $P_1,P_2,...,P_n$ for some $n \ge 3$ such that the segments $P_1P_2,P_2P_3,...,P_nP_1$ have equal lengths and their midpoints are $A_1, A_2, A_3, A_1, A_2, A_3, ...$ in this order.

An architect designed a hexagonal column with $37$ metal tubes of equal thickness. The figure shows the cross-section of this column. Is it possible to build a similar column whose number of tubes ends in $2003$? [img]https://cdn.artofproblemsolving.com/attachments/6/a/eb5714d2324aac8b78042d1f48f03b74ab0d78.png[/img]

Given $100$ points on the plane. Prove that you can cover them with a family of circles with the sum of their diameters less than $100$ and the distance between any two of the circles more than one.