olymmath

Putnam 1991 B4

  • Session B

Suppose pp is an odd prime. Prove that ∑j=0p(pj)(p+jj)≡2p+1(modp2).\sum_{j=0}^p \binom{p}{j} \binom{p+j}{j} \equiv 2^p + 1\pmod{p^2}.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator putnam/1991/b4 · Tag QTK5JCWXH1 · Edit this page on GitHub · Keys: j next, k previous