Problems

You have an \(8\times 8\) chessboard coloured in the usual way. You can pick any \(2\times 1\) or \(1\times 2\) piece and flip the white tiles to black tiles and vice-versa. Is it possible to finish with \(63\) white pieces and \(1\) black piece?

We start with the point \(S=(1,3)\) of the plane. We generate a sequence of points with coordinates \((x_n,y_n)\) with the following rule: \[x_0=1,y_0=3\qquad x_{n+1}=\frac{x_n+y_n}{2}\qquad y_{n+1}=\frac{2x_ny_n}{x_n+y_n}\] Is the point \((3,2)\) in the sequence?

Consider a graph with four vertices and where each vertex is connected to every other one (this is called the complete graph of four vertices, sometimes written as \(K_4\)). We write the numbers \(10,20,30,\) and \(40\) on the vertices. We play the following game: choose any vertex, and subtract three from that vertex, and add one to each of the three other vertices, so an example could be:

After playing this game for some number of steps, can we make the graph have the number \(25\) on each vertex?