Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Determine the infimum and supremum of\[\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert\]as $f\in \mathbb{R}[x]$ ranges over all non-constant monic polynomials, all of whose roots are real and in the interval $[-1,1]$.
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
A problem of Erdős, Herzog, and Piranian [EHP58], who proved that the measure of the set in question is always at most $2\sqrt{2}$ under the assumption that all the roots are in $\{-1,1\}$, and conjecture this is the best possible upper bound.

They also note that the infimum of the set in question is less than $2$, as witnessed by $f(x)=(x+1)(x-1)^m$ for $m\geq 3$. They further note that if the roots are restricted to $[-2,2]$ then the infimum is zero, as witnessed by a small perturbation of the Chebyshev polynomials.

They further conjectured that, if the roots are restricted to $[-2,2]$, then\[\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert\geq n^{-c}\]for an absolute constant $c>0$. This was proved by Pommerenke [Po61], who in fact showed that this set must contain an interval of width $\gg n^{-4}$.

The current best known bounds (see the discussion in the comments) are\[1.519\approx 2^{4/3}-1\leq \inf \leq 1.835\cdots\]and\[\sup = 2\sqrt{2}\approx 2.828.\]

View the LaTeX source

This page was last edited 11 January 2026.

External data from the database - you can help update this
Formalised statement? Yes
Likes this problem TerenceTao, zach_hunter
Interested in collaborating TerenceTao
Currently working on this problem None
This problem looks difficult None
This problem looks tractable BorisAlexeev, TerenceTao

Additional thanks to: Koizumi, Yongxi Lin, natso26, and Terence Tao

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #1038, https://www.erdosproblems.com/1038, accessed 2026-01-16