benchmarks.wiki / Public workspace
Omni-MATH / Two positive integers p,q∈Z^(+) are given. There is a blackboard with n positive integers written on it. A operation is to choose two same number a,a written on the blackboard, and…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Two positive integers are given. There is a blackboard with positive integers written on it. A operation is to choose two same number written on the blackboard, and replace them with . Determine the smallest so that such operation can go on infinitely.
Plain-text mathematical notation (without MathML)
Two positive integers p,q∈Z^(+) are given. There is a blackboard with n positive integers written on it. A operation is to choose two same number a,a written on the blackboard, and replace them with a+p,a+q. Determine the smallest n so that such operation can go on infinitely.
Original LaTeX notation
Two positive integers $p,q \in \mathbf{Z}^{+}$ are given. There is a blackboard with $n$ positive integers written on it. A operation is to choose two same number $a,a$ written on the blackboard, and replace them with $a+p,a+q$. Determine the smallest $n$ so that such operation can go on infinitely.Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import