olymmath

HMIC 2018 Problem 2

    Consider a finite set of points T∈RnT \in \mathbb{R}^{n} contained in the nn-dimensional unit ball centered at the origin, and let XX be the convex hull of TT. Prove that for all positive integers kk and all points x∈Xx \in X, there exist points t1,t2,…,tk∈Tt_{1}, t_{2}, \ldots, t_{k} \in T, not necessarily distinct, such that their centroid

    t1+t2+⋯+tkk\frac{t_{1}+t_{2}+\cdots+t_{k}}{k}

    has Euclidean distance at most 1k\frac{1}{\sqrt{k}} from xx. (The nn-dimensional unit ball centered at the origin is the set of points in Rn\mathbb{R}^{n} with Euclidean distance at most 1 from the origin. The convex hull of a set of points T∈RnT \in \mathbb{R}^{n} is the smallest set of points XX containing TT such that each line segment between two points in XX lies completely inside XX.)

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hmic/2018/p2 · Tag X2D7BW83JR · Edit this page on GitHub · Keys: j next, k previous