Erdős Problem #859 — Densities of integers with prescribed divisor sums
For each positive integer , let be the set of positive integers for which is a sum of distinct positive divisors of ; that is, there is a subset of the divisors of such that
Write for the natural density of , meaning
whose existence is part of the known results. The question is whether there are constants , independent of , such that, as the positive integer ,
Background
This is a question about the frequency of integers whose divisor sets contain a subset with prescribed sum: the density is taken over , while the target itself tends to infinity. The problem is attributed to Erdős’s 1970 paper “Some extremal problems in combinatorial number theory.” A later account clarifies that Erdős proved the density exists and gave a polylogarithmic upper bound, but stated a matching lower bound without proof; thus the summary on the problem page overstates what is established there about the lower bound. Erdős (1970) The density of sums of distinct divisors Erdős Problem #859
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.