Erdős Problem #838
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 convex subsets determined by a finite set \(P\) of points of \(\mathbb{R}^2\): the subsets of \(P\) that are in convex position (`ConvexIndep`). The empty set, the singletons and the pairs count as convex. This shifts the count by exactly \(1+n+\binom{n}{2}\) for \(|P|=n\) compared with counting only subsets of size at least \(3\), and does not affect the asymptotics below.
\(f(n)\): the least number of convex subsets determined by \(n\) points of \(\mathbb{R}^2\) with no three on a line. Such point sets exist for every \(n\) (for example \(n\) points on a parabola), so the `sInf` is a true minimum.
Attempts
submit one →Read our working report →
proved a rigorous upper-constant improvement to \(1/(2\ln2)=0.7213475\ldots\) in base-2 normalization and exhaustively computed \(f(3),\ldots,f(9)=1,4,11,23,44,77,123\), but the limit and its value re
PARTIAL