IMC 2015, Day 1, Problem 5
Let , let be points in the -dimensional Euclidean space, not lying on the same hyperplane, and let be a point strictly inside the convex hull of . Prove that holds for at least pairs with .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Géza Kós, Eötvös University, Budapest)
Solution. Let . The condition is equivalent with . Since is an interior point of the simplex, there are some weights with .
Let us build a graph on the vertices . Let the vertices and be connected by an edge if . We show that this graph is connected. Since every connected graph on vertices has at least edges, this will prove the problem statement.
Suppose the contrary that the graph is not connected; then the vertices can be split in two disjoint nonempty sets, say and such that . Since there is no edge between the two vertex sets, we have for all and .
Consider
Remark 1. The number in the statement is sharp; if and for then holds only when or .
Remark 2. The origin of the problem is here: http://math.stackexchange.com/questions/476640/n-simplex-in-an-intersection-of-n-balls/789390
Transcribed from the official solutions, page 4. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.