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.
One three-digit number consists of different digits that are in ascending order, and in its name all words begin with the same letter. The other three-digit number, on the contrary, consists of identical digits, but in its name all words begin with different letters. What are these numbers?
Four friends came to an ice-rink, each with her brother. They broke up into pairs and started skating. It turned out that in each pair the “gentleman” was taller than the “lady” and no one is skating with his sister. The tallest boy in the group was Sam Smith, Peter Potter, then Luisa Potter, Joe Simpson, Laura Simpson, Dan Caldwell, Jane Caldwell and Hannah Smith. Determine who skated with whom.
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?
Write the first 10 prime numbers in a line. How can you remove 6 digits to get the largest possible number?
Is it possible to fill a \(5 \times 5\) table with numbers so that the sum of the numbers in each row is positive and the sum of the numbers in each column is negative?
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.