olymmath

INMO 1998 Problem 6

    It is desired to choose nn integers from the collection of 2n2n integers, namely, 0,0,1,1,2,2,…,n−1,n−10,0,1,1,2,2,\ldots,n-1,n-1 such that the average of these nn chosen integers is itself an integer and as minimum as possible. Show that this can be done for each positive integer nn and find this minimum value for each nn .

    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 in-inmo/1998/p6 · Tag 53JAS83EXT · Edit this page on GitHub · Keys: j next, k previous