Skip to content

Erdős Problem 521 #769

Description

@mo271

What is the conjecture

https://www.erdosproblems.com/521

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

Status: open

Choose either option

  • I plan on working on this conjecture
  • This issue is up for grabs: I would like to see this conjecture added by somebody else

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Labels

ams-60: Probability theoryProbability theory and stochastic processeserdos-problemsErdős Problemsnew conjectureIssues about open conjectures/unsolved problems problem. Category `research open`

Type

No type

Projects

No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions