mathlesstraveled.com
Testing Fibonacci numbers: the proofs
In my last post I stated this surprising theorem: $latex n$ is a Fibonacci number if and only if one of $latex 5n^2 \pm 4$ is a perfect square. If one of $latex 5n^2 \pm 4$ is a perfect square, the…