arXiv · 2609.10902
Sums of distinct divisors of factorials
Abstract
For practical $N$ let $h(N)$ be the least $k$ such that every integer $1\le m\le N$ is a sum of at most $k$ distinct divisors of $N$. We prove $h(n!)\le(2\log2+o(1))\,n/\log n$. This improves the bounds of order $n/(\log n)^{1/2-\varepsilon}$ established in Tenenbaum-Yokota's Lemma 4 and Yokota's 1995 knapsack note. We combine their decreasing greedy construction with the sharper factorial divisor-gap estimate of Berend-Harmse. Counting the steps separately below and above $\sqrt{n!}$, with the upper range handled through reciprocal divisors, retains the leading coefficient in the gap exponent and yields the explicit constant $2\log2$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Scott D. Hughes. 2026-09-09. Sums of distinct divisors of factorials. https://arxiv.org/abs/2609.10902
Cite the original work for its findings. Save a collection to share your selection of sources.