Difference between revisions of "2000 IMO Problems/Problem 3"
(→Problem) |
|||
Line 5: | Line 5: | ||
Determine all values of <math>\lambda</math> such that, for any point <math>M</math> on the line and for any initial position of the <math>n</math> fleas, there exists a sequence of moves that will take them all to the position right of <math>M</math>. | Determine all values of <math>\lambda</math> such that, for any point <math>M</math> on the line and for any initial position of the <math>n</math> fleas, there exists a sequence of moves that will take them all to the position right of <math>M</math>. | ||
− | |||
==Solution== | ==Solution== |
Revision as of 23:12, 18 November 2023
Problem
Let be a positive integer and
a positive real number.
Initially there arefleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points
and
to the left of
, and letting the flea from
jump over the flea from
to the point
so that
.
Determine all values of such that, for any point
on the line and for any initial position of the
fleas, there exists a sequence of moves that will take them all to the position right of
.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
2000 IMO (Problems) • Resources | ||
Preceded by Problem 2 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 3 |
All IMO Problems and Solutions |