IT-CESENATICO 2007 Problem 1
It is given a regular hexagon in the plane. Let P be a point of the plane. Define s(P) as the sum of the distances from P to each side of the hexagon, and v(P) as the sum of the distances from P to each vertex. a) Find the locus of points P that minimize s(P) b) Find the locus of points P that minimize v(P)
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.