olymmath

ELMO SL 2013 C8

    There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that AA gives BB a coin and BB gives AA a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer nn , there exists a person who will give away coins during the nn th minute. What is the smallest number of coins that could be at the party?

    Proposed by Ray Li

    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 elmo-sl/2013/c8 · Tag D5GGASK3JM · Edit this page on GitHub · Keys: j next, k previous