olymmath

DK-GEORGMOHR 2002 Problem 5

    Homer Grog has written the numbers 1,3,4,5,7,9,11,13,15,171, 3, 4, 5, 7, 9, 11, 13, 15,17 , one number on each note. He arranges the bills in a circle and tries to get the largest sum SS of the numbers of three consecutive bills to be the least possible. What is the smallest value SS can assume?

    Dataset text AI-MO AoPS. Quoted with source.

    Official text: Georg Mohr Contest 2002 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/2002/p5 · Tag 251EBZQDR5 · Edit this page on GitHub · Keys: j next, k previous