ILL 1976 Problem 2
Let be a set of points and a set of segments. It is known that: No four points of are coplanar. Any segment from has its endpoints at . There is a point, say , in that is the endpoint of a maximal number of segments from and that is not a vertex of a tetrahedron having all its edges in . Prove that
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.