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)=2n−2+1f(n) = 2^{n-2} + 1.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:33394e1971870bea858b5c892fcc2815d2e2c11c0a15081b02fbd150d0748382
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb