Prove that in any group of 2001 whole numbers there will be two whose difference is divisible by 2000.
On an island there are 1,234 residents, each of whom is either a knight (who always tells the truth) or a liar (who always lies). One day, all of the inhabitants of the island were broken up into pairs, and each one said: “He is a knight!" or “He is a liar!" about his partner. Could it eventually turn out to be that the number of “He is a knight!" and “He is a liar!" phrases is the same?
Prove that amongst the numbers of the form \[19991999\dots 19990\dots 0\] – that is 1999 a number of times, followed by a number of 0s – there will be at least one divisible by 2001.
Do you think that among the four consecutive natural numbers there will be at least one that is divisible a) by 2? b) by 3? c) by 4? d) by 5?
Six sacks of gold coins were found on a sunken ship of the fourteenth century. In the first four bags, there were 60, 30, 20 and 15 gold coins. When the coins were counted in the remaining two bags, someone noticed that the number of coins in the bags has a certain sequence. Having taken this into consideration, could you say how many coins are in the fifth and sixth bags?
In a room, there are three-legged stools and four-legged chairs. When people sat down on all of these seats, there were 39 legs (human and stool/chair legs) in the room. How many stools are there in the room?
Find all of the natural numbers that, when divided by 7, have the same remainder and quotient.
a) Prove that within any 6 whole numbers there will be two that have a difference between them that is a multiple of 5.
b) Will this statement remain true if instead of the difference we considered the total?
Two classes with the same number of students took a test. Having checked the test, the strict teacher Mr Jones said that he gave out 13 more twos than other marks (where the marks range from 2 to 5 and 5 is the highest). Was Mr Jones right?
Is the number \(10^{2002} + 8\) divisible by 9?