Skip to content

Erdős problem 507

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).

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:65f2e7425f50166ef2500688760813114cfa56286e1cce4db16579f919f63e17
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page