Difference between revisions of "2000 IMO Problems/Problem 3"

(See Also)
(Solution)
Line 7: Line 7:
 
==Solution==
 
==Solution==
 
{{solution}}
 
{{solution}}
 +
{{stub}}
  
 
==See Also==
 
==See Also==
  
 
{{IMO box|year=2000|num-b=2|num-a=4}}
 
{{IMO box|year=2000|num-b=2|num-a=4}}

Revision as of 15:01, 30 December 2024

Problem

Let $n \ge 2$ be a positive integer and $\lambda$ a positive real number. Initially there are $n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $A$ and $B$ to the left of $B$, and letting the flea from $A$ jump over the flea from $B$ to the point $C$ so that $\frac{BC}{AB}=\lambda$.

Determine all values of $\lambda$ such that, for any point $M$ on the line and for any initial position of the $n$ fleas, there exists a sequence of moves that will take them all to the position right of $M$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it. This article is a stub. Help us out by expanding it.

See Also

2000 IMO (Problems) • Resources
Preceded by
Problem 2
1 2 3 4 5 6 Followed by
Problem 4
All IMO Problems and Solutions