MathDB
ASU 255 All Soviet Union MO 1978 sequence of points in plane and in space

Source:

July 11, 2019
combinatorial geometryconvex polygonconvex polyhedronconvexpoints in space

Problem Statement

Given a finite set K0K_0 of points (in the plane or space). The sequence of sets K1,K2,...,Kn,...K_1, K_2, ... , K_n, ... is constructed according to the rule: we take all the points of KiK_i, add all the symmetric points with respect to all its points, and, thus obtain Ki+1K_{i+1}.
a) Let K0K_0 consist of two points AA and BB with the distance 11 unit between them. For what nn the set KnK_n contains the point that is 10001000 units far from AA?
b) Let K0K_0 consist of three points that are the vertices of the equilateral triangle with the unit square. Find the area of minimal convex polygon containing Kn.K0K_n. K_0 below is the set of the unit volume tetrahedron vertices.
c) How many faces contain the minimal convex polyhedron containing K1K_1?
d) What is the volume of the above mentioned polyhedron?
e) What is the volume of the minimal convex polyhedron containing KnK_n?