Erdős Problem #468 — For any nn let DnD_n be the set of sums of the shape d1,d1+d2,d1+d2+d3,…d_1,d_1+d_2,d_1+d_2+d_3,\ldots where 1<d1<d2<⋯1<d_1<d_2<\cdots are the divisors of nn. What is the size of Dn\∪m<nDmD_n\backslash \cup_{m<n}D_m?

About 46 years old · traced to

For any nn let DnD_n be the set of sums of the shape d1,d1+d2,d1+d2+d3,…d_1,d_1+d_2,d_1+d_2+d_3,\ldots where 1<d1<d2<⋯1<d_1<d_2<\cdots are the divisors of nn. What is the size of Dn\∪m<nDmD_n\backslash \cup_{m<n}D_m? If f(N)f(N) is the minimal nn such that N∈DnN\in D_n then is it true that f(N)=o(N)f(N)=o(N)? Perhaps just for almost all NN?

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.