olymmath

VN-TST 2004 Problem 1

    Let us consider a set S={a1<a2<…<a2004}S = \{ a_1 < a_2 < \ldots < a_{2004}\} , satisfying the following properties: f(ai)<2003f(a_i) < 2003 and f(ai)=f(aj)∀i,jf(a_i) = f(a_j) \forall i, j from {1,2,…,2004}\{1, 2,\ldots , 2004\} , where f(ai)f(a_i) denotes number of elements which are relatively prime with aia_i . Find the least positive integer kk for which in every kk -subset of SS , having the above mentioned properties there are two distinct elements with greatest common divisor greater than 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 vn-tst/2004/p1 · Tag GAFT1XA7WA · Edit this page on GitHub · Keys: j next, k previous