← All problems

Erdős Problem #468 — Initial sums of ordered divisors

46 years old · traced to

For each positive integer nn, let k(n)k(n) be the number of its divisors greater than 11, and list those divisors in increasing order as 1<d1<⋯<dk(n)1<d_1<\cdots<d_{k(n)}. Define the set of nonempty initial partial sums by

Dn={∑i=1rdi:1≤r≤k(n)}.D_n=\left\{\sum_{i=1}^{r}d_i:1\le r\le k(n)\right\}.

In particular, D1=∅D_1=\varnothing. The first question asks for the cardinality, as a function of nn, of the sums appearing for the first time at index nn:

∣Dn∖⋃1≤m<nDm∣.\left|D_n\setminus\bigcup_{1\le m<n}D_m\right|.

Erdős Problems #468 OEIS A387502

For a positive integer NN that belongs to at least one DnD_n, define f(N)=min⁡{n≥1:N∈Dn}f(N)=\min\{n\ge1:N\in D_n\}. The further question is whether f(N)=o(N)f(N)=o(N), and, if this does not hold for all sufficiently large represented NN, whether it holds for almost all positive integers. The original wording does not specify how to treat unrepresented NN or give a formal meaning to “almost all.” Erdős Problems #468

Background

The problem is attributed to Erdős and Graham’s 1980 problem book. A related question, concerning partial sums of divisors with 11 included, is noted as having been posed by Erdős and discussed in Guy’s 1981 book. That related formulation changes the partial sums and should not be conflated with the present one, which starts with the divisors greater than 11. OEIS A387502

The new-sum count is naturally a sequence indexed by nn: it records how many elements of DnD_n have not occurred in any earlier set. For example, D12={2,5,9,15,27}D_{12}=\{2,5,9,15,27\}, and the cited tabulation identifies 9,15,279,15,27 as its new elements. This makes the first question a count of first appearances, rather than simply the size of DnD_n. OEIS A387502

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.