Fibonacci numbers, sum of squares and divisibility

Solution 1:

Yes. This uses Vieta Jumping. Note first that your $\gcd(a,b) = 1,$ so that $ab| a^2 + b^2 + 1.$ Then $a^2 + b^2 + 1 = 3ab.$ Furthermore, the only Ground Solution, in the sense of Hurwitz 1907, is $(1,1).$ Every solution derives as a finite number of jumps from $1,1.$ That all solutions are Fibonacci numbers, two indices apart, may be proved by induction.

My way of dealing with this is closer to Hurwitz, and consists in looking at the hyperbola branch $x^2 - kxy + y^2 = -1 \; \; \; $ ($x,y>0$) and the location of any GrundLosung, which lie between lines $ y = \frac{k}{2} x$ and $ y = \frac{2}{k} x,$ showing by inequalities that there are no such points when $k \geq 4.$ Indeed, the entire arc on which fundamental solutions lies within $0 \leq x \leq 2, 0 \leq y \leq 2. \; $ The endpoints are $(x_1, y_1)$ and $(y_1, x_1)$ with $x_1 = \frac{2}{\sqrt{k^2-4}}$ and $$ y_1 = \frac{k}{\sqrt{k^2 - 4}} = \sqrt{1 + \frac{4}{k-2}} - \frac{2}{\sqrt{k^2-4}}$$ which is between $1$ and $2 \; . \; \;$ Furthermore, the arc does not pass through $(1,1)$ when $k \geq 4.$