benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / On a blackboard there are n geq 2, n in mathbb{Z}^{plus{}} numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all num…

Problem

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

problem

On a blackboard there are $ n \geq 2, n \in \mathbb{Z}^{\plus{}}$ numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers n n for which it is possible to yield n n identical number after a finite number of steps.
Plain-text mathematical notation (without MathML)
On a blackboard there are $ n \geq 2, n \in \mathbb{Z}^{\plus{}}$ numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers n for which it is possible to yield n identical number after a finite number of steps.
Original LaTeX notation
On a blackboard there are $ n \geq 2, n \in \mathbb{Z}^{\plus{}}$ numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers $ n$ for which it is possible to yield $ n$ identical number after a finite number of steps.

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
dd0c93e4-6598-5f16-b212-82ab5745975b
task_key
test--dd0c93e4-6598-5f16-b212-82ab5745975b
task_revision_id
1
config / split
/ test

Official source

initial import