A page of an exercise book is painted with $23$ colours, arranged in squares. A pair of colours is called [i]good [/i] if there are neighbouring squares painted with these colours. What is the minimum number of good pairs?

Some points with the integer coordinates are marked on the coordinate plane. Given a set of nonzero vectors. It is known, that if you apply the beginnings of those vectors to the arbitrary marked point, than there will be more marked ends of the vectors, than not marked. Prove that there is infinite number of marked points.

The parallelepiped is constructed of the equal cubes. Three parallelepiped faces, having the common vertex are painted. Exactly half of all the cubes have at least one face painted. What is the total number of the cubes?

What's the smallest positive integer \( n > 3 \), for which there does [b]not[/b] exist a (not necessarily convex) \( n \)-gon such that all its diagonals have equal lengths? A diagonal of any polygon is defined as a segment connecting any two non-adjacent vertices of the polygon. [i]Proposed by Anton Trygub[/i]

Csongi bought a $12$-sided convex polygon-shaped pizza. The pizza has no interior point with three or more distinct diagonals passing through it. Áron wants to cut the pizza along $3$ diagonals so that exactly $6$ pieces of pizza are created. In how many ways can he do this? Two ways of slicing are different if one of them has a cut line that the other does not have.

Suppose that an isosceles right-angled triangle is divided into $m$ acute-angled triangles. Find the smallest possible $m$ for which this is possible.

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

Each point of a plane is colored in one of three colors: red, black and blue. Prove that there exists a rectangle in this plane whose vertices all have the same color.

Bob plotted $2003$ green points on the plane, so all triangles with three green vertices have area less than $1$. Prove that the $2003$ green points are contained in a triangle $T$ of area less than $4$.

Let $N$ be the number of ways to colour each cell in a $2 \times 50$ rectangle either red or blue such that each $2 \times 2$ block contains at least one blue cell. Show that $N$ is a multiple of $3^{25}$, but not a multiple of $3^{26}$

Let eight points be given in a unit cube. Prove that two of these points are on a distance not greater than $1$.

a) There are $2n$ rays marked in a plane, with $n$ being a natural number. Given that no two marked rays have the same direction and no two marked rays have a common initial point, prove that there exists a line that passes through none of the initial points of the marked rays and intersects with exactly $n$ marked rays. (b) Would the claim still hold if the assumption that no two marked rays have a common initial point was dropped?

2. A unit square paper has a triangle-shaped hole (vertices of the hole are not on the border of the paper). Prove that a triangle with area of $1 / 6$ can be cut from the remaining paper. Alexandr Yuran

There are distinct points $O, A, B, K_1, . . . , K_n, L_1, . . . , L_n$ on a plane such that no three points are collinear. The open line segments $K_1L_1, . . . , K_nL_n$ are coloured red, other points on the plane are left uncoloured. An allowed path from point $O$ to point $X$ is a polygonal chain with first and last vertices at points $O$ and $X$, containing no red points. For example, for $n = 1$, and $K_1 = (-1, 0)$, $L_1 = (1, 0)$, $O = (0,-1)$, and $X = (0,1)$, $OK_1X$ and $OL_1X$ are examples of allowed paths from $O$ to $X$, there are no shorter allowed paths. Find the least positive integer n such that it is possible that the first vertex that is not $O$ on any shortest possible allowed path from $O$ to $A$ is closer to $B$ than to $A$, and the first vertex that is not $O$ on any shortest possible allowed path from $O$ to $B$ is closer to $A$ than to $B$.

For each set $C$ of points in space, we designate by $P_C$ the set of planes containing at least three points of $C$. $\bullet$ Prove that there exists $C$ such that $\phi (P_C) = 1997$, where $\phi$ corresponds to the cardinality. $\bullet$ Determine the least number of points that $C$ must have so that the previous property can be fulfilled.

Let $X= \{A_1, A_2, A_3, A_4\}$ be a set of four distinct points in the plane. Show that there exists a subset $Y$ of $X$ with the property that there is no (closed) disk $K$ such that $K\cap X = Y$.

There are six points on the plane such that one can split them into two triples each creating a triangle. Is it always possible to split these points into two triples creating two triangles with no common point (neither inside, nor on the boundary)?

We have $n$ points in the plane, no three on a line. We call $k$ of them good if they form a convex polygon and there is no other point in the convex polygon. Suppose that for a fixed $k$ the number of $k$ good points is $c_k$. Show that the following sum is independent of the structure of points and only depends on $n$ : \[ \sum_{i=3}^n (-1)^i c_i \]

A man gets lost in a large forest, the boundary of which is a straight line. (We can assume that the forest fills the half-plane.) It is known that the distance from a person to Granina forest does not exceed $2$ km. a) Suggest a path along which he will certainly be able to get out of the forest after walking no more than $14$ km. (Of course, a person does not know in which direction the border of the forest is, BUT he has the opportunity to move along any pre-selected curve. It is believed that a person left the forest as soon as he reached its border, while the border of the forest is invisible to him, no matter how close he would have approached it.) b) Find a path with the same property and length no more than $13$ km.

In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied: 1) Each segment joins two points of the same colour. 2) None of the line segments intersect. 3) For any two points of the same colour there exists a path of segments connecting them. Find the number of "good" colourings.

On a $ 30 \times30 $ square board or placed figures of shape 1 (of 5 squares) (in all four possible positions) and shaped figures of shape 2 (of 4 squares) . The figures do not overlap, they do not pass through the edges of the board and the squares of which they are drawn lie exactly through the squares of the board. a) Prove that the board can be fully covered using $100$ figures of both shapes. b) Prove that if there are already $50$ shaped figures on the board of shape 1, then at least one more figure can be placed on the board. c) Prove that if there are already $28$ figures of both shapes on the board then at least one more figure of both shapes can be placed on the board. [img]https://cdn.artofproblemsolving.com/attachments/3/f/f20d5a91d61557156edf203ff43acac461d9df.png[/img]

A set of $n\ge 9$ points is given on the plane. For any 9 it points can be selected from all circles so that all these points end up on selected circles. Prove that all n points lie on two circles

a) Are there rectangles $1\times \dfrac12$ rectangles lying strictly inside the interior of a unit square? b) Find the minimum number of equilateral triangles of unit side which can cover completely a unit square. [i]Laurențiu Panaitopol[/i]

Given an integer $n \ge 2$ and a regular $2n$-polygon at each vertex of which sitting on an ant. At some points in time, each ant creeps into one of two adjacent peaks (some peaks may have several ants at a time). Through $k$ such operations, it turned out to be an arbitrary line connecting two different ones the vertices of a polygon with ants do not pass through its center. For given $n$ find the lowest possible value of $k$.

1) Is it possible to place five circles on the plane in such way that each circle has exactly 5 common points with other circles? 2) Is it possible to place five circles on the plane in such way that each circle has exactly 6 common points with other circles? 3) Is it possible to place five circles on the plane in such way that each circle has exactly 7 common points with other circles?