New congruences for central binomial coefficients

Details New congruences for central binomial coefficients New congruences for central binomial coefficients

2008-05-05

arxiv.org/abs/0805.0563v4

Adv. in Appl. Math. 45(2010), no.1, 125-148.

Mathematics

Number Theory

Scientific paper

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p. For example, we show that if $p\not=2,5$ then $$\sum_{k=1}^{p-1}(-1)^k\frac{\binom{2k}k}k=-5\frac{F_{p-(\frac p5)}}p (mod p),$$ where F_n is the n-th Fibonacci number and (-) is the Jacobi symbol. We also prove that if p>3 then $$\sum_{k=1}^{p-1}\frac{\binom{2k}k}k={8/9} p^2B_{p-3} (mod p^3),$$ where B_n denotes the n-th Bernoulli number.

Affiliated with

Also associated with

No associations

Rating

New congruences for central binomial coefficients does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New congruences for central binomial coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New congruences for central binomial coefficients will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209098