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?
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 numbers \(a_1, a_2, \dots , a_{1985}\) are the numbers \(1, 2, \dots , 1985\) rearranged in some order. Each number \(a_k\) is multiplied by its number \(k\), and then the largest number is chosen among the resulting 1985 products. Prove that it is not less than \(993^2\).
The product of 1986 natural numbers has exactly 1985 different prime factors. Prove that either one of these natural numbers, or the product of several of them, is the square of a natural number.
The product of a group of 48 natural numbers has exactly 10 prime factors. Prove that the product of some four of the numbers in the group will always give a square number.
7 different digits are given. Prove that for any natural number \(n\) there is a pair of these digits, the sum of which ends in the same digit as the number.
A council of 2,000 deputies decided to approve a state budget containing 200 items of expenditure. Each deputy prepared his draft budget, which indicated for each item the maximum allowable, in his opinion, amount of expenditure, ensuring that the total amount of expenditure did not exceed the set value of \(S\). For each item, the board approves the largest amount of expenditure that is agreed to be allocated by no fewer than \(k\) deputies. What is the smallest value of \(k\) for which we can ensure that the total amount of approved expenditures does not exceed \(S\)?
Prove that in any group of 2001 whole numbers there will be two whose difference is divisible by 2000.
Prove that there is a number of the form
a) \(1989 \dots 19890 \dots 0\) (the number 1989 is repeated several times, and then there are a few zeros), which is divisible by 1988;
b) \(1988 \dots 1988\), which is divisible by 1989.
A board of size \(2005\times2005\) is divided into square cells with a side length of 1 unit. Some board cells are numbered in some order by numbers 1, 2, ... so that from any non-numbered cell there is a numbered cell within a distance of less than 10. Prove that there can be found two cells with a distance between them of less than 150, which are numbered by numbers that differ by more than 23. (The distance between the cells is the distance between their centres.)