olymmath

VN-TST 1996 Problem 1

  • Day 1

In the plane we are given 3⋅n3 \cdot n points ( n>n> 1) no three collinear, and the distance between any two of them is ≤1\leq 1 . Prove that we can construct nn pairwise disjoint triangles such that: The vertex set of these triangles are exactly the given 3n points and the sum of the area of these triangles <1/2< 1/2 .

Dataset text AI-MO AoPS. 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 vn-tst/1996/p1 · Tag J3NVPXPVD6 · Edit this page on GitHub · Keys: j next, k previous