olymmath

KöMaL 2010 C1029

    In a gift shop, there are 160 Easter greating cards stacked on the counter. A customer separates the stack of cards in two (not necessarily equal) parts, each containing at least two cards. He buys one card of one of the two stacks. The next customer follows the same procedure: he divides one of the stacks in two (according to the above conditions), buys one card from one part. Then comes the next customer, and so on. Is it possible in this way to obtain stacks of cards on the counter that consist of four cards each?

    Official text KöMaL. 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 hu-komal/2010/c1029 · Tag C2X2BTS2DA · Edit this page on GitHub · Keys: j next, k previous