33 representatives of four different races – humans, elves, gnomes, and goblins – sit around a round table.
It is known that humans do not sit next to goblins, and that elves do not sit next to gnomes. Prove that some two representatives of the same peoples must be sitting next to one another.
What is the maximum number of rooks – also known as castles – you could place on an 8 by 8 chess board such that no two could take one another? Rooks can attack any number of squares horizontally and vertically, but not diagonally.
Lessons at the Evening Mathematical School take place in nine auditoriums. Amongst the class were 19 students from the same school.
a) Prove that no matter how these students are arranged at least one auditorium will contain no fewer than 3 of these students.
b) Is it true that one of the auditoriums must contain exactly 3 of these students?
Is it possible to find 57 different two digit numbers, such that no sum of any two of them was equal to 100?
A number is written on each edge of a cube. The sum of the 4 numbers on the adjacent edges is written on each face. Place the numbers \(1\) and \(-1\) on the edges so that the numbers written on the faces are all different.
A professional tennis player plays at least one match each day for training purposes. However in order to ensure he does not over-exert himself he plays no more than 12 matches a week. Prove that it is possible to find a group of consecutive days during which the player plays a total of 20 matches.
100 fare evaders want to take a train, consisting of 12 coaches, from the first to the 76th station. They know that at the first station two ticket inspectors will board two coaches. After the 4th station, in the time between each station, one of the ticket inspectors will cross to a neighbouring coach. The ticket inspectors take turns to do this. A fare evader can see a ticket inspector only if the ticket inspector is in the next coach or the next but one coach. At each station each fare evader has time to run along the platform the length of no more than three coaches – for example at a station a fare evader in the 7th coach can run to any coach between the 4th and 10th inclusive and board it. What is the largest number of fare evaders that can travel their entire journey without ever ending up in the same coach as one of the ticket inspectors, no matter how the ticket inspectors choose to move? The fare evaders have no information about the ticket inspectors beyond that which is given here, and they agree their strategy before boarding.
15 MPs take part in a debate. During the debate, each one criticises exactly \(k\) of the 14 other contributors. For what minimum value of \(k\) is it possible to definitively state that there will be two MPs who have criticised one another?
In the number \(1234096\dots\) each digit, starting with the 5th digit is equal to the final digit of the sum of the previous 4 digits. Will the digits 8123 ever occur in that order in a row in this number?
7 natural numbers are written around the edges of a circle. It is known that in each pair of adjacent numbers one is divisible by the other. Prove that there will be another pair of numbers that are not adjacent that share this property.