benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Arnim and Brentano have a little vase with 1500 candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move …

Problem

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

problem

Arnim and Brentano have a little vase with 15001500 candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat 77 candies or take 66 candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?
Plain-text mathematical notation (without MathML)
Arnim and Brentano have a little vase with 1500 candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat 7 candies or take 6 candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?
Original LaTeX notation
Arnim and Brentano have a little vase with $1500$ candies on the table and a huge sack with spare candies under the table. They play a game taking turns, Arnim begins . At each move a player can either eat $7$ candies or take $6$ candies from under the table and add them to the vase. A player cannot go under the table in two consecutive moves. A player is declared the winner if he leaves the vase empty. In any other case, if a player cannot make a move in his turn, the game is declared a tie. Is there a winning strategy for one of the players?

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
a9b8546a-021f-5c92-b3a3-f8f830482282
task_key
test--a9b8546a-021f-5c92-b3a3-f8f830482282
task_revision_id
1
config / split
/ test

Official source

initial import