Problem:
Let be a triangle with , , and . Compute the minimum value of over all points in the plane.
, 2022
Solutions — 2
Solution 1
Solution:
The minimizing point is when . To prove this, consider placing at any other point . Then, by moving from to , the expression changes by
by the triangle inequality. Since this is negative, must be the optimal point. The answer is .
Solution 2
Solution:
We use a physical interpretation. Imagine an object acted upon by forces of magnitudes , , and towards , , and , respectively. The potential energy of the object at point in this system is . This potential energy is minimized when the object experiences net force; in this case, it occurs when it is exactly at point (because the pull towards overpowers the other two forces combined).
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.