Let $n$ be an even positive integer. We consider rectangles with integer side lengths $k$ and $k +1$, where $k$ is greater than $\frac{n}{2}$ and at most equal to $n$. Show that for all even positive integers $ n$ the sum of the areas of these rectangles equals $$\frac{n(n + 2)(7n + 4)}{24}.$$

Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles? A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]

An open half-plane is the set of all points lying to one side of a line, but excluding the points on the line itself. If four open half-planes cover the plane, show that one can select three of them which still cover the plane.

Nair has puzzle pieces shaped like an equilateral triangle. She has pieces of two sizes: large and small. [img]https://cdn.artofproblemsolving.com/attachments/a/1/aedfbfb2cb17bf816aa7daeb0d35f46a79b6e9.jpg[/img] Nair build triangular figures by following these rules: $\bullet$ Figure $1$ is made up of $4$ small pieces, Figure $2$ is made up of $2$ large pieces and $8$ small, Figure $3$ by $6$ large and $12$ small, and so on. $\bullet$ The central column must be made up exclusively of small parts. $\bullet$ Outside the central column, only large pieces can be placed. [img]https://cdn.artofproblemsolving.com/attachments/5/7/e7f6340de0e04d5b5979e72edd3f453f2ac8a5.jpg[/img] Following the pattern, how many pieces will Nair use to build Figure $20$?

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img] Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

The convex quadrilaterals $ABCD$ and $PQRS$ are made respectively from paper and cardboard. We say that they suit each other if the following two conditions are met : ( 1 ) It is possible to put the cardboard quadrilateral on the paper one so that the vertices of the first lie on the sides of the second, one vertex per side, and (2) If, after this, we can fold the four non-covered triangles of the paper quadrilateral on to the cardboard one, covering it exactly. ( a) Prove that if the quadrilaterals suit each other, then the paper one has either a pair of opposite sides parallel or (a pair of) perpendicular diagonals. (b) Prove that if $ABCD$ is a parallelogram, then one can always make a cardboard quadrilateral to suit it. (N. Vasiliev)

Cut an arbitrary triangle into $2019$ pieces so that one of them turns out to be a triangle, one is a quadrilateral, ... one is a $2019$-gon and one is a $2020$-gon. Polygons do not have to be convex.

Let $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.

Let $d \ge 2$ be an integer. Prove that there exists a constant $C(d)$ such that the following holds: For any convex polytope $K\subset \mathbb{R}^d$, which is symmetric about the origin, and any $\varepsilon \in (0, 1)$, there exists a convex polytope $L \subset \mathbb{R}^d$ with at most $C(d) \varepsilon^{1-d}$ vertices such that \[(1-\varepsilon)K \subseteq L \subseteq K.\] Official definitions: For a real $\alpha,$ a set $T \in \mathbb{R}^d$ is a [i]convex polytope with at most $\alpha$ vertices[/i], if $T$ is a convex hull of a set $X \in \mathbb{R}^d$ of at most $\alpha$ points, i.e. $T = \{\sum\limits_{x\in X} t_x x | t_x \ge 0, \sum\limits_{x \in X} t_x = 1\}.$ Define $\alpha K = \{\alpha x | x \in K\}.$ A set $T \in \mathbb{R}^d$ is [i]symmetric about the origin[/i] if $(-1)T = T.$

$3n-1$ points are given in the plane, no three are collinear. Prove that one can select $2n$ of them whose convex hull is not a triangle.

What is the greatest number of parts that $5$ spheres can divide the space into?

Ten points on a plane a such that any four of them lie on the boundary of some square. Is obligatory true that all ten points lie on the boundary of some square?

Several circles are drawn on the plane and all points of their meeting or touching are marked. May be that each circle contains exactly four marked points and exactly four marked points lie on each circle?

There are $n$ points in general position in space (no three lie on the same straight line, no four lie in the same plane). A plane is drawn through every three of them. Prove that If you take any whatever $n-3$ points in space, there is a plane from those drawn that does not contain any of these $n - 3$ points.

An arbitrary number of lines divide the plane into regions. Show that the regions can be colored red and blue so that neighboring regions have different colors.

On a Cartesian plane 101 planes are drawn and all points of intersection are labeled. Is it possible, that for every line, 50 of the points have positive coordinates and 50 of the points have negative coordinates [I]Proposed by S. Ivanov[/i]

Six points are marked inside the $3\times 4$ rectangle. Prove that there is a pair of marked points with the distance between them not greater than $\sqrt5$.

Let $100$ discs lie on the plane in such a way that each two of them have a common point. Prove that there exists a point lying inside at least $15$ of these discs. (M. Kharitonov, A. Polyansky)

Prove that every polyhedron has at least two faces with the same number of sides.

Given $n$ nonintersecting segments in the plane. Not a pair of those belong to the same straight line. We want to add several segments, connecting the ends of given ones, to obtain one nonselfintersecting broken line. Is it always possible?

We are given $100$ points. $N$ of these are vertices of a convex $N$-gon and the other $100 - N$ of these are inside this $N$-gon. The labels of these points make it impossible to tell whether or not they are vertices of the $N$-gon. It is known that no three points are collinear and that no $4$ points belong to two parallel lines. It has been decided to ask questions of the following type: What is the area of the triangle $XYZ$, where $X, Y$ and $Z$ are labels representing three of the $100$ given points? Prove that $300$ such questions are sufficient in order to clarify which points are vertices and to determine the area of the $N$-gon. (D. Fomin, Leningrad)

A square is placed in the plane and a point $P$ is marked in this plane with invisible ink. A certain person can see this point through special glasses. One can draw a straight line and this person will say on which side of the line the point $P$ lies. If $P$ lies on the line, the person says so. What is the minimal number of questions one needs to find out if $P$ lies inside the square or not? (Folklore)

As you know, the moon revolves around the earth. We assume that the Earth and the Moon are points, and the Moon rotates around the Earth in a circular orbit with a period of one revolution per month. The flying saucer is in the plane of the lunar orbit. It can be jumped through the Moon and the Earth - from the old place (point $A$), it instantly appears in the new (at point $A '$) so that either the Moon or the Earth is in the middle of segment $AA'$. Between the jumps, the flying saucer hangs motionless in outer space. 1) Determine the minimum number of jumps a flying saucer will need to jump from any point inside the lunar orbit to any other point inside the lunar orbit. 2) Prove that a flying saucer, using an unlimited number of jumps, can jump from any point inside the lunar orbit to any other point inside the lunar orbit for any period of time, for example, in a second.

John and Mary each have a white $8 \times 8$ square divided into $1 \times 1$ cells. They have painted an equal number of cells on their respective squares in blue. Prove that one can cut up each of the two squares into $2 \times 1 $ dominoes so that it is possible to reassemble John's dominoes into a new square and Mary's dominoes into another square with the same pattern of blue cells. (A Shapovalov)

Let $M$ be the set of all points $(x,y)$ in the cartesian plane, with integer coordinates satisfying $1 \le x \le 12$ and $1 \le y \le 13$. (a) Prove that every $49$-element subset of $M$ contains four vertices of a rectangle with sides parallel to the coordinate axes. (b) Give an example of a $48$-element subset of $M$ without this property.