SCHWEITZER 1992 Problem 9
Let K be a bounded, d-dimensional convex polyhedron that is not simplex and P is a point on K. Show that if vertices are not all on the same face of K, then one of them can be omitted so that the convex hull of the remaining vertices of K still contains 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.