olymmath

OIM 1988 Problem 6

    Consider all sets of nn distinct positive integers, no three of which form an arithmetic progression. Prove that among all such sets there is one which has the largest sum of the reciprocals of its elements.

    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 ibero/1988/p6 · Tag CKEWSRA9ES · Edit this page on GitHub · Keys: j next, k previous