arXiv (All)
open access
The degrees of irreducible factors of binomials and multiplicativity of the n-Hartley condition
We prove that the degrees of irreducible factors of a binomial $t^n-α$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the $mn$-Hartley condition if and only if it has the $m$-Hartley and $n$-Hartley conditions.
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 proof of the Eisenbud-Huneke-Ulrich conjecture#1051878
- Infinitely Many Binomial Coefficients of Deficiency One#1051535
- The arithmetic rank of the residual intersections of a complete intersection ideal#1082983
- Ramsey Theory for Product Trees#1076554
- Families of Eliahou semigroups linked to Farey intervals#1118532
Record · ID 1036628
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