olymmath

NL-NWO 2019 Problem 5

    Thomas and Nils are playing a game. They have a number of cards, numbered 1,2,31, 2, 3 , et cetera. At the start, all cards are lying face up on the table. They take alternate turns. The person whose turn it is, chooses a card that is still lying on the table and decides to either keep the card himself or to give it to the other player. When all cards are gone, each of them calculates the sum of the numbers on his own cards. If the difference between these two outcomes is divisible by 33 , then Thomas wins. If not, then Nils wins. (a) Suppose they are playing with 20182018 cards (numbered from 11 to 20182018 ) and that Thomas starts. Prove that Nils can play in such a way that he will win the game with certainty. (b) Suppose they are playing with 20202020 cards (numbered from 11 to 20202020 ) and that Nils starts. Which of the two players can play in such a way that he wins with certainty?

    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 nl-nwo/2019/p5 · Tag NTWZX4ZEXW · Edit this page on GitHub · Keys: j next, k previous