problem
Tetra inequalities
Can you prove that in every tetrahedron there is a vertex where the three edges meeting at that vertex have lengths which could be the sides of a triangle?
Can you prove that in every tetrahedron there is a vertex where the three edges meeting at that vertex have lengths which could be the sides of a triangle?
There are many different methods to solve this geometrical problem - how many can you find?
Are these statistical statements sometimes, always or never true? Or it is impossible to say?