2000 character limit reached
Congruences involving $\binom{4k}{2k}$ and $\binom{3k}k$ (1108.4840v1)
Published 24 Aug 2011 in math.NT and math.CO
Abstract: Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}{[p/4]}\binom{4k}{2k}(-1)k$, $\sum_{k=0}{[p/3]}\binom{3k}k, \sum_{k=0}{[p/3]}\binom{3k}k(-1)k$ and $\sum_{k=0}{[p/3]}\binom{3k}k(-3)k$ modulo $p$, where $[x]$ is the greatest integer not exceeding $x$.