olymmath

CN-LEAGUE 2009 Problem 3

    Let k,lk,l be two given integers. Prove that there exist infinite many integers m≥km\ge k such that gcd⁡((mk),l)=1\gcd\left(\binom{m}{k},l\right)=1 .

    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 cn-league/2009/p3 · Tag M6NHWSG76F · Edit this page on GitHub · Keys: j next, k previous