# 1997 USAMO Problems/Problem 1

## Problem

Let $p_1,p_2,p_3,...$ be the prime numbers listed in increasing order, and let $x_0$ be a real number between $0$ and $1$. For positive integer $k$, define

$x_{k}=\begin{cases}0&\text{ if }x_{k-1}=0\\ \left\{\frac{p_{k}}{x_{k-1}}\right\}&\text{ if }x_{k-1}\ne0\end{cases}$

where $\{x\}$ denotes the fractional part of $x$. (The fractional part of $x$ is given by $x-\lfloor{x}\rfloor$ where $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$.) Find, with proof, all $x_0$ satisfying $0 for which the sequence $x_0,x_1,x_2,...$ eventually becomes $0$.

## Solution

All rational numbers between 0 and 1 will eventually become 0 under this iterative process. To begin, note that by definition, all rational numbers can be written as a quotient of coprime integers. Let $x_0 = \frac{m}{n}$, where $m,n$ are coprime positive integers. Since $0, $0. Now $$x_1 = \left\{\frac{p_1}{\frac{m}{n}}\right\}=\left\{frac{np_1}{m}\right\}.$$ From this, we can see that applying the iterative process will decrease the value of the denominator, since $m. Moreover, the numerator is always smaller than the denominator, thanks to the fractional part operator. So we have a strictly decreasing denominator that bounds the numerator. Thus, the numerator will eventually become 0.

On the other hand, irrational $x_0$ will never become 0, because $x_k$ will always be irrational.