← All problems

Erdős Problem #859 — Densities of integers with prescribed divisor sums

56 years old · traced to

For each positive integer tt, let AtA_t be the set of positive integers nn for which tt is a sum of distinct positive divisors of nn; that is, there is a subset SS of the divisors of nn such that

t=∑d∈Sd.t=\sum_{d\in S}d.

Write dtd_t for the natural density of AtA_t, meaning

dt=lim⁡x→∞1x#{n∈At:n≤x},d_t=\lim_{x\to\infty}\frac{1}{x}\#\{n\in A_t:n\le x\},

whose existence is part of the known results. The question is whether there are constants c1,c2>0c_1,c_2>0, independent of tt, such that, as the positive integer t→∞t\to\infty,

dt∼c1(log⁡t)c2.d_t\sim\frac{c_1}{(\log t)^{c_2}}.

Erdős Problem #859

Background

This is a question about the frequency of integers whose divisor sets contain a subset with prescribed sum: the density is taken over nn, while the target tt 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

Progress summary

Never refreshed

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.