Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1997 USAMO Problems"

(→‎Problem 1)
(→‎Problem 1)
Line 5: Line 5:
  
 
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>.
 
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>.
 +
 +
[http://www.artofproblemsolving.com/Wiki/index.php/Problem_1 Solution]

Revision as of 21:02, 30 June 2011

Problem 1

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<x_0<1$ for which the sequence $x_0,x_1,x_2,...$ eventually becomes $0$.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1997_USAMO_Problems&oldid=40117"