MathDB
Euclidean space and convex hull

Source: Kömal A.793

April 10, 2021
combinatoricsgeometrycombinatorial geometry

Problem Statement

In the 4343 dimension Euclidean space the convex hull of finite set SS contains polyhedron PP. We know that PP has 4747 vertices. Prove that it is possible to choose at most 20212021 points in SS such that the convex hull of these points also contain PP, and this is sharp.
Back to ProblemsView on AoPS