Problem

Source: ELMO Shortlist 2011, N2

Tags: modular arithmetic, number theory proposed, number theory



Let $p\ge5$ be a prime. Show that \[\sum_{k=0}^{(p-1)/2}\binom{p}{k}3^k\equiv 2^p - 1\pmod{p^2}.\] Victor Wang.