Fibonacci numbers modulo cubes of primes

Abstract: Let

p

be an odd prime. It is well known that

F_{p - (f r a c p 5)} e q u i v 0 p m o d p

, where

{F_{n}}_{n g e 0}

is the Fibonacci sequence and

(-)

is the Jacobi symbol. In this paper we show that if

p o t = 5

then we may determine

F_{p - (f r a c p 5)}

mod

p^{3}

in the following way:

sum_{k=0}^{(p-1)/2}frac{�inom{2k}k}{(-16)^k}equivleft(frac{p}5 ight)left(1+frac{F_{p-(frac {p}5)}}2 ight)pmod{p^3}.

We also use Lucas quotients to determine

modulo

p^{2}

for any integer

m o t e q u i v 0 p m o d p

; in particular, we obtain

sum_{k=0}^{(p-1)/2}frac{�inom{2k}k}{16^k}equivleft(frac3{p} ight)pmod{p^2}.

In addition, we pose three conjectures for further research.

Recommendations

Cited In (14)

Uses Software

This page was built for publication: Fibonacci numbers modulo cubes of primes