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.
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.
An adventurer is travelling to the planet of liars and truth tellers with an official guide and is introduced to a local. “Are you a truth teller?” asked the adventurer. The alien answers “Yrrg,” which means either “yes” or “no”. The adventurer asks the guide for a translation. The guide says “"yrrg" means "yes". I will add that the local is actully a liar.” Is the local alien liar or truth teller?
Prove that in a game of noughts and crosses on a \(3\times 3\) grid, if the first player uses the right strategy then the second player cannot win.
Vincent makes small weights. He made 4 weights which should have masses (in grams) of 1, 3, 4 and 7, respectively. However, he made a mistake and one of these weights has the wrong mass. By weighing them twice using balance scales (without the use of weights other than those mentioned) can he find which weight has the wrong mass?
There are some coins on a table. One of these coins is fake (has a different weight than a real coin). By weighing them twice using balance scales, determine whether the fake coin is lighter or heavier than a real coin (you don’t need to find the fake coin) if the number of coins is: a) 100; b) 99; c) 98?
Prove that if the irreducible rational fraction \(p/q\) is a root of the polynomial \(P (x)\) with integer coefficients, then \(P (x) = (qx - p) Q (x)\), where the polynomial \(Q (x)\) also has integer coefficients.
A road of length 1 km is lit with streetlights. Each streetlight illuminates a stretch of road of length 1 m. What is the maximum number of streetlights that there could be along the road, if it is known that when any single streetlight is extinguished the street will no longer be fully illuminated?
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?