olymmath

SE-SKOLORNAS 2007 Problem 2

    A number of flowers are distributed between nn persons so that the first of them, Andreas, gets one flower, the other gets two flowers, the third gets three flowers, etc., to nn -th person who gets nn flowers. Andreas then walks around shaking hands with each other of the others, in any order. In order to do so, he receives a flower from everyone which he hangs on to and which has more flowers than himself at the moment they shake hands. Which is the smallest number of flowers Andreas can have after shaking hands with everyone?

    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 se-skolornas/2007/p2 · Tag RW1TN4XBE6 · Edit this page on GitHub · Keys: j next, k previous