benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / A and B play a game, given an integer N, A writes down 1 first, then every player sees the last number written and if it is n then in his turn he writes n+1 or 2n, but his number c…

Problem

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

problem

AA and BB play a game, given an integer NN, AA writes down 11 first, then every player sees the last number written and if it is nn then in his turn he writes n+1n+1 or 2n2n, but his number cannot be bigger than NN. The player who writes NN wins. For which values of NN does BB win? [i]
Plain-text mathematical notation (without MathML)
A and B play a game, given an integer N, A writes down 1 first, then every player sees the last number written and if it is n then in his turn he writes n+1 or 2n, but his number cannot be bigger than N. The player who writes N wins. For which values of N does B win?

[i]
Original LaTeX notation
$A$ and $B$ play a game, given an integer $N$, $A$ writes down $1$ first, then every player sees the last number written and if it is $n$ then in his turn he writes $n+1$ or $2n$, but his number cannot be bigger than $N$. The player who writes $N$ wins. For which values of $N$ does $B$ win?

[i]

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

task_id
29210657-9669-5596-b484-683cd1b1f71b
task_key
test--29210657-9669-5596-b484-683cd1b1f71b
task_revision_id
1
config / split
/ test

Official source

initial import