Show that there are infinitely many triples of consecutive integers, each of which is a sum of the square of two integers.
Suppose that Pell’s equation \(x^2-dy^2=1\) has a solution \((x_1,y_1)\) where \(x_1,y_1\) are positive and \(y_1\) is minimal among all solutions with positive \(x,y\). Show that if \(x+y\sqrt{d}\) gives a solution to \(x^2-dy^2=1\), then \(x+y\sqrt{d}=\pm(x_1+y_1\sqrt{d})^k\) for some integer \(k\).
The original “Lights Out” game works like this: a light pattern is shown on the board, and your task is to turn all the lights off. A light pattern is called solvable if you can complete the game starting from that pattern. Ziheng and Jan are playing on an \(n\times n\) board, and they notice that some patterns are unsolvable. Can you find a rule to decide when a pattern is not solvable?