Question 19
A magician places n coins in a row, initially all heads up. In each move, the magician chooses three consecutive coins, leaves the middle coin unchanged, and flips the two outside coins. Find all positive integers n for which all n coins can be turned tails up, and prove your answer.
