olymmath

JBMO 2020 Problem 3

Alice and Bob play the following game: Alice picks a set A={1,2,…,n}A=\{1,2, \ldots, n\} for some natural number n⩾2n \geqslant 2. Then starting with Bob, they alternatively choose one number from the set AA, according to the following conditions: initially Bob chooses any number he wants, afterwards the number chosen at each step should be distinct from all the already chosen numbers, and should differ by 1 from an already chosen number. The game ends when all numbers from the set AA are chosen. Alice wins if the sum of all of the numbers that she has chosen is composite. Otherwise Bob wins. Decide which player has a winning strategy.

Dataset text NuminaMath olympiads. Quoted with source.

Also JBMO-SL 2020 C3.

Show the answer

1

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 jbmo/2020/p3 · Tag N4AM292WS9 · Edit this page on GitHub · Keys: j next, k previous