olymmath

BALTIC-WAY 2020 Problem 15

  • Answer

On a plane, Bob chooses 3 points A0,B0,C0A_{0}, B_{0}, C_{0} (not necessarily distinct) such that A0B0+B0C0+C0A0=1A_{0} B_{0}+B_{0} C_{0}+C_{0} A_{0}=1. Then he chooses points A1,B1,C1A_{1}, B_{1}, C_{1} (not necessarily distinct) in such a way that A1B1=A0B0A_{1} B_{1}=A_{0} B_{0} and B1C1=B0C0B_{1} C_{1}=B_{0} C_{0}. Next he chooses points A2,B2,C2A_{2}, B_{2}, C_{2} as a permutation of points A1,B1,C1A_{1}, B_{1}, C_{1}. Finally, Bob chooses points A3,B3,C3A_{3}, B_{3}, C_{3} (not necessarily distinct) in such a way that A3B3=A2B2A_{3} B_{3}=A_{2} B_{2} and B3C3=B2C2B_{3} C_{3}=B_{2} C_{2}. What are the smallest and the greatest possible values of A3B3+B3C3+C3A3A_{3} B_{3}+B_{3} C_{3}+C_{3} A_{3} 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.

Add a solution

Locator baltic-way/2020/p15 · Tag VZ8CDGTKNH · Edit this page on GitHub · Keys: j next, k previous