Erdős Problem #1086
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The number of triangles with vertices in `P` and area `a`: the `3`-element subsets of `P` whose vertices `p, q, r` satisfy `|triangle_area p q r| = a`.
\(g(n)\): the maximum, over all sets of \(n\) points in the plane and all areas \(a > 0\), of the number of triangles of area \(a\) with vertices in the set. Only positive areas count, since every collinear triple has area \(0\). The set of values is nonempty and bounded by \(\binom{n}{3}\), so `sSup` is a true maximum.
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.