In a certain realm there are magicians, sorcerers and wizards. The following is known about them: firstly, not all magicians are sorcerers, and secondly, if the wizard is not a sorcerer, then he is not a magician. Is it true that not all magicians are wizards?
A traveller on the planet of liars and truth tellers met four people and asked them: “Who are you?”. They received the following answers:
1st: “We are all liars.”
2nd: “Among us is exactly one liar.”
3rd: “Among us there are two liars.”
4th: “I have never lied and I’m not lying”.
The traveller quickly realised who the fourth resident was. How did they do it?
In the lower left corner of an 8 by 8 chessboard is a chip. Two in turn move it one cell up, right or right-up diagonally. The one who puts the chip in the upper right corner wins. Who will win in a regular game?
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.
a) There are 10 coins. It is known that one of them is fake (by weight, it is heavier than the real ones). How can you determine the counterfeit coin with three weighings on scales without weights?
b) How can you determine the counterfeit coin with three weighings, if there are 27 coins?
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?
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.
a) Can 4 points be placed on a plane so that each of them is connected by segments with three points (without intersections)?
b) Can 6 points be placed on a plane and connected by non-intersecting segments so that exactly 4 segments emerge from each point?
Several Top Secret Objects are connected by an underground railway in such a way that each Object is directly connected to no more than three others and from each Object one can reach any other Object by going and by changing no more than once. What is the maximum number of Top Secret Objects?