Problems

Age
Difficulty
Found: 1122

Prove that out of any 11 natural numbers, 2 can be found such that their difference is a multiple of 10.

Eight knights took part in a 3-contest tournament. They competed in archery, sword fighting, and lance throwing. For each contest, a knight was awarded 0, 1 or 2 points. Prove that at least two of these knights earned the same total number of points.

Leo’s grandma placed five empty plates on a square 1 metre\({}\times{}\)1 metre table for dinner. Show that some two of these plates were less than 75 cm apart.

London has more than eight million inhabitants. Show that nine of these people must have the same number of hairs on their heads if it is known that no person has more than one million hairs on his or her head.

Alice took a red marker and marked 5 points with integer coordinates on a coordinate plane. Miriam took a blue marker and marked a midpoint for each pair of red points. Prove that at least 1 of the blue points has integer coordinates.

Each point on a circle was painted red or green. Show that there is an isosceles triangle whose vertices are on the circumference of the circle, such that all three vertices are red or all three are green.

Will and Neal are writing numbers on the blackboard. Each number is only composed of digits \(0\) and \(1\) in its decimal representation (as in, normal base 10 numbers). Will then says “I wonder if there is such a number we could write that can be divided by \(2018\)". Is there?

Anna has a garden shaped like an equilateral triangle of side \(8\) metres. She wants to plant \(17\) plants, but they need space – they need to be at least \(2\) metres apart in order for their roots to have access to all the microelements in the ground. Show that Anna’s garden is unfortunately too small.

A math circle student Emilio wrote a computer program for his house robot, Basil. Starting from 1, Basil should keep writing bigger and bigger numbers formed by 1s: 1, 11, 111, etc. The program terminates when Basil writes a number that is a multiple of 19. Prove that the program will terminate in fewer than 20 steps.