arXiv (All)
open access
The Odlyzko-Poonen Conjecture on Irreducibility of Random Polynomials
The Odlyzko-Poonen conjecture states that a monic polynomial of constant coefficient $1$ and with remaining coefficients chosen independently and uniformly from $\{0,1 \}$ is irreducible over the rational numbers with probability tending to one as the degree tends to infinity. We prove the Odlyzko-P
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Short Proof of a Conjecture Regarding Quadratic Representations of Practical Numbers#1123195
- Rudin-Shapiro function along irreducible polynomials over finite fields#1063733
- Elementary and analytic theory of algebraic numbers#490203
- Infinite divisibility of powers of positive stable random variables#1115758
- From $\log 2$ to $π/2$: the sharp asymptotic inradius of polynomial lemniscates#974037
Record · ID 1062696
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive