Is it possible to arrange an infinite number of identical circles on a plane so that any straight line intersects no more than two circles?
In some cells of a 20×2020 \times 2020×20 square, there is an arrow in one of four directions. On the boundary of the square, all arrows point along the boundary in a clockwise direction (see figure). Additionally, arrows in neighboring cells (incl…
a) The sum of the edge lengths of any convex polyhedron is greater than three times its diameter. Prove this. (The diameter of a polyhedron is the longest possible segment connecting two vertices of the polyhedron.) b) For any two vertices…
The squares of an n×nn \times nn×n chessboard are numbered in an arbitrary manner from 1 to n2n^2n2 (every square has a different number). Show that there are two squares with a common side whose numbers differ by at least nnn.
What is the smallest value of nnn such that a square of size n×nn \times nn×n can be divided into squares of sizes 40×4040 \times 4040×40 and 49×4949 \times 4949×49, with both types of squares being present?
What is the maximum number of rooks that can be placed on an 8x8 chessboard so that each can attack no more than one of the others?
nnn positive numbers are given. Is it always possible to find a convex polygon with n+3n+3n+3 edges and a triangulation of it so that the length of the diameters used in the triangulation are the given nnn numbers? *Proposed by Morteza S…
We have 25002^{500}2500 points numbered 1,…,25001, \ldots, 2^{500}1,…,2500 arranged in a certain order on a circle. Show that we can find 100 disjoint chords connecting points such that the sum of the endpoints is the same for each chord.
Prove that any triangle can be divided into no more than three parts, which can be reassembled to form an isosceles triangle.
From a 13×1313 \times 1313×13 chessboard, two opposite corner squares were removed. On the remaining part of the board, several squares were marked. Prove that kings can be placed on the marked squares such that the total number of kings is no more…
A finite set of points XXX and an equilateral triangle TTT are given on a plane. Suppose that every subset X′X'X′ of XXX with no more than 999 elements can be covered by two images of TTT under translations. Prove that the whole s…
From a 12×1212 \times 1212×12 grid, a 4×44 \times 44×4 square is cut out, located at the intersection of the horizontals from the third to the sixth and the same verticals. What is the maximum number of non-attacking rooks that can be placed on this gr…
Let SSS be a set of nnn points in the plane such that no three points in SSS are collinear. Show that the number of triangles with area 1, whose vertices are in SSS, is at most: 2n(n−1)3\frac{2 n(n-1)}{3}32n(n−1)
In a horizontal strip 1×n1 \times n1×n made of nnn unit squares the vertices of all squares are marked. The strip is partitioned into parts by segments connecting marked points and not lying on the sides of the strip. The segments can not h…
There are given 25002^{500}2500 points on a circle labeled 1,2,…,25001,2,\ldots ,2^{500}1,2,…,2500 in some order. Prove that one can choose 100100100 pairwise disjoint chords joining some of theses points so that the 100100100 sums of the pairs of numbers at the e…
What is the minimum number of cells that need to be marked in a 15×1515 \times 1515×15 grid so that in each vertical or horizontal 1×101 \times 101×10 strip, there is at least one marked cell?
Is it possible to cut a non-convex pentagon into two equal pentagons?
The points on the plane are colored in such a way that each point is either red or blue. Show that for any real number x>0x > 0x>0, there exists a color such that two points of that color can be found at a distance of xxx from each othe…
A unit square is divided into a finite number of smaller squares (which may have different sizes). Can the sum of the perimeters of the squares that intersect with the main diagonal be greater than 1993? (If a square intersects with the dia…
A closed broken line is constructed in space such that all segments have the same length and every three consecutive segments are pairwise perpendicular. Prove that the number of segments is divisible by 6.