Answers are grounded in this paper and cite their sources.
We resolve Erdős Problem~521 by proving that the normalized real-root count Nₙ/log n of Rademacher polynomials almost surely has no limit. More generally, consider the Kac polynomials \[ P_n(x)=∑ⱼ₌₀ⁿξ_jx^j \] with i.i.d.\ real coefficients of mean zero, variance one, and a finite absolute exponential moment. Let Nₙ denote the number of distinct real roots of Pₙ. We prove that, almost surely, \[ n→∞N_n/log n=1π, n→∞N_n/log n=1π+C_*, \] and the set of subsequential limits is exactly \[ [1π,\;1π+C_*]. \] Here C_*>1/π is a constant uniquely determined by an equation. The lower-limit identity remains valid under the weaker assumption that E|ξ₀|2+δ<∞ for some $δ>0$.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: