olymmath

ELMO SL 2011 N2

    Let p≥5p\ge5 be a prime. Show that ∑k=0(p−1)/2(pk)3k≡2p−1(modp2).\sum_{k=0}^{(p-1)/2}\binom{p}{k}3^k\equiv 2^p - 1\pmod{p^2}.

    Victor Wang.

    Dataset text AI-MO AoPS. 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

    Similar problems

    These problems have the most words in common with this statement.

    Locator elmo-sl/2011/n2 · Tag DQGHB6ME50 · Edit this page on GitHub · Keys: j next, k previous