Regenerated from the community database (Apache-2.0), dated, and linked back to it
from every problem. erdosproblems.com no longer shows statuses (Bloom's reasons); this is the database's record, not our verdict.
908 of 1221 statements are formalized in Lean (Formal Conjectures) · 107 carry an Erdős prize · 3 are independent of ZFC and 9 more can't be proved, or can't be disproved, from ZFC alone · “open” counts the computable and Lean-checked ones too.
Find problems
Open — solved in Lean · solution in Lean · 5 problems✕ clear
OPEN LEANSKIPPEDanalysis · polynomials · probability
Let \(f(z)=\sum_{0\leq k\leq n} \epsilon_k z^k\) be a random polynomial, where \(\epsilon_k\in \{-1,1\}\) independently uniformly at random for \(0\leq k\leq n\). Is it true that, if \(R_n\) is the number of roots of \(f(z)\) in…
Let \(m_1\leq\cdots\leq m_k\) and \(n\) be sufficiently large. If \(T\) is a tree on \(n\) vertices and \(G\) is the complete multipartite graph with vertex class sizes \(m_1,\ldots,m_k\) then prove that \[R(T,G)\leq…
Does there exist a constant \(C>1\) such that, for every \(n\geq 2\), there exists a sequence \(z_i\in \mathbb{C}\) with \(z_1=1\) and \(\lvert z_i\rvert \geq 1\) for all \(1\leq i\leq n\) with…
Source: teorth/erdosproblems (its own interactive table), Apache-2.0, pulled 2026-10-22. A status here is what that database records, not an independent verification by us, except where a problem page says so.