RU-ALLRUSSIAN 1978 Problem 4
If P, Q are points in space the point [PQ] is the point on the line PQ on the opposite side of Q to P and the same distance from Q. is a set of points in space. Given we derive by adjoining all the points [PQ] with P and Q in .
(1) contains just two points A and B, a distance 1 apart, what is the smallest n for which contains a point whose distance from A is at least 1000?
(2) consists of three points, each pair a distance 1 apart, find the area of the smallest convex polygon containing .
(3) consists of four points, forming a regular tetrahedron with volume 1. Let be the smallest convex polyhedron containing . How many faces does have? What is the volume of ?
Dataset text NuminaMath olympiads. 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.