Let $p$ be a prime number and a table of size $(p^2+ p+1)\times (p^2+p + 1)$ which is divided into unit cells. The way to color some cells of this table is called nice if there are no four colored cells that form a rectangle (the sides of rectangle are parallel to the sides of given table). 1. Let $k$ be the number of colored cells in some nice coloring way. Prove that $k \le (p + 1)(p^2 + p + 1)$. Denote this number as $k_{max}$. 2. Prove that all ordered tuples $(a, b, c)$ with $0 \le a, b, c < p$ and $a + b + c > 0$ can be partitioned into $p^2 + p + 1$ sets $S_1, S_2, .. . S_{p^2+p+1}$ such that two tuples $(a_1, b_1, c_1)$ and $(a_2, b_2, c_2)$ belong to the same set if and only if $a_1 \equiv ka_2, b_1 \equiv kb_2, c_1 \equiv kc_2$ (mod $p$) for some $k \in \{1,2, 3, ... , p - 1\}$. 3. For $1 \le i, j \le p^2+p+1$, if there exist $(a_1, b_1, c_1) \in S_i$ and $(a_2, b_2, c_2) \in S_j$ such that $a_1a_2 + b_1b_2 + c_1c_2 \equiv 0$ (mod $p$), we color the cell $(i, j)$ of the given table. Prove that this coloring way is nice with $k_{max}$ colored cells

Let $n\ge 3$ be a positive integer. In the plane $n$ points which are not all collinear are marked. Find the least possible number of triangles whose vertices are all marked. (Recall that the vertices of a triangle are not collinear.)

A graph has $30$ points and each point has $6$ edges. Find the total number of triples such that each pair of points is joined or each pair of points is not joined.

An $n\times n$ square is divided into $n^2$ unit cells. Is it possible to cover this square with some layers of 4-cell figures of the following shape [img]https://cdn.artofproblemsolving.com/attachments/5/7/d42a8011ec4c5c91c337296d8033d412fade5c.png[/img](i.e. each cell of the square must be covered with the same number of these figures) if a) $n=6$? b) $n=7$? (The sides of each figure must coincide with the sides of the cells; the figures may be rotated and turned over, but none of them can go beyond the bounds of the square.)

What is the smallest number of $3$-cell corners that you need to paint in a $5 \times5$ square so that you cannot paint more than one corner of one it? (Shaded corners should not overlap.)

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$

Is it possible to release a ray on a plane from each point with rational coordinates so that no two rays have a common point and at the same time, among the lines containing these rays, no two are parallel and do not coincide? [i]Proposed by P. Kozhevnikov[/i]

Does there exist a convex polygon such that all its sidelengths are equal and all triangle formed by its vertices are obtuse-angled?

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

Let $n$ points lie on the circle. Exactly half of triangles formed by these points are acute-angled. Find all possible $n$. (B.Frenkin)

Is there a six-link broken line in space that passes through all the vertices of a given cube?

A polygonal line of the length $1001$ is given in a unit square. Prove that there exists a line parallel to one of the sides of the square that meets the polygonal line in at least $500$ points.

Given a straight line $\ell$ and the point $O$ out of the line. Prove that it is possible to move an arbitrary point $A$ in the same plane to the $O$ point, using only rotations around $O$ and symmetry with respect to the $\ell$.

A lake is in the shape of a regular hexagon of side length \(1\). Initially there is a single lotus leaf somewhere in the lake, sufficiently far from the shore. Each day, from every existing leaf a new leaf may grow at distance \(\sqrt{3}\) (measured between centers), provided it does not overlap any other leaf. If the lake is large enough that edge effects never interfere, what is the least number of days required to have \(2025\) leaves in the lake?

You are given a square $n \times n$. The centers of some of some $m$ of its $1\times 1$ cells are marked. It turned out that there is no convex quadrilateral with vertices at these marked points. For each positive integer $n \geq 3$, find the largest value of $m$ for which it is possible. [i]Proposed by Oleksiy Masalitin, Fedir Yudin[/i]

Let $\mathcal{S}$ be a set of $2023$ points in a plane, and it is known that the distances of any two different points in $S$ are all distinct. Ivan colors the points with $k$ colors such that for every point $P \in \mathcal{S}$, the closest and the furthest point from $P$ in $\mathcal{S}$ also have the same color as $P$. What is the maximum possible value of $k$? [i]Proposed by Ivan Chan Kai Chin[/i]

We have a board of $ 2011 \times 2011$, divided by lines parallel to the edges into $1 \times 1$ squares. Manuel, Reinaldo and Jorge (at that time order) play to form squares with vertices at the vertices of the grid. The one who forms the last possible square wins, so that its sides do not cut the sides of any unit square. Who can be sure that he will win?

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

Lines parallel to the sides of an equilateral triangle are drawn so that they cut each of the sides into n equal segments and the triangle into n congruent triangles. Each of these n triangles is called a “cell”. Also lines parallel to each of the sides of the original triangle are drawn through each of the vertices of the original triangle. The cells between any two adjacent parallel lines form a “stripe”. (a) If $n =10$, what is the maximum number of cells that can be chosen so that no two chosen cells belong to one stripe? (b)The same question for $n = 9$. (R Zhenodarov)

We color all points of a plane using $3$ colors. Prove that there are at least two points of the plane having same colours and with distance among them $1$.

There are $2016$ different points in the plane. Show that between these points at least $45$ different distances occur.

There are $19$ lines in the plane dividing the plane into exactly $97$ pieces. (a) Prove that among these pieces there is at least one triangle. (b) Show that it is indeed possible to place $19$ lines in the above way.

Let $k$ be a natural number. Determine the number of non-congruent triangles with the vertices at vertices of a given regular $6k$-gon.

There are ten congruent segments on a plane. Each intersection point divides every segment passing through it in the ratio $3:4$. Find the maximum number of intersection points.

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.