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.
a) What is the maximum number of squares on an \(8\times 8\) grid that can be shaded in with a black pen such that each ‘L’ shaped group of 3 squares has at least one unshaded square.
b) What is the maximum number of squares on an \(8\times 8\) grid that can be shaded in with a black pen, such that each ‘L’ shaped group of 3 squares has at least one shaded square.
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.
Prove that there is a power of 3 that ends in 001.
A \(3\times 3\) square is filled with the numbers \(-1, 0, +1\). Prove that two of the 8 sums in all directions – each row, column, and diagonal – will be equal.
The numbers \(1, 2, \dots , 9\) are divided into three groups. Prove that the product of the numbers in one of the groups will always be no less than 72.
Some whole numbers are placed into a \(10\times 10\) table, so that the difference between any two neighbouring, horizontally or vertically adjacent, squares is no greater than 5. Prove that there will always be two identical numbers in the table.
Prove that in any group of 10 whole numbers there will be a few whose sum is divisible by 10.