Is it possible to arrange natural numbers from 1 to \(2002^2\) in the cells of a \(2002\times2002\) table so that for each cell of this table one could choose a triplet of numbers, from a row or column, where one of the numbers is equal to the product of the other two?
Is it possible to arrange the numbers 1, 2, ..., 60 in a circle in such an order that the sum of every two numbers, between which lies one number, is divisible by 2, the sum of every two numbers between which lie two numbers, is divisible by 3, the sum of every two numbers between which lie six numbers, is divisible by 7?
A set of weights has the following properties: It contains \(5\) weights, which are all different in weight. For any two weights, there are two other weights of the same total weight. What is the smallest number of weights that can be in this set?
Five teams participated in a football tournament. Each team had to play exactly one match with each of the other teams. Due to financial difficulties, the organisers cancelled some of the games. As a result, it turned out that all teams scored a different number of points and no team scored zero points. What is the smallest number of games that could be played in the tournament, if three points were awarded for a victory, one for a draw and zero for a defeat?
A cinema contains 7 rows each with 10 seats. A group of 50 children went to see the morning screening of a film, and returned for the evening screening. Prove that there will be two children who sat in the same row for both the morning and the evening screening.
On a chessboard, \(n\) white and \(n\) black rooks are arranged so that the rooks of different colours cannot capture one another. Find the greatest possible value of \(n\).
Can 100 weights of masses 1, 2, 3, ..., 99, 100 be arranged into 10 piles of different masses so that the following condition is fulfilled: the heavier the pile, the fewer weights in it?
You are given 12 different whole numbers. Prove that it is possible to choose two of these whose difference is divisible by 11.
Several football teams are taking part in a football tournament, where each team plays every other team exactly once. Prove that at any point in the tournament there will be two teams who have played exactly the same number of matches up to that point.
Prove that amongst numbers written only using the number 1, i.e.: 1, 11, 111, etc, there is a number than is divisible by 1987.