Quadratic Residue of Fibonacci numbers

198 Views Asked by At

Prove that if $p$ is prime, then:

$F_p = (\frac{5}{p})$ mod $p$.

I tried finding residues $(\frac{5}{p}) $ in the sequence, but I haven't found anything. I have no idea how to utilize the sequence. Maybe there is a connection with Binet's Formula?