BALTIC-WAY 2020 Problem 15
- Answer
On a plane, Bob chooses 3 points (not necessarily distinct) such that . Then he chooses points (not necessarily distinct) in such a way that and . Next he chooses points as a permutation of points . Finally, Bob chooses points (not necessarily distinct) in such a way that and . What are the smallest and the greatest possible values of Bob can obtain?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
\frac{1}{3} \text{ and } 3
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.