Skip to content

Erdős problem 107

Let f(n)f(n) be minimal such that any f(n)f(n) points in R2ℝ^2, no three on a line, contain nn points which form the vertices of a convex nn-gon. Prove that f(n)=2n2+1f(n) = 2^{n-2} + 1.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:2b5a9ee4e7c9dabbdab9a56f26c99c00256dc70c0f9f9329f8b7d9671f059ac0
Metadata
sha256:fb9c42d1b1d23c8edd8424ea36561ef64f84dcfb15900bbe2a8f11a688aee13d
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:33394e1971870bea858b5c892fcc2815d2e2c11c0a15081b02fbd150d0748382
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page