There are \(n\) inhabitants (\(n>3\)) in the Wonderland. Each habitant has a secret, which is known to him/her only. In a telephone conversation two inhabitants tell each other all the secrets they know. Show that after \((2n-4)\) conversations all the secrets may be spread among all the inhabitants.
The Hatter has 2016 white and 2017 black socks in his drawer. He takes two socks out of the drawer without looking. If the socks he takes out are of the same colour, he throws them away, and puts an additional black sock into the drawer. If the socks he takes out are of different colours, then he throws out the black sock, and puts the white one back. The Hatter continues with his sorting until there is only one sock left in the drawer. What colour is that sock?
The Hatter has a peculiar ancient device, which can perform the following three operations: for each \(x\) and \(y\) it calculates \(x+y\), \(x-y\) and \(\frac{1}{x}\) (for \(x \neq 0\)).
(a) The Hatter claims that he can square any positive real number using the device by performing not more than 6 operations. How can he do it?
(b) Moreover, the Hatter claims that he can multiply any two positive real numbers with the help of the device by performing not more than 20 operations. Can you show how?
(All intermediate results are allowed to be written down, and can be used in further calculations.)
Alice wants to mark 100 points on a plane by drawing it one by one, in such a way that no three points lay on one line, and at any moment while she marks the points down, the shape made up by the points has a symmetry line. Do you think it is possible?
One hundred and one numbers are written down: \(1^2\), \(2^2\), ..., \(101^2\). In one go it is allowed to erase any two numbers and write the absolute value of their difference instead. What is the smallest number which can be obtained as the result of 100 such operations?
Show that in the game “Noughts and Crosses” the second player never wins if the first player is smart enough.
There is a chequered board of dimension \(10 \times 12\). In one go you are allowed to cross out any row or column if it contains at least one square which was not crossed out yet. The loser is the player who cannot make a move. Is there a winning strategy for any player?
Pathways in the Wonderland zoo make a equilateral triangles with middle lines drawn. A monkey has escaped from it’s cage. Two zoo caretakers are catching the monkey. Can zookeepers catch the monkey if all three of them are running only on pathways, the running speeds of the monkey and the zookeepers are equal, and they are all able to see each other?
There is a chequered board of dimension (a) \(9\times 10\), (b) \(9\times 11\). In one go you are allowed to cross out any row or column if it contains at least one square which was not crossed out yet. The loser is the player who cannot make a move. Is there a winning strategy for any player?
Alice and the Hatter play a game. Alice takes a coin in each hand: 2p coin and 5p coin, one coin per hand. Then she multiplies the value of the coin in the left hand by 4, 10, 12, or 26, and the value of the coin in the right hand by 7, 13, 21, or 35. Finally, she adds the two products together, and tells the result to the Hatter. To her surprise, the Hatter immediately knows in which hand she has the 2p coin. How does he do it?