Problems

Michelle and Mondo play the following game, with Michelle going first. They start with a regular polygon, and take it in turns to move. A move is to pick two non-adjacent points in one polygon, connect them, and split that polygon into two new polygons. A player wins if their opponent cannot move - which happens if there are only triangles left. See the diagram below for an example game with a pentagon. Prove that Michelle has the winning strategy if they start with a decagon (\(10\)-sided polygon).

Let \(n\) be a positive integer. Show that \(1+3+3^2+...+3^{n-1}+3^n=\frac{3^{n+1}-1}{2}\).

Show that all integers greater than or equal to \(8\) can be written as a sum of some \(3\)s and \(5\)s. e.g. \(11=3+3+5\). Note that there’s no way to write \(7\) in such a way.

Without using any wolves, show that Robinson’s goat can only graze shapes that are convex (that means, whenever you pick two points inside the shape, the whole line between them also lies inside). But if Robinson is allowed to use as many wolves as he likes, this restriction disappears. Show that in this case, he can make the goat graze in the shape of any polygon at all.

On a field, there are two pegs, \(A\) and \(B\), placed \(15\) metres apart. Each peg has a small ring placed on top, and a rope can slide freely through these rings.

You have one rope and two goats that want to graze the grass - but they will fight each other if they can both reach the same spot. For what lengths of rope can you arrange things so that the goats cannot reach each other?