[seqfan] Re: Is F(p) always squarefree?

[T. D. Noe]

There is a paper "The Fibonacci sequence module p^2 - An investigation by
computer for p < 10^14" by Elsenhans and Jahnel.  See
http://www.uni-math.gwdg.de/tschinkel/gauss/Fibon.pdf

Best regards,

Tony

At 2:17 PM -0500 1/28/14, Alonso Del Arte wrote:
>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>
>
>_______________________________________________
>
>Seqfan Mailing list - http://list.seqfan.eu/