benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Ingrid and Erik are playing a game. For a given odd prime p, the numbers 1,2,3,...,p−1 are written on a blackboard. The players take turns making moves with Ingrid starting. A move…

Problem

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

problem

Ingrid and Erik are playing a game. For a given odd prime pp, the numbers 1,2,3,...,p−11, 2, 3, ..., p-1 are written on a blackboard. The players take turns making moves with Ingrid starting. A move consists of one of the players crossing out a number on the board that has not yet been crossed out. If the product of all currently crossed out numbers is $1 \pmod p$ after the move, the player whose move it was receives one point, otherwise, zero points are awarded. The game ends after all numbers have been crossed out. The player who has received the most points by the end of the game wins. If both players have the same score, the game ends in a draw. For each pp, determine which player (if any) has a winning strategy
Plain-text mathematical notation (without MathML)
Ingrid and Erik are playing a game. For a given odd prime p, the numbers 1,2,3,...,p−1 are written on a blackboard. The players take turns making moves with Ingrid starting. A move consists of one of the players crossing out a number on the board that has not yet been crossed out. If the product of all currently crossed out numbers is $1 \pmod p$ after the move, the player whose move it was receives one point, otherwise, zero points are awarded. The game ends after all numbers have been crossed out.

The player who has received the most points by the end of the game wins. If both players have the same score, the game ends in a draw. For each p, determine which player (if any) has a winning strategy
Original LaTeX notation
Ingrid and Erik are playing a game. For a given odd prime $p$, the numbers $1, 2, 3, ..., p-1$ are written on a blackboard. The players take turns making moves with Ingrid starting. A move consists of one of the players crossing out a number on the board that has not yet been crossed out. If the product of all currently crossed out numbers is $1 \pmod p$ after the move, the player whose move it was receives one point, otherwise, zero points are awarded. The game ends after all numbers have been crossed out.

The player who has received the most points by the end of the game wins. If both players have the same score, the game ends in a draw. For each $p$, determine which player (if any) has 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

task_id
bdbfa33f-ada9-53b7-8bba-f05f0f8744c9
task_key
test--bdbfa33f-ada9-53b7-8bba-f05f0f8744c9
task_revision_id
1
config / split
/ test

Official source

initial import