Congruences involving (4k2k)\binom{4k}{2k} and (3kk)\binom{3k}k

preprint2011arXivOpen access

Abstract

Let pp be a prime greater than 3. In the paper we mainly determine ∑k=0[p/4](4k2k)(−1)k\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k, ∑k=0[p/3](3kk),∑k=0[p/3](3kk)(−1)k\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k and ∑k=0[p/3](3kk)(−3)k\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k modulo pp, where [x][x] is the greatest integer not exceeding xx.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.