olymmath

JBMO-SL 2006 Problem 13

    Let AA be a subset of the set {1,2,…,2006}\{1, 2,\ldots,2006\} , consisting of 10041004 elements. Prove that there exist 33 distinct numbers a,b,c∈Aa,b,c\in A such that gcd(a,b)gcd(a,b) : a) divides cc b) doesn't divide cc

    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 jbmo-sl/2006/p13 · Tag P8BN790REN · Edit this page on GitHub · Keys: j next, k previous