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?
Suppose that \(x_1+y_1\sqrt{d}\) gives a solution to Pell’s equation \(x^2-dy^2=1\). Define a sequence \(x_n+y_n\sqrt{d} = (x_1+y_1\sqrt{d})^n\). Show that we have the recurrence relations \(x_{n+2} = 2x_1x_{n+1}-x_n\) and \(y_{n+2} = 2x_1y_{n+1}-y_n\).
Prove that the only solution to \(5^a-3^b=2\) with \(a,b\) being positive integers is \(a=b=1\).
Show that Pell’s equation \(x^2-dy^2=1\) has a nontrivial solution.
For the following equations, find the integer solution \((x,y)\) with the smallest possible absolute value of \(y\).
\(x^2 - 7y^2 = 1\);
\(x^2 - 7y^2 = 29\).
Find the integer solution \((x,y)\) with the smallest possible absolute value of \(y\). \(x^2 - 2y^2 = 1\);
This equation helps to find all the square-triangular numbers, namely all the numbers that are perfect squares and can be represented as the sum \(1+2+3+...m\) for some \(m\). Finding such a number is equivalent to finding a solution to the equation: \(2n^2 = m(m+1)\). Or finding a solution to the Pell’s equation \(x^2-2y^2 = 1\) for \(x=2m+1\), \(y=2n\).
A rectangle has a perimeter of \(1\). Is it possible that its area is larger than \(1000\)?
Zahra has a \(3\times 3\) grid of little squares. Can she write the numbers \(2,4,6,7,8,10,12,14,16\) inside the little square - using each number exactly once - so that the sum of the three numbers in every row is the same?