2019 USAJMO Problems/Problem 6

Revision as of 19:14, 19 April 2019 by Kevinmathz (talk | contribs)

Two rational numbers $frac{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 $\frac{x+y}{2}$ or their harmonic mean $\frac{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.

Proposed by Yannick Yao

Invalid username
Login to AoPS