Given NNN lines on a plane (N>1N>1N>1), where no three lines intersect at one point and no two lines are parallel. Prove that it is possible to assign nonzero integers to the regions into which these lines divide the plane, such that th…
51 points are inside a square with side length 1. Show that three of them can be found inside a single circle with radius 1/71/71/7.
For which integers N≥3N\ge 3N≥3 can we find NNN points on the plane such that no three are collinear, and for any triangle formed by three vertices of the points’ convex hull, there is exactly one point within that triangle?
Find the minimal natural number nnn with the following property: It is possible to tile the plane with squares whose side lengths belong to the set {1,2,…,n}\{1, 2, \ldots, n\}{1,2,…,n} so that no two squares with the same side length touch along a s…
Given 500 points inside a convex 1000-sided polygon, along with the polygon's vertices (a total of 1500 points), none of which are collinear, the polygon is divided into triangles with these 1500 points as the vertices of the triangles. The…
Let mmm and nnn be positive integers. Mr. Fat has a set SSS containing every rectangular tile with integer side lengths and area of a power of 222 . Mr. Fat also has a rectangle RRR with dimensions 2m×2n2^m \times 2^n2m×2n and a…
Consider a grid of 3x3 points where the points are spaced 0.5 units apart both horizontally and vertically. How many non-congruent triangles can be formed by choosing any three of these nine points as vertices?
Cut a 6×66 \times 66×6 square grid into "L-shaped" tiles consisting of three cells each, such that no two tiles form a 2×32 \times 32×3 rectangular block.
Determine the number of lattice points on the line segment with endpoints (5,23)(5,23)(5,23) and (47,297)(47,297)(47,297). Include both endpoints in your count.
Given nnn points on a plane, the maximum distance between any two points is DDD and the minimum distance is ddd. Prove that Dd>nπ2−1\frac{D}{d}>\frac{\sqrt{n \pi}}{2}-1dD>2nπ−1.
On a 55×5555\times 5555×55 square grid, 500500500 unit squares were cut out as well as 400400400 L-shaped pieces consisting of 3 unit squares (each piece can be oriented in any way) [refer to the figure]. Prove that at least two of the cut out pieces…
In a grid with an m×nm \times nm×n rectangular section, what is the largest perimeter of a non-self-intersecting lattice polygon if every side of the polygon is either vertical or horizontal?
Given 10 points on a plane, we draw the perpendicular bisectors of the line segments they determine. At most, how many points of intersection do these lines have?
In a regular 1000-gon, all diagonals are drawn. What is the maximum number of diagonals that can be selected such that among any three of the chosen diagonals, at least two have the same length?
Inside a regular heptagon, take a point PPP. Connect the point with the vertices of the heptagon. Is it possible to choose PPP such that exactly 4 of these lines intersect the side opposite to their originating vertex at an interior…
Prove that it is impossible to place two triangles, each with an area greater than 1, inside a circle of radius 1 without overlapping.
A polygonal line connects two opposite vertices of a cube with side length 2. Each segment of the line has length 3, and each vertex of the line lies on the faces or edges of the cube. What is the smallest number of segments the line can ha…
On a plane, there is a set DDD of n\mathrm{n}n points P1,P2,…,Pn\mathrm{P}_{1}, \mathrm{P}_{2}, \ldots, \mathrm{P}_{\mathrm{n}}P1,P2,…,Pn such that any three points are not collinear. A line segment is drawn between any two points, and the lengths of these l…
The points on the sides of an equilateral triangle are colored in two colors. Prove that there exists a right triangle with vertices of the same color.
On a line, 100 sets A1,A2,…,A100A_{1}, A_{2}, \ldots, A_{100}A1,A2,…,A100 are chosen, each of which is a union of 100 pairwise disjoint segments. Prove that the intersection of the sets A1,A2,…,A100A_{1}, A_{2}, \ldots, A_{100}A1,A2,…,A100 is a union of no more than 9901 pair…