Difference between revisions of "1997 USAMO Problems/Problem 1"

(See Also)
(Blanked the page)
Line 1: Line 1:
== Problem ==
 
Let <math>p_1,p_2,p_3,...</math> be the prime numbers listed in increasing order, and let <math>x_0</math> be a real number between <math>0</math> and <math>1</math>. For positive integer <math>k</math>, define
 
  
<math> x_{k}={0 if xk1=0{pkxk1} if xk10 </math>
 
 
where <math>\{x\}</math> denotes the fractional part of <math>x</math>. (The fractional part of <math>x</math> is given by <math>x-\lfloor{x}\rfloor</math> where <math>\lfloor{x}\rfloor</math> is the greatest integer less than or equal to <math>x</math>.) Find, with proof, all <math>x_0</math> satisfying <math>0<x_0<1</math> for which the sequence <math>x_0,x_1,x_2,...</math> eventually becomes <math>0</math>.
 
 
== Solution ==
 

Revision as of 19:05, 1 July 2011