arXiv (All)
open access
Few small primes suffice to cover unit groups
Klurman, Shparlinski and Teräväinen showed that there is a set of at most $(\log Q)^{1+\varepsilon}$ primes of polylogarithmic size whose subset products cover the unit group $(\mathbb{Z}/q\mathbb{Z})^\times$ for almost all moduli $q\le Q$. We show that $(1/\log2+o(1))\log Q$ primes suffice, which i
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
- Asymptotic counting of integers with prime factors $p_{r^a s^b}$#1014028
- A lattice family with kissing numbers $τ(\mathcal{L}_n) \ge e^{2 \sqrt{n}}$#1156454
- Distinct exponents in the prime factorization#1051834
- On a Turán's theorem for arithmetic progressions#1037467
- Reducibility of $rx^m+p^e f(x)$ for Large Primes $p$#1077522
Record · ID 1200329
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