Problems

In the diagram below, there are nine discs - each is black on one side, and white on the other side. Two have black face-up right now. Your task is to remove all of the discs by making a series of the following moves. Each move includes choosing a black disc, flipping over its neighbours\(^*\) and removing that black disc. Discs are ‘neighbours’ if they’re adjacent at the beginning - removing a disc creates a gap, so that at later stages, a disc may have two, one or even zero neighbours left. \[\circ\circ\circ\bullet\circ\circ\circ\circ\bullet\] Show that this task is impossible.

Explain why you can’t rotate the sides on a normal Rubik’s cube to get to the following picture (with no removing stickers, painting, or other cheating allowed).

Long before meeting Snow White, the seven dwarves lived in seven different mines. There is an underground tunnel connecting any two mines. All tunnels were separate, so you could not start in one tunnel and somehow end up in another. Is it possible to walk through every tunnel exactly once without retracing your path?

There is a queue of \(n\) truth tellers and liars. The first person says, “more than half of us are liars". The second person says, “more than a quarter of us are liars". The third person says, “more than an eighth of us are liars", and so on, until the \(n\)th person says, “more than \(\frac{1}{2^n}\) of us are liars". Describe what the number of truth-tellers and liars could be, as well as their placement in the queue. Note that the solutions are not fixed numbers.