Harmonic dyadic shifts and short sums of factorial divisors

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 20, 2026 / CC BY 4.0

Abstract

Let h(N)h(N) be the maximum, over 1≤R≤N1\le R\le N, of the least number of distinct positive divisors of a practical integer NN whose sum is RR. We prove h(n!)=O((log⁡n)9)h(n!)=O((\log n)^9). The main ingredient is a finite entropy lemma. A law modulo 2k2^k with entropy at least gLlog⁡2gL\log 2 in every LL-bit lower prefix becomes supported on more than half the group after O(g−2(log⁡k)2)O(g^{-2}(\log k)^2) independent copies, each multiplied by an independently chosen power of two. The shift distribution is harmonic. A divisor-digit construction supplies g≍1/log⁡kg\asymp1/\log k at linear factorial index. Positive quotient recursion, binary carrying, and a factorial radix then give the stated bound.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000055. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos18-harmonic-shifts/tree/4b2ed2d07693602fa3b87fb5aa72fe16933f98af

Provenance statement

OpenAI Codex assisted with mathematical development, exposition and automated checking. The accompanying Lean development verifies the ninth-power bound and all three challenge statements. This TeX edition preserves the mathematics of the pinned Markdown manuscript.

References

No bibliography entries.

Version history

  1. v1 · 10 pagesSubmitted by Liam KruerTeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000055. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos18-harmonic-shifts/tree/4b2ed2d07693602fa3b87fb5aa72fe16933f98afCurrentNov 20, 2026