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?
Is the number \(10^{2002} + 8\) divisible by 9?
Is the sum of the numbers \(1 + 2 + 3 + \dots + 1999\) divisible by 1999?
In an ordinary set of dominoes, there are 28 tiles. How many tiles would a set of dominoes contain if the values indicated on the tiles did not range from 0 to 6, but from 0 to 12?
A class contains 38 pupils. Prove that within the class there will be at least 4 pupils born in the same month.
In the town of Ely, all the families have separate houses. On one fine day, each family moved into another, one of the houses house that used to be occupied by other families. They afterwards decided to paint all houses in red, blue or green colors in such a way that for each family the colour of the new and old houses would not match. Is this always possible to paint te houses in such a way, regardless of how families decided to move?
Restore the numbers. Restore the digits in the following example by dividing as is shown in the image
Given an endless piece of chequered paper with a cell side equal to one. The distance between two cells is the length of the shortest path parallel to cell lines from one cell to the other (it is considered the path of the center of a rook). What is the smallest number of colors to paint the board (each cell is painted with one color), so that two cells, located at a distance of 6, are always painted with different colors?
A group of numbers \(A_1, A_2, \dots , A_{100}\) is created by somehow re-arranging the numbers \(1, 2, \dots , 100\).
100 numbers are created as follows: \[B_1=A_1,\ B_2=A_1+A_2,\ B_3=A_1+A_2+A_3,\ \dots ,\ B_{100} = A_1+A_2+A_3\dots +A_{100}.\]
Prove that there will always be at least 11 different remainders when dividing the numbers \(B_1, B_2, \dots , B_{100}\) by 100.
Prove that in any group of 7 natural numbers – not necessarily consecutive – it is possible to choose three numbers such that their sum is divisible by 3.