Problems
True or false? Prince Charming went to find Cinderella. He reached the crossroads and started to daydream. Suddenly he sees the Big Bad Wolf. And everyone knows that this Big Bad Wolf on one day answers every question truthfully, and a day later he lies, he proceeds in such a manner on alternate days. Prince Charming can ask the Big Bad Wolf exactly one question, after which it is necessary for him to choose which of the two roads to go on. What question can Prince Charming ask the Big Bad Wolf to find out for sure which of the roads leads to the Magic kingdom?
Five oaks are planted along two linear park alleys in such a way that there are three oaks along each alley, see picture. Where should we plant the sixth oak so that it will be possible to lay two more linear alleys, along each of which there would also be three oak trees growing?
The angle at the top of a crane is \(20^{\circ}\). How will the magnitude of this angle change when looking at the crane with binoculars which triple the size of everything?
In some country there are 101 cities, and some of them are connected by roads. However, every two cities are connected by exactly one path.
How many roads are there in this country?
There are 68 coins, and it is known that any two coins differ in weight. With 100 weighings on a two-scales balance without weights, find the heaviest and lightest coin.
A cat tries to catch a mouse in labyrinths A, B, and C. The cat walks first, beginning with the node marked with the letter “K”. Then the mouse (from the node “M”) moves, then again the cat moves, etc. From any node the cat and mouse go to any adjacent node. If at some point the cat and mouse are in the same node, then the cat eats the mouse.
Can the cat catch the mouse in each of the cases A, B, C?
Two play a game on a chessboard \(8 \times 8\). The player who makes the first move puts a knight on the board. Then they take turns moving it (according to the usual rules), whilst you can not put the knight on a cell which he already visited. The loser is one who has nowhere to go. Who wins with the right strategy – the first player or his partner?
a) The vertices (corners) in a regular polygon with 10 sides are colored black and white in an alternating fashion (i.e. one vertex is black, the next is white, etc). Two people play the following game. Each player in turn draws a line connecting two vertices of the same color. These lines must not have common vertices (i.e. must not begin or end on the same dot as another line) with the lines already drawn. The winner of the game is the player who made the final move. Which player, the first or the second, would win if the right strategy is used?
b) The same problem, but for a regular polygon with 12 sides.
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.
What figure should I put in place of the “?” in the number \(888 \dots 88\,?\,99 \dots 999\) (eights and nines are written 50 times each) so that it is divisible by 7?