arXiv (All)
open access
On Lehmer's Problem
Let $m\geq 2$ be an integer, and let $d\geq 2$ be an even integer. We study monic, reciprocal, non-cyclotomic polynomials $$ P(x)=x^d+a_{d-1}x^{d-1}+\cdots+a_1x+1\in\mathbb{Z}[x]. $$ For a fixed residue class $r\in\{0,1,\ldots,m-1\}$, we prove that there exists an effectively computable constant $c_
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
- On the factorization of $x^{d_{r}} + x^{d_{r-1}} + \cdots + x^{d_{2}} + x^{d_{1}} + p$ and a conjecture of C. Nicol#1201581
- Euclidean SVP is NP-hard for Cyclic Lattices#1122720
- Low Lying Zeros of Dedekind Zeta Functions#1327600
- Improved average and almost-all bounds for $G(n)$#1234544
- Transcendence of Montgomery Reduction Factor in the Ring of Integers Modulo Infinitely Large Primes#1084740
Record · ID 1456454
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