Skip to content

Erdős problem 521

Let (ϵk)k0(\epsilon_k)_{k\geq 0} be independently uniformly chosen at random from {1,1}\{-1,1\}. If RnR_n counts the number of real roots of fn(z)=0knϵkzkf_n(z)=\sum_{0\leq k\leq n}\epsilon_k z^k then is it true that, almost surely, limnRnlogn=2π?\lim_{n\to \infty}\frac{R_n}{\log n}=\frac{2}{\pi}?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:01f0738d862bdcd404afaf7c1a50c3b7681eec5e920639dacc5feec159555650
Metadata
sha256:e8cc6d40ee1e45edcf8ea16f6be7794c07bfa726086f97a0f797a3817e62dbcb
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:a4a2669da491ef0254e73e55f2ad943d4c0036f037bc93437c675abaafb49b49
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page