Difference between revisions of "1997 USAMO Problems/Problem 1"
m (moved Problem 1 to 1997 USAMO Problems/Problem 1) |
m (restore) |
||
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}= | ||
+ | |||
+ | 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 == | ||
+ | |||
+ | == See Also == | ||
+ | {{USAMO newbox|year=1997|before=First Question|num-a=2}} |
Revision as of 14:11, 5 July 2011
Problem
Let be the prime numbers listed in increasing order, and let
be a real number between
and
. For positive integer
, define
where denotes the fractional part of
. (The fractional part of
is given by
where
is the greatest integer less than or equal to
.) Find, with proof, all
satisfying
for which the sequence
eventually becomes
.
Solution
See Also
1997 USAMO (Problems • Resources) | ||
Preceded by First Question |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |