MathDB
N=? points, every triangle contains one point

Source: Kürschák 1998, problem 3

July 15, 2014
combinatorial geometrycombinatorics unsolvedcombinatorics

Problem Statement

For which integers N≥3N\ge 3 can we find NN points on the plane such that no three are collinear, and for any triangle formed by three vertices of the points’ convex hull, there is exactly one point within that triangle?
Back to ProblemsView on AoPS