Why is $ \frac{5}{64}((161+72\sqrt{5})^{-n}+(161+72\sqrt{5})^{n}-2)$ always a perfect square

combinatoricsdiscrete mathematicselementary-number-theoryrecursionsequences-and-series

I'm working on a puzzle, and the solution requires me somehow establishing that

$$ f(n):=\frac{5}{64}\Big(\big(161+72\sqrt{5}\big)^{-n}+\big(161+72\sqrt{5}\big)^{n}-2\Big)$$

is a perfect square for $n\in \mathbb{Z}_{\geq 0}$.

I've done a lot of simplification to get to this point, and am stuck here. I can provide the context of the puzzle if necessary, but it's pretty far removed from what I have here. The goal is basically to show that a formula generates solutions to a given equation.

Any tips on how to proceed?

Here's the first few values:

$$\begin{array}{|c|c|}
\hline
n&\text{value}\\ \hline
0&0\\ \hline
1& 5^2 \\ \hline
2&90^2 \\ \hline
3& 1615^2\\ \hline
4& 28980^2\\ \hline
\end{array}$$

Best Answer

Let $a=9+4\sqrt{5}$, then $$f(n) = {5\over 64}(a^n-a^{-n})^2$$

Now let $$b_n = {\sqrt{5}\over 8}(a^n-a^{-n})$$

so it is enought to prove that every $b_n$ is an integer. This can be done easly if you write a recursive formula for $b_n$:

$$b_{n+1}= 18b_n-b_{n-1}$$ where $b_0=0$ and $b_1=5$ and prove that fact with induction.

Related Question