olymmath

BG-MO 1991 Problem 3

    Prove that for every prime number p≥5p\ge5 ,

    (a) p3p^3 divides (2pp)−2\binom{2p}p-2 ; (b) p3p^3 divides (kpp)−k\binom{kp}p-k for every natural number kk .

    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 bg-mo/1991/p3 · Tag QGGC72FRM5 · Edit this page on GitHub · Keys: j next, k previous