olymmath

ILL 1982 Problem 1

    (a) Prove that 1n+1⋅(2nn)\frac{1}{n+1} \cdot \binom{2n}{n} is an integer for n≥0.n \geq 0. (b) Given a positive integer kk , determine the smallest integer CkC_k with the property that Ckn+k+1⋅(2nn)\frac{C_k}{n+k+1} \cdot \binom{2n}{n} is an integer for all n≥k.n \geq k.

    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 ill/1982/p1 · Tag XF5N7A91H9 · Edit this page on GitHub · Keys: j next, k previous