arXiv (All)
open access
Distinct exponents in the prime factorization
Following Erdős (1982) and Sanna (2019), we study the arithmetic function $h(n)$, which is defined to be the number of distinct exponents in the prime factorization of a positive integer $n$. Among other things, we show that $$ \sum_{n\leq x}h(ϕ(n)) \asymp x\left(\frac{\log\log x}{\log\log\log x}\ri
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
- On a Turán's theorem for arithmetic progressions#1037467
- Weighted equidistribution of factorial prime valuations in fixed power bands#1141782
- A sharp inverse theorem for the quadratic large sieve#1013622
- An explicit power-saving bound for Sárközy's Theorem on shifted primes, assuming GRH#1083903
Record · ID 1051834
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