Erdős Problem #468 — Initial sums of ordered divisors
For each positive integer , let be the number of its divisors greater than , and list those divisors in increasing order as . Define the set of nonempty initial partial sums by
In particular, . The first question asks for the cardinality, as a function of , of the sums appearing for the first time at index :
Erdős Problems #468 OEIS A387502
For a positive integer that belongs to at least one , define . The further question is whether , and, if this does not hold for all sufficiently large represented , whether it holds for almost all positive integers. The original wording does not specify how to treat unrepresented 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 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 . OEIS A387502
The new-sum count is naturally a sequence indexed by : it records how many elements of have not occurred in any earlier set. For example, , and the cited tabulation identifies as its new elements. This makes the first question a count of first appearances, rather than simply the size of . OEIS A387502
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.