Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 468

../


Statement. 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?

Status. Open.

Source. erdosproblems.com/468, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #468, https://www.erdosproblems.com/468.

Formalization. None recorded.

Progress

Not yet compiled.

Known Results

Not yet compiled.