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 6 people there are either three pairs of people who know one another, or three pairs of people who do not know one another.
A warehouse contains 200 boots of each of the sizes 8, 9, and 10. Amongst these 600 boots, 300 are left boots and 300 are right boots. Prove that there are at least 100 usable pairs of boots in the warehouse.
Prove that in any group of 10 whole numbers there will be a few whose sum is divisible by 10.
You are given 11 different natural numbers that are less than or equal to 20. Prove that it is always possible to choose two numbers where one is divisible by the other.
a) A piece of wire that is 120 cm long is given. Is it possible, without breaking the wire, to make a cube frame with sides of 10 cm?
b) What is the smallest number of times it will be necessary to break the wire in order to still produce the required frame?
Let \(p\) be a prime number, and \(a\) an integer number not divisible by \(p\). Prove that there is a positive integer \(b\) such that \(ab \equiv 1 \pmod p\).
30 people vote on five proposals. In how many ways can the votes be distributed if everyone votes only for one proposal and only the number of votes cast for each proposal is taken into account?
Prove that there is a vertex in the tree from which exactly one edge emerges (such a vertex is called a hanging top).