arXiv (All)
open access
The density of sums of distinct divisors
For a positive integer $t$, let $d_t$ denote the natural density of the set of $n$ for which $t$ is a sum of distinct divisors of $n$. Erdős proved that $d_t$ exists, gave an unspecified polylogarithmic upper bound, asserted without proof a matching lower bound, and asked whether $d_t \sim c_3/(\log
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 New Classification of Positive Integers Via New Divisor Functions#974229
- On a Turán's theorem for arithmetic progressions#1037467
- Selberg sieve weights and sign changes of Kloosterman sums. I. Uniform asymptotics for shifted weights#1050431
- Range of Clique Counts in Graphs#1036129
- Concentration inequalities for strong laws and laws of the iterated logarithm#986798
Record · ID 1061086
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