[seqfan] Re: Mod[Fibonacci[n],n^2]<=Mod[Fibonacci[n],n]

[Jack Brennen]

Unless I'm missing something, that link only shows a lack of
square Fibonacci numbers?  The "Q" only asks whether Fibonacci
numbers can be divisible by a certain square.

Richard Mathar wrote:
> http://list.seqfan.eu/pipermail/seqfan/2010-April/004529.html asks
> 
> zs> Date: Thu, 29 Apr 2010 20:08:36 -0700 (PDT)
> zs> From: zak seidov <zakseidov at yahoo.com>
> zs> To: seqfaneu <seqfan at seqfan.eu>
> zs> Subject: [seqfan]  Mod[Fibonacci[n],n^2]<=Mod[Fibonacci[n],n]
> zs> ..
> zs> Q.Is Mod[Fibonacci[n],n^2]=0 only for n=1,12?
> 
> That's already been conjectured in A128911 and proven in the link in A166074:
> http://math.la.asu.edu/~checkman/SquareFibonacci.html
> 
> 
> _______________________________________________
> 
> Seqfan Mailing list - http://list.seqfan.eu/
> 
>