Status
On this page
Status
Topics
Status
On this page
Status
Topics
If is a monic polynomial of degree then is the length of the curve maximised when ?
Source: erdosproblems.com/114
No claim settles this problem.
Falsifiable. The site's label is FALSIFIABLE (page last edited 2026-01-23): open, but refutable by a finite counterexample. Six partial claims are recorded, none settling the question. Degree is proved twice, by Wang (Wang 1998, accepted, refereed) and by Eremenko and Hayman (Eremenko–Hayman 1999, accepted, refereed). All sufficiently large degrees are proved by Tao in an arXiv preprint (Tao 2025, pending). Degree has two pending claims: Dahlke's Zenodo manuscript, announced on the site's discussion thread on 2026-05-21 (Dahlke 2026), and Chatelet's write-up and Lean development, posted in August 2026 and registered on the site's proof-claims tab on 2026-09-07 (Chatelet 2026), which asserts the cubic case under a domain reduction cited from Eremenko–Hayman and Tao; no review or acceptance of either is recorded. Degrees to were claimed by Mendoza's computer search, withdrawn by its author on 2026-10-01 (Mendoza 2026).