Problem

Source: Romanian IMO TST - day 1, problem 3

Tags: geometry, 3D geometry, circumcircle, inequalities, tetrahedron, sphere, geometry proposed



Prove that if the distance from a point inside a convex polyhedra with $n$ faces to the vertices of the polyhedra is at most 1, then the sum of the distances from this point to the faces of the polyhedra is smaller than $n-2$. Calin Popescu