olymmath

KöMaL 2018 B4976

    Let A={−4;−3;−2;−1;0;1;2;3;4}A=\{-4;-3;-2;-1;0;1;2;3;4\}. First and Second take turns in selecting a number (not selected before) out of the elements of set AA. The player first collecting three numbers that add up to zero wins the game. Is there a player who has a winning strategy?

    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/2018/b4976 · Tag E0HQF0R30R · Edit this page on GitHub · Keys: j next, k previous