MODBasic Putnam

back to index


Let $p$ be an odd prime. Show that $$\sum_{j=0}^p\binom{p}{j}\binom{p+j}{j}\equiv 2^p +1 \pmod{p^2}$$


Let $\{ a_1, a_2, \cdots, a_{2n+1}\}$ be a set of integers such that after removing any element, the remaining ones can always be equally divided into two groups with equal sum. Show that all these $a_i$, $(1 \le i \le 2n+1)$ are equal.

back to index