Skip to content

Erdős problem 507

Start work

Let α(n)\alpha(n) be such that every set of nn points in the unit disk contains three points which determine a triangle of area at most α(n)\alpha(n). Estimate α(n)\alpha(n).

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:ab7c9aa4d64ec34e116a98f099f6028300094a44f7e584cdd937605faa68a71b
Metadata
sha256:9f9c8ce63ec20b0b7568bb87282cd2083c17d684ce21931e91f0cf6c60799b55
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:65f2e7425f50166ef2500688760813114cfa56286e1cce4db16579f919f63e17
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON