Harmonic dyadic shifts and short sums of factorial divisors
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
Let be the maximum, over , of the least number of distinct positive divisors of a practical integer whose sum is . We prove . The main ingredient is a finite entropy lemma. A law modulo with entropy at least in every -bit lower prefix becomes supported on more than half the group after independent copies, each multiplied by an independently chosen power of two. The shift distribution is harmonic. A divisor-digit construction supplies at linear factorial index. Positive quotient recursion, binary carrying, and a factorial radix then give the stated bound.
Provenance statement
References
No bibliography entries.
Version history
- 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