benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Two rational numbers (m)/(n) and (n)/(m) are written on a blackboard, where m and n are relatively prime positive integers. At any point, Evan may pick two of the numbers x and y w…

Problem

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

problem

Two rational numbers mn\tfrac{m}{n} and nm\tfrac{n}{m} are written on a blackboard, where mm and nn are relatively prime positive integers. At any point, Evan may pick two of the numbers xx and yy written on the board and write either their arithmetic mean x+y2\tfrac{x+y}{2} or their harmonic mean 2xyx+y\tfrac{2xy}{x+y} on the board as well. Find all pairs (m,n)(m,n) such that Evan can write 1 on the board in finitely many steps.
Plain-text mathematical notation (without MathML)
Two rational numbers (m)/(n) and (n)/(m) are written on a blackboard, where m and n are relatively prime positive integers. At any point, Evan may pick two of the numbers x and y written on the board and write either their arithmetic mean (x+y)/(2) or their harmonic mean (2xy)/(x+y) on the board as well. Find all pairs (m,n) such that Evan can write 1 on the board in finitely many steps.
Original LaTeX notation
Two rational numbers \(\tfrac{m}{n}\) and \(\tfrac{n}{m}\) are written on a blackboard, where \(m\) and \(n\) are relatively prime positive integers. At any point, Evan may pick two of the numbers \(x\) and \(y\) written on the board and write either their arithmetic mean \(\tfrac{x+y}{2}\) or their harmonic mean \(\tfrac{2xy}{x+y}\) on the board as well. Find all pairs \((m,n)\) such that Evan can write 1 on the board in finitely many 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
3ee4533f-ac0e-58c3-92c5-5ad3e4bbbc1d
task_key
test--3ee4533f-ac0e-58c3-92c5-5ad3e4bbbc1d
task_revision_id
1
config / split
/ test

Official source

initial import