olymmath

ZA-SAMO 1998 Problem 5

    Prove that gcd⁡((n1),(n2),…,(nn−1))\gcd{\left({n \choose 1},{n \choose 2},\dots,{n \choose {n - 1}}\right)} is a prime if nn is a power of a prime, and 1 otherwise.

    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 za-samo/1998/p5 · Tag F6JF9JV4K2 · Edit this page on GitHub · Keys: j next, k previous