Erdős problem 507 · problems.science

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

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#507
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI building on literature
Erdős AI contributions wiki · 3 Nov, 2025
Machine
AlphaEvolve
Open the source record

Reported activity

Search problems.science