[seqfan] Is F(p) always squarefree?

[Alonso Del Arte]

Given a prime p, the number Fibonacci(p) might be composite, but, at least
for small p, appears to always be squarefree. This seems like something
that could easily be proven one way or the other with something in Koshy's
book, but the Library is closed today.

Al

-- 
Alonso del Arte
Author at SmashWords.com<https://www.smashwords.com/profile/view/AlonsoDelarte>
Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>