On a rectangular table, there are equal cardboard squares of kkk different colors with sides parallel to the sides of the table. If any kkk squares of different colors are considered, then some two of them can be nailed to the table…
Let Zn\mathbb{Z}^nZn be the integer lattice in Rn\mathbb{R}^nRn . Two points in Zn\mathbb{Z}^nZn are called {\em neighbors} if they differ by exactly 1 in one coordinate and are equal in all other coordinates. For which integers n≥1n \geq 1n≥1…
Find the least positive integer nnn ( n≥3n\geq 3n≥3 ), such that among any nnn points (no three are collinear) in the plane, there exist three points which are the vertices of a non-isoscele triangle.
On a 999×999999 \times 999999×999 board, a limp rook can move in the following way: From any square it can move to any of its adjacent squares, i.e., a square having a common side with it, and every move must be a turn, i.e., the directions of any two…
Given four points on a plane that are not collinear, prove that at least one of the triangles with vertices at these points is not acute-angled.
On a square sheet of paper, there are nnn rectangles drawn with sides parallel to the sides of the sheet. No two of these rectangles share any internal points. Prove that if you cut out these rectangles, the number of pieces into which the…
In 10×1010\times 1010×10 square we choose nnn cells. In every chosen cell we draw one arrow from the angle to opposite angle. It is known, that for any two arrows, or the end of one of them coincides with the beginning of the other, or the dis…
For a fixed positive integer n≥3n \geq 3n≥3 we are given a nnn ×\times× nnn board with all unit squares initially white. We define a floating plusas a 555 -tuple (M,L,R,A,B)(M,L,R,A,B)(M,L,R,A,B) of unit squares such that LLL is in the same row and…
On two parallel lines aaa and bbb, points A1,A2,…,AmA_{1}, A_{2}, \ldots, A_{m}A1,A2,…,Am and B1,B2,…,BnB_{1}, B_{2}, \ldots, B_{n}B1,B2,…,Bn are chosen respectively, and all segments of the form AiBjA_{i}B_{j}AiBj are drawn (1≤i≤m,1≤j≤n)(1 \leq i \leq m, 1 \leq j \leq n)(1≤i≤m,1≤j≤n). How m…
On a checkerboard with 1.251.251.25-inch squares, a square card with a side of 1.751.751.75 inches is placed such that it covers part or all of the area of each of nnn squares. Determine the maximum possible value of nnn.
Let M={A1,A2,…,A5}M=\{A_{1},A_{2},\ldots,A_{5}\}M={A1,A2,…,A5} be a set of five points in the plane such that the area of each triangle AiAjAkA_{i}A_{j}A_{k}AiAjAk , is greater than 3. Prove that there exists a triangle with vertices in MMM and having the area greater th…
A convex nnn-gon is placed inside a square with side length 1. Prove that there exist three vertices A,B,A, B,A,B, and CCC of this nnn-gon such that the area of the triangle ABCABCABC does not exceed: a) 8/n28 / n^{2}8/n2; b) 16π/n316 \pi / n^{3}16π/n3.
Is it possible to arrange 6 long round pencils so that each one touches every other pencil?
Determine all integers n≥3n \geq 3n≥3 satisfying the following property: every convex nnn-gon whose sides all have length 1 contains an equilateral triangle of side length 1. (Every polygon is assumed to contain its boundary.)
Prove that it is possible to place several non-overlapping circles on a plane such that each circle touches exactly five others.
Cells of an infinite grid of paper are colored in black and white in a checkerboard pattern. Let XXX be a triangle with area SSS and vertices at the grid points. Show that there exists a similar triangle XXX with vertices at the grid points…
What is the minimum number of colors required to paint all the cells of a 6 by 6 square grid such that each row, column, and diagonal of the square has all cells with different colors? Note: A diagonal of the square is defined as all rows o…
a) Given an arbitrary quadrilateral, prove that it is possible to tessellate the plane without gaps and overlaps with quadrilaterals that are congruent to the given one. b) Does there exist a pentagon whose copies can tessellate the plane?…
Each face of a convex polyhedron is a triangle, and each edge is labeled with one of the letters aaa, bbb, or ccc, such that each face has all three letters each appearing exactly once on its edges. For each face, when the polyh…
Given n(⩾3)n (\geqslant 3)n(⩾3) lines, exactly p(⩾2)p (\geqslant 2)p(⩾2) of which are parallel, and no 3 lines intersect at the same point, how many regions do these nnn lines divide the plane into?