This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

1978 Chisinau City MO, 163
Tags: polyline , geometry , combinatorial geometry , geometric inequality , polints
On the plane $n$ points are selected that do not belong to one straight line. Prove that the shortest closed path passing through all these points is a non-self-intersecting polygon.