A cube has been divided into $27$ equal-sized sub-cubes. We take a line that passes through the interiors of as many sub-cubes as possible. How many does it pass through?

Given any $22$ points in the plane, no three collinear. Show that the points can be divided into $11$ pairs, so that the $11$ line segments defined by the pairs have at least five different intersections

Let $n, k \geq 3$ be integers, and let $S$ be a circle. Let $n$ blue points and $k$ red points be chosen uniformly and independently at random on the circle $S$. Denote by $F$ the intersection of the convex hull of the red points and the convex hull of the blue points. Let $m$ be the number of vertices of the convex polygon $F$ (in particular, $m=0$ when $F$ is empty). Find the expected value of $m$.

Arnaldo and Bernaldo train for a marathon along a circular track, which has in its center a mast with a flag raised. Arnaldo runs faster than Bernaldo, so that every $30$ minutes of running, while Arnaldo gives $15$ laps on the track, Bernaldo can only give $10$ complete laps. Arnaldo and Bernaldo left at the same moment of the line and ran with constant velocities, both in the same direction. Between minute $1$ and minute $61$ of the race, how many times did Arnaldo, Bernaldo and the mast become collinear?

A set of $1985$ points is distributed around the circumference of a circle and each of the points is marked with $1$ or $-1$. A point is called “good” if the partial sums that can be formed by starting at that point and proceeding around the circle for any distance in either direction are all strictly positive. Show that if the number of points marked with $-1$ is less than $662$, there must be at least one good point.

A square is dissected into rectangles with sides parallel to the sides of the square. For each of these rectangles, the ratio of its shorter side to its longer side is considered. Show that the sum of all these ratios is at least $1$.

The vertices of a prism are colored using two colors, so that each lateral edge has its vertices differently colored. Consider all the segments that join vertices of the prism and are not lateral edges. Prove that the number of such segments with endpoints differently colored is equal to the number of such segments with endpoints of the same color.

Zeus’s lightning is made of a copper rod of length $60$ by bending it $4$ times in alternating directions so that the angle between two adjacent parts is always $60^o$. What is the minimum value of the square of the distance between the two endpoints of the lightning? All five segments of the lightning lie in the same plane. [img]https://cdn.artofproblemsolving.com/attachments/5/1/a18206df4fde561421022c0f2b4332f5ac44a2.png[/img]

A rectangle is divided by $10$ horizontal and $10$ vertical lines into $121$ rectangular cells. If $111$ of them have integer perimeters, prove that they all have integer perimeters.

On a plane is given a finite set of points. Prove that the points can be covered by open squares $Q_1,Q_2,...,Q_n$ such that $1 \le\frac{N_j}{S_j} \le 4$ for $j = 1,...,n,$ where $N_j$ is the number of points from the set inside square $Q_j$ and $S_j$ is the area of $Q_j$.

Consider an $m\times n$ board where $m, n \ge 3$ are positive integers, divided into unit squares. Initially all the squares are white. What is the minimum number of squares that need to be painted red such that each $3\times 3$ square contains at least two red squares? Andrei Eckstein and Alexandru Mihalcu

A paper triangle with the angles $20^o$, $20^o$ and $140^o$ is cut into two triangles by the bisector of one of its angles. Then one of these triangles is cut into two by its bisector, and so on. Prove that it is impossible to get a triangle similar to the initial one. (AI Galochkin)

Let $ u_1, u_2, \ldots, u_m$ be $ m$ vectors in the plane, each of length $ \leq 1,$ with zero sum. Show that one can arrange $ u_1, u_2, \ldots, u_m$ as a sequence $ v_1, v_2, \ldots, v_m$ such that each partial sum $ v_1, v_1 \plus{} v_2, v_1 \plus{} v_2 \plus{} v_3, \ldots, v_1, v_2, \ldots, v_m$ has length less than or equal to $ \sqrt {5}.$

Prove that a square can be divided into any number greater than 5 squares, but cannot be divided into 5 squares.

Give a square of side $1$. Show that for each finite set of points of the sides of the square you can find a vertex of the square with the following property: the arithmetic mean of the squares of the distances from this vertex to the points of the set is greater than or equal to $3/4$.

In a square of area $1$ there are situated $2024$ polygons whose total area is greater than $2023$. Prove that they have a point in common.

(a) Does there exist an innite triangular beam such that two of its cross-sections are similar but not congruent triangles? (b) Does there exist an innite triangular beam such that two of its cross-sections are equilateral triangles of sides $1$ and $2$ respectively?

There is a board with $2010$ rows and $2001$ columns, on it there is a token located in the upper left box that can perform one of the following operations: (A) Walk 3 steps horizontally or vertically. (B) Walk 2 steps to the right and 3 steps down. (C) Walk 2 steps to the left and 2 steps up. With the condition that immediately after carrying out an operation on (B) or (C) it is mandatory to take a step to the right before perform the following operation. It is possible to exit the board, so count the number of steps necessary, entering through the other end of the row or column from which it exits, as if the board outside circular (example: from the beginning you can walk to the square located in row $1$ and column $1999$). Will it be possible that after $2011$ operations allowed the checker to land exactly on the bottom square right?

Given finitely many points in a plane, it is known that the area of the triangle formed by any three points of the set is less than 1. Show that all points of the set lie inside or on boundary of a triangle with area less than 4.

Eva draws an equilateral triangle and its altitudes. In a first step she draws the center triangle of the equilateral triangle, in a second step the center triangle of this center triangle and so on. After each step Eva counts all triangles whose sides lie completely on drawn lines. What is the minimum number of center triangles she must have drawn so that the figure contains more than 2022 such triangles?

In the plane there are two disjoint sets $ A $ and $ B $, each of which consists of $ n $ points, and no three points of the set $ A \cup B $ lie on one straight line. Prove that there is a set of $ n $ disjoint closed segments, each of which has one end in the set $ A $ and the other in the set $ B $.

There are 5 points on plane. Prove that you can chose some of them and shift them such that distances between shifted points won't change and as a result there will be symetric by some line set of 5 points.

A convex quadrilateral of area $1$ is given. Prove that there exist four points in the interior or on the sides of the quadrilateral such that each triangle with the vertices in three of these four points has an area greater than or equal to $1/4$.

A finite number of chords is drawn in a circle $1$ cm in diameter so that any diameter of the circle intersects at most $N$ of these chords. Prove that the sum of the lengths of all chords is less than $3.15 \cdot N$ cm.

Let $n\geqslant 2$ be an integer and $A{}$ a set of $n$ points in the plane. Find all integers $1\leqslant k\leqslant n-1$ with the following property: any two circles $C_1$ and $C_2$ in the plane such that $A\cap\text{Int}(C_1)\neq A\cap\text{Int}(C_2)$ and $|A\cap\text{Int}(C_1)|=|A\cap\text{Int}(C_2)|=k$ have at least one common point. [i]Cristi Săvescu[/i]