The plan considers $51$ points of integer coordinates, so that the distances between any two points are natural numbers. Show that at least $49\%$ of the distances are even.

Prove that for any integer $n\ge 6$ we can divide an equilateral triangle completely into $n$ smaller equilateral triangles.

Determine whether or nor there exist two disjoint infinite sets $ A$ and $ B$ of points in the plane satisfying the following conditions: a.) No three points in $ A \cup B$ are collinear, and the distance between any two points in $ A \cup B$ is at least 1. b.) There is a point of $ A$ in any triangle whose vertices are in $ B,$ and there is a point of $ B$ in any triangle whose vertices are in $ A.$

Find all integers $n\geq 3$ such that there exists a convex $n$-gon $A_1A_2\dots A_n$ which satisfies the following conditions: - All interior angles of the polygon are equal - Not all sides of the polygon are equal - There exists a triangle $T$ and a point $O$ inside the polygon such that the $n$ triangles $OA_1A_2,\ OA_2A_3,\ \dots,\ OA_{n-1}A_n,\ OA_nA_1$ are all similar to $T$, not necessarily in the same vertex order.

On the plane painted $101$ points in brown and another $101$ points in green so that there are no three lying on one line. It turns out that the sum of the lengths of all $5050$ segments with brown ends equals the length of all $5050$ segments with green ends equal to $1$, and the sum of the lengths of all $10201$ segments with multicolored equals $400$. Prove that it is possible to draw a straight line so that all brown points are on one side relative to it and all green points are on the other.

There are $2n+1$ segments on the line. Any segment intersects at with at least $n$ others. Prove that there is a segment that intersects all the others.

There are $20$ points in the plane and no three of them are collinear. Of these points $10$ are red while the other $10$ are blue. Prove that there exists a straight line such that there are $5$ red points and $5$ blue points on either side of this line. (A Kushnirenko, Moscow)

A figure with area $1$ is cut out of paper. We divide this figure into $10$ parts and color them in $10$ different colors. Now, we turn around the piece of paper, divide the same figure on the other side of the paper in $10$ parts again (in some different way). Show that we can color these new parts in the same $10$ colors again (hereby, different parts should have different colors) such that the sum of the areas of all parts of the figure colored with the same color on both sides is $\geq \frac{1}{10}.$

The plane shows $2020$ straight lines in general position, that is, there are none three intersecting at one point but no two parallel. Let's say, that the drawn line $a$ [i]detaches [/i] the drawn line $b$ if all intersection points of line $b$ with the other drawn lines lie in one half plane wrt to line $a$ (given the most straightforward $a$). Prove that you can be guaranteed find two drawn lines $a$ and $b$ that $a$ detaches $b$, but $b$ does not detach $a$.

What is the smallest number of disks radius $\frac12$ that can cover a disk radius $1$?

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a $2 \times 2$ square. What is the smallest possible number of polygons? [missing figure]

Is it possible to tile space using a combination of regular tetrahedra and regular octahedra? (A Belov)

Is it possible to place some circles inside a square side length $1$, such that no two circles intersect and the sum of their radii is $2007$?

A rectangle-shaped puzzle is assembled with $2000$ pieces that are all equal rectangles, and similar to the large rectangle, so that the sides of the small rectangles are parallel to those of the large one. The shortest side of each piece measures $1$. Determine what is the minimum possible value of the area of the large rectangle.

For a given positive integer $n >2$, let $C_{1},C_{2},C_{3}$ be the boundaries of three convex $n-$ gons in the plane , such that $C_{1}\cap C_{2}, C_{2}\cap C_{3},C_{1}\cap C_{3}$ are finite. Find the maximum number of points of the sets $C_{1}\cap C_{2}\cap C_{3}$.

Three lines are drawn in a plane. Which of the following could NOT be the total number of points of intersections? (A) $0$ (B) $1$ (C) $2$ (D) $3$ (E) They all could.

Let $n$ be an integer, $n \ge 3$. Select $n$ points on the plane, none of which are three on the same line. Consider all triangles with vertices at selected points, denote the smallest of all the interior angles of these triangles by the variable $\alpha$. Find the largest possible value of $\alpha$ and identify all the selected $n$ point placements for which the max occurs.

Call a convex polyhedron a [i]footballoid [/i] if it has the following properties. (1) Any face is either a regular pentagon or a regular hexagon. (2) All neighbours of a pentagonal face are hexagonal (a [i]neighbour [/i] of a face is a face that has a common edge with it). Find all possibilities for the number of pentagonal and hexagonal faces of a footballoid.

The vertices of a convex $n$-gon are colored so that adjacent vertices have different colors. Prove that if $n$ is odd, then the polygon can be divided into triangles with non-intersecting diagonals such that no diagonal has its endpoints the same color.

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

Find all positive integer $k$ such that one can find a number of triangles in the Cartesian plane, the centroid of each triangle is a lattice point, the union of these triangles is a square of side length $k$ (the sides of the square are not necessarily parallel to the axis, the vertices of the square are not necessarily lattice points), and the intersection of any two triangles is an empty-set, a common point or a common edge.

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

There are $4n$ segments of unit length inside a circle radius $n$. Show that given any line $L$ there is a chord of the circle parallel or perpendicular to $L$ which intersects at least two of the $4n$ segments.

On a circle we consider a set $M$ consisting of $n$ ($n \ge 3$) points, of which only one is colored red. Determine of which polygons inscribed in a circle having the vertices in the set $M$ are more: those that contain the red dot or those that do not contain those points? How many more are there than others?

a) Prove that it is impossible to divide a rectangle into five squares of distinct sizes. b) Prove that it is impossible to divide a rectangle into six squares of distinct sizes.