olymmath

KöMaL 2008 A445

    Prove that for every prime number pp and integer rr there exists a nonnegative integer nnfor which (2nn)≡r(modp)\binom{2n}{n}\equiv r\pmod{p} .

    Official text KöMaL. 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 hu-komal/2008/a445 · Tag RP8W5J7NGD · Edit this page on GitHub · Keys: j next, k previous