A cube side $5$ is divided into $125$ unit cubes. $N$ of the small cubes are black and the rest white. Find the smallest $N$ such that there must be a row of $5$ black cubes parallel to one of the edges of the large cube.

The set $M$ was formed from the plane by removing three points $A, B, C$, which are vertices of the triangle. What is the smallest number of convex sets whose union is $M$? [hide=original wording] Množina M Vznikla z roviny vyjmutím tří bodů A, B, C, které jsou vrcholy trojúhelníka. Jaký je nejmenší počet konvexních množin, jejichž sjednocením je M?[/hide]

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}.$

What is the largest number of regions into which a plane can be divided by drawing $n$ pairs of parallel lines?

A beam of length $ a $ is suspended horizontally with its ends on two parallel ropes equal $ b $. We turn the beam through an angle $ \varphi $ around a vertical axis passing through the center of the beam. By how much will the beam rise?

Some of the points in the plane are white and some are blue (every point of the plane is either white or blue). Prove that for every positive number $r$: (a) there are at least two points with different color such that the distance between them is equal to $r$; (b) there are at least two points with the same color and the distance between them is equal to $r$; (c) will the statements above be true if the plane is replaced with the real line?

$3n$ lines are drawn on the plane ($n > 1$), such that no two of them are parallel and no three of them are concurrent. Prove that, if $2n$ of the lines are coloured red and the other $n$ lines blue, there are at least two regions of the plane such that all of their borders are red. Note: for each region, all of its borders are contained in the original set of lines, and no line passes through the region.

Let $A$ be a countable set, some of its countable subsets are selected such that; the intersection of any two selected subsets has at most one element. Find the smallest $k$ for which one can ensure that we can color elements of $A$ with $k$ colors such that each selected subsets exactly contain one element of one of the colors and an infinite number of elements of each of the other colors.

Prove that if a sphere can be inscribed in a convex polyhedron and each face of this polyhedron can be painted in one of two colors such that any two faces sharing a common edge are of different colors, then the sum of the areas of the faces of one color is equal to the sum of the areas of the faces of the other color.

On the Cartesian plane, all points with both integer coordinates are painted blue. Two blue points are said to be [i]mutually visible[/i] if the line segment that connects them has no other blue points . Prove that there is a set of $ 2019$ blue points that are mutually visible two by two. [hide=official wording]No plano cartesiano, todos os pontos com ambas coordenadas inteiras são pintados de azul. Dois pontos azuis são ditos mutuamente visíveis se o segmento de reta que os conecta não possui outros pontos azuis. Prove que existe um conjunto de 2019 pontos azuis que são mutuamente visíveis dois a dois.[/hide] PS. There is a comment about problem being wrong / incorrect [url=https://artofproblemsolving.com/community/c6h1957974p14780265]here[/url]

Prove that for a given convex polygon of area $A$ and perimeter $P$ there exists a circle of radius $\frac AP$ that is contained in the interior of the polygon.

Natural numbers from $1$ to $200$ were divided into $50$ sets. Prove that one of them contains three numbers that are the lengths of the sides some triangle.

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

Let $P_1$ be a convex polyhedron with vertices $A_1,A_2,\ldots,A_9$. Let $P_i$ be the polyhedron obtained from $P_1$ by a translation that moves $A_1$ to $A_i$. Prove that at least two of the polyhedra $P_1,P_2,\ldots,P_9$ have an interior point in common.

Let $n$ be a positive integer and let $\triangle$ be the closed triangular domain with vertices at the lattice points $(0, 0), (n, 0)$ and $(0, n)$. Determine the maximal cardinality a set $S$ of lattice points in $\triangle$ may have, if the line through every pair of distinct points in $S$ is parallel to no side of $\triangle$.

Let $ABCD$ be a square with side $20$ and $T_1, T_2, ..., T_{2000}$ are points in $ABCD$ such that no $3$ points in the set $S = \{A, B, C, D, T_1, T_2, ..., T_{2000}\}$ are collinear. Prove that there exists a triangle with vertices in $S$, such that the area is less than $1/10$.

Let $ABCD$ be a square with side length $1$. How many points $P$ inside the square (not on its sides) have the property that the square can be cut into $10$ triangles of equal area such that all of them have $P$ as a vertex? [i]Proposed by Josef Tkadlec - Czech Republic[/i]

Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?

Let two ants stand on the perimeter of a regular $2019$-gon of unit side length. One of them stands on a vertex and the other one is on the midpoint of the opposite side. They start walking along the perimeter at the same speed counterclockwise. The locus of their midpoints traces out a figure $P$ in the plane with $N$ corners. Let the area enclosed by the convex hull of $P$ be $\tfrac{A}{B}\tfrac{\sin^m\left(\tfrac{\pi}{4038}\right)}{\tan\left(\tfrac{\pi}{2019}\right)}$, where $A$ and $B$ are coprime positive integers, and $m$ is the smallest possible positive integer such that this formula holds. Find $A+B+m+N$. [i]Note:[/i] The [i]convex hull[/i] of a figure $P$ is the convex polygon of smallest area which contains $P$.

$n$ lines are given in the plane so that no three of them concur and no two are parallel. Show that there is a non-self-intersecting path consisting of $n$ straight segments so that each of the given lines contains exactly one of the segments of the path.

Let $S$ be the set of all polygonal areas in a plane. Prove that there is a function $f : S \to (0,1)$ which satisfies $f(S_1 \cup S_2) = f(S_1)+ f(S_2)$ for any $S_1,S_2 \in S$ which have common points only on their borders

Each vertex of a cube is assigned $1$ or $-1$. Each face is assigned the product of the four numbers at its vertices. Determine all possible values that can be obtained as the sum of all the $14$ assigned numbers.

A rectangle is drawn on checkered paper, the sides of which form angles of $45^o$ with the grid lines, and the vertices do not lie on the grid lines. Can an odd number of grid lines intersect each side of a rectangle?

On every side of a square $ABCD$, we consider three points different (to each other). a) Find the number of line segments defined with endpoints those points , that do not lie on sides of the square. b) If there are no three of the previous line segments passing through the same point, find how many of the intersection points of those segmens line in the interior of the square.

Consider five points in the plane, no three collinear. The convex hull of this points has area $S$. Prove that there exist three points of them that form a triangle with area at most $\frac{5-\sqrt 5}{10}S$