benchmarks.wiki / Public workspace

Omni-MATH / Two players play a game, starting with a pile of N tokens. On each player's turn, they must remove 2^(n) tokens from the pile for some nonnegative integer n. If a player cannot mak…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Two players play a game, starting with a pile of NN tokens. On each player's turn, they must remove 2n2^{n} tokens from the pile for some nonnegative integer nn. If a player cannot make a move, they lose. For how many NN between 1 and 2019 (inclusive) does the first player have a winning strategy?
Plain-text mathematical notation (without MathML)
Two players play a game, starting with a pile of N tokens. On each player's turn, they must remove 2^(n) tokens from the pile for some nonnegative integer n. If a player cannot make a move, they lose. For how many N between 1 and 2019 (inclusive) does the first player have a winning strategy?
Original LaTeX notation
Two players play a game, starting with a pile of \(N\) tokens. On each player's turn, they must remove \(2^{n}\) tokens from the pile for some nonnegative integer \(n\). If a player cannot make a move, they lose. For how many \(N\) between 1 and 2019 (inclusive) does the first player have a winning strategy?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import