Papers
Topics
Authors
Recent
2000 character limit reached

Congruences involving $\binom{4k}{2k}$ and $\binom{3k}k$

Published 24 Aug 2011 in math.NT and math.CO | (1108.4840v1)

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$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.