Let p1,p2,p3,… be the prime numbers listed in increasing order, and let x0 be a real number between 0 and 1. For positive integer k, define
x_k = \begin{cases} 0 & \mbox{if} \; x_{k-1} = 0, \$$.1in] {\displaystyle \left\{ \frac{p_k}{x_{k-1}} \right\}} & \mbox{if} \; x_{k-1} \neq 0, \end{cases}
where {x} denotes the fractional part of x. (The fractional part of x is given by x−⌊x⌋ where ⌊x⌋ is the greatest integer less than or equal to x.) Find, with proof, all x0 satisfying 0<x0<1 for which the sequence x0,x1,x2,… eventually becomes 0. floor functioncalculusintegrationAMCUSA(J)MOUSAMOmodular arithmetic