There are several squares on a rectangular sheet of chequered paper of size \(m \times n\) cells, the sides of which run along the vertical and horizontal lines of the paper. It is known that no two squares coincide and no square contains another square within itself. What is the largest number of such squares?
At what value of \(k\) is the quantity \(A_k = (19^k + 66^k)/k!\) at its maximum? You are given a number \(x\) that is greater than 1. Is the following inequality necessarily fulfilled \(\lfloor \sqrt{\!\sqrt{x}}\rfloor = \lfloor \sqrt{\!\sqrt{x}}\rfloor\)?
In a regular 1981-gon 64 vertices were marked. Prove that there exists a trapezium with vertices at the marked points.
We consider a function \(y = f (x)\) defined on the whole set of real numbers and satisfying \(f (x + k) \times (1 - f (x)) = 1 + f (x)\) for some number \(k \ne 0\). Prove that \(f (x)\) is a periodic function.
Prove that the sequence \(x_n = \sin (n^2)\) does not tend to zero for \(n\) that tends to infinity.
In a square with side length 1 there is a broken line, which does not self-intersect, whose length is no less than 200. Prove that there is a straight line parallel to one of the sides of the square that intersects the broken line at a point no less than 101 units along the line.
A square \(ABCD\) contains 5 points. Prove that the distance between some pair of these points does not exceed \(\frac{1}{2} AC\).
Peter bought an automatic machine at the store, which for 5 pence multiplies any number entered into it by 3, and for 2 pence adds 4 to any number. Peter wants, starting with a unit that can be entered free of charge to get the number 1981 on the machine number whilst spending the smallest amount of money. How much will the calculations cost him? What happens if he wants to get the number 1982?
A white plane is arbitrarily sprinkled with black ink. Prove that for any positive \(l\) there exists a line segment of length \(l\) with both ends of the same colour.
The tracks in a zoo form an equilateral triangle, in which the middle lines are drawn. A monkey ran away from its cage. Two guards try to catch the monkey. Will they be able to catch the monkey if all three of them can run only along the tracks, and the speed of the monkey and the speed of the guards are equal and they can always see each other?