Problems
Show that \(\text{Nim}(x_1,\dots,x_k)\) is an losing position if and only if \(x_1 \oplus \dots \oplus x_k = 0\). \(x \oplus y\) denotes the nim-sum of \(x\) and \(y\).
Imagine the Earth is a perfectly round solid ball. Let us drill from the North Pole, London and Beijing simultaneously and meet at the centre of Earth. A ball with three openings is formed. The surface of this ball is shown on the left of the picture below. Describe how to stretch this surface so that it looks like the surface of a donut with two holes as shown on the right.
For any real number \(x\), the absolute value of \(x\), written \(\left| x \right|\), is defined to be \(x\) if \(x>0\) and \(-x\) if \(x \leq 0\). What are \(\left| 3 \right|\), \(\left| -4.3 \right|\) and \(\left| 0 \right|\)?
Let \(x\) and \(y\) be real numbers. Prove that \(x \leq \left| x \right|\) and \(0 \leq \left| x \right|\). Then prove that the following inequality holds \(\left| x+y \right| \leq \left| x \right|+\left| y \right|\).
There are \(n\) balls labelled 1 to \(n\). If there are \(m\) boxes labelled 1 to \(m\) containing the \(n\) balls, a legal position is one in which the box containing the ball \(i\) has number at most the number on the box containing the ball \(i+1\), for every \(i\).
There are two types of legal moves: 1. Add a new empty box labelled \(m+1\) and pick a box from box 1 to \(m+1\), say the box \(j\). Move the balls in each box with (box) number at least \(j\) up by one box. 2. Pick a box \(j\), shift the balls in the boxes with (box) number strictly greater than \(j\) down by one box. Then remove the now empty box \(m\).
Prove it is possible to go from an initial position with \(n\) boxes with the ball \(i\) in the box \(i\) to any legal position with \(m\) boxes within \(n+m\) legal moves.
Given a natural number \(n\), find a formula for the number of \(k\) less than \(n\) such that \(k\) is coprime to \(n\). Prove that the formula works.
In the other room there are two doors. The statements on them say:
There is treasure behind at least one of the doors.
There is treasure behind the first door.
Your guide says: The first sign is true if there is treasure behind the first door, otherwise it is false. The second sign is false if there is treasure behind the second door, otherwise it is true. What would you do?
In the last room, there are two doors, but someone broke into this room and the signs that used to be on the doors are now on the floor! You do not know which sign was on which door, but the statements on them say:
There is a trap behind this door.
There are traps behind both doors.
Your guide says: The first sign is true if there is treasure behind the first door, otherwise it is false. The second sign is false if there is treasure behind the second door, otherwise it is true.
But you don’t know which sign is first! What do you do?
Scrooge McDuck has \(100\) golden coins on his office table. He wants to distribute them into \(10\) piles so that no two piles contain the same amount of coins. Moreover, no matter how you divide any of the piles into two smaller piles, among the resulting \(11\) piles there will be two with the same amount of coins. Find an example of how he could do that.
If a magician puts \(1\) dove into his hat, he pulls out \(2\) rabbits and \(2\) flowers from it. If the magician puts \(1\) rabbit in, he pulls out \(2\) flowers and \(2\) doves. If he puts \(1\) flower in, he pulls out \(1\) rabbit and \(3\) doves. The magician starts with \(1\) rabbit. Could he end up with the same number of rabbits, doves, and flowers after performing his hat trick several times?
Today you saw two infinitely long buses with seats numbered as \(1,2,3,...\) carrying infinitely many guests each arriving at the full hotel. How do you accommodate everyone?