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.
The alphabet of the Ni-Boom-Boom tribe contains 22 consonants and 11 vowels. A word in this language is defined as any combination of letters in which there are no consecutive consonants and no letter is used more than once. The alphabet is divided into 6 non-empty groups. Prove that it is possible to construct a word from all the letters in the group in at least one of the groups.
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.
11 scouts are working on 5 different badges. Prove that there will be two scouts \(A\) and \(B\), such that every badge that \(A\) is working towards is also being worked towards by \(B\).
Is it possible to place the numbers \(-1, 0, 1\) in a \(6\times 6\) square such that the sums of each row, column, and diagonal are unique?
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\).
How many different four-digit numbers, divisible by 4, can be made up of the digits 1, 2, 3 and 4,
a) if each number can occur only once?
b) if each number can occur several times?