benchmarks.wiki / Public workspace

Omni-MATH / There are n stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones …

Problem

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

problem

There are nn{} stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones in the heap. The player who takes the last stone wins. For which nn{} does the first player have a strategy so that he wins no matter how the other player plays?
Plain-text mathematical notation (without MathML)
There are n stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones in the heap. The player who takes the last stone wins. For which n does the first player have a strategy so that he wins no matter how the other player plays?
Original LaTeX notation
There are $n{}$ stones in a heap. Two players play the game by alternatively taking either 1 stone from the heap or a prime number of stones which divides the current number of stones in the heap. The player who takes the last stone wins. For which $n{}$ does the first player have a strategy so that he wins no matter how the other player plays?

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