benchmarks.wiki / Public workspace

Omni-MATH / Alice and Bob play the following game: starting with the number 2 written on a blackboard, each player in turn changes the current number n to a number n+p, where p is a prime divi…

Problem

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

problem

Alice and Bob play the following game: starting with the number 22 written on a blackboard, each player in turn changes the current number nn to a number n+pn + p, where pp is a prime divisor of nn. Alice goes first and the players alternate in turn. The game is lost by the one who is forced to write a number greater than $\underbrace{22...2}_{2020}$. Assuming perfect play, who will win the game.
Plain-text mathematical notation (without MathML)
Alice and Bob play the following game: starting with the number 2 written on a blackboard, each player in turn changes the current number n to a number n+p, where p is a prime divisor of n. Alice goes first and the players alternate in turn. The game is lost by the one who is forced to write a number greater than $\underbrace{22...2}_{2020}$. Assuming perfect play, who will win the game.
Original LaTeX notation
Alice and Bob play the following game: starting with the number $2$ written on a blackboard, each player in turn changes the current number $n$ to a number $n + p$, where $p$ is a prime divisor of $n$. Alice goes first and the players alternate in turn. The game is lost by the one who is forced to write a number greater than $\underbrace{22...2}_{2020}$. Assuming perfect play, who will win the game.

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