olymmath

DK-GEORGMOHR 2006 Problem 4

    Of the numbers 1,2,3,..,20061, 2,3,..,2006 , ten different ones must be selected. Show that you can pick ten different numbers with a sum greater than 1003910039 in more ways than you can select ten different numbers with a sum less than 1003010030 .

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Georg Mohr Contest 2006 official paper, page 1.

    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 dk-georgmohr/2006/p4 · Tag B8WHSDSES4 · Edit this page on GitHub · Keys: j next, k previous