arXiv (All)
open access
Cyclotomic Prime Extractors
We develop explicit prime-recovery formulas from the values $Φ_n(2)$ of cyclotomic polynomials. Binary divisibility patterns detect repeated prime factors and identify the least prime divisor of a squarefree index, while small corrections to $\log_2Φ_n(2)$ allow successive recovery of the distinct 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
- FACTORIZATION OF CYCLOTOMIC POLYNOMIAL VALUES AT MERSENNE PRIME POLYNOMIALS#652794
- Sharp Diameter Bounds for Nonnegative Cyclotomic Multiples#984555
- Galois groups of Apéry-like series modulo primes#1066318
- Reduction of integer tiles via CRT and base-p digits#1083507
- A power-commutator presentation for the group of truncated polynomials under substitution#1156741
Record · ID 1012662
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