olymmath

KöMaL 2024 K819

    Kati has written the number +1+1 ten times on the blackboard. In each move she can change the sign of five numbers on the board. She can repeat this move an arbitrary number of times. Is it possible that after a series of moves she will end up with nine +1+1's and a single −1-1 on the board? If the answer is yes, find the minimum number of moves needed.

    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/2024/k819 · Tag H7CM03D98M · Edit this page on GitHub · Keys: j next, k previous