Skip to published state

finding record / erdos

recorded

vf_8b0088e93e7f2825

Erdős Problem #114 [status

Canonical assertion

falsifiable; formalized: no]. If p(z)C[z]p(z)\in\mathbb{C}[z] is a monic polynomial of degree nn then is the length of the curve {zC:p(z)=1}\{ z\in \mathbb{C} : \lvert p(z)\rvert=1\} maximised when p(z)=zn1p(z)=z^n-1? Current best: {/UL} Erd\H{o}s, Herzog, and Piranian [EHP58] also ask whether the length is at least 2π2\pi if {z:f(z)<1}\{ z: \lvert f(z)\rvert<1\} is connected (which znz^n shows is the best possible). Prize: $250. Tags: analysis, polynomials.

Notation is rendered from the stored source. The pinned checkout remains the exact record.

  1. database_record
  2. theoretical
  3. 0 spans
  4. recorded
Provenance summary
erdos_deep:114
database_record
Jun 16, 2026, 12:00 AM
not recorded
0
Exact record identityFinding ID, frontier identity, and pinned Git source
vf_8b0088e93e7f2825
vfr_0a25edabc16db143
ce8ba7d934c848408e0d91caca39e938698e3fc7
03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Commit
ce8ba7d934c848408e0d91caca39e938698e3fc7
Tree
03f7371b496485f761f91961027fd48198dc7e93
Committed
2026-07-20T19:20:20-04:00
Repository
Open source
Event log
sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
Snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
Proposals
sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
Actor registry
sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
Artifacts
sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da