Proof of three conjectures on congruences

Abstract: In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let

p

be an odd prime and let

a

be a positive integer. We show that if

p e q u i v 1 p m o d 4

or

a > 1

then

sum_{k=0}^{lfloorfrac34p^a floor}�inom{-1/2}kequivleft(frac{2}{p^a} ight)pmod{p^2},

where

(-)

denotes the Jacobi symbol. This confirms a conjecture of the second author. We also confirm a conjecture of R. Tauraso by showing that

sum_{k=1}^{p-1}frac{L_k}{k^2}equiv0pmod{p}quad { m provided} p>5,

where the Lucas numbers

L_{0}, L_{1}, L_{2}, l d o t s

are defined by

L_{0} = 2, L_{1} = 1

and

L_{n + 1} = L_{n} + L_{n - 1} (n = 1, 2, 3, l d o t s)

. Our third theorem states that if

p o t = 5

then we can determine

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

mod

p^{3}

in the following way:

sum_{k=0}^{p^a-1}(-1)^k�inom{2k}kequivleft(frac{p^a}5 ight)left(1-2F_{p^a-(frac{p^a}5)} ight) pmod{p^3},

which appeared as a conjecture in a paper of Sun and Tauraso in 2010.

Recommendations

Cites Work

Cited In (18)

This page was built for publication: Proof of three conjectures on congruences