olymmath

KURSCHAK 1952 Problem 2

    Show that if we choose any n+2n + 2 distinct numbers from the set {1,2,3,...,3n}\{1, 2, 3, . . . , 3n\} there will be two whose difference is greater than nn and smaller than 2n2n .

    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 kurschak/1952/p2 · Tag 3670YN7KMA · Edit this page on GitHub · Keys: j next, k previous