Papers
Topics
Authors
Recent
Search
2000 character limit reached

On binomial coefficients modulo squares of primes

Published 6 Dec 2017 in math.CO and math.NT | (1712.02095v2)

Abstract: We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p{2},$$ $$\sum\limits_{n=0}{rp-1}\dbinom{2n}{n} \equiv\eta_{p}\sum\limits_{n=0}{r-1}\dbinom {2n}{n}\mod p{2}$$ and $$\sum\limits_{n=0}{rp-1}\sum\limits_{m=0}{sp-1}\dbinom{n+m}{m}{2} \equiv\eta_{p} \sum\limits_{m=0}{r-1}\sum\limits_{n=0}{s-1}\dbinom{n+m}{m}2\mod p2,$$ where $p$ is an odd prime, $r$ and $s$ are nonnegative integers, and $\eta_{p}= \begin{cases} 0, &\text{if }p\equiv0\mod 3;\ 1, & \text{if }p\equiv1\mod 3;\ -1, &\text{if }p\equiv2\mod 3 \end{cases}.$$

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.