Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs
Abstract
We prove logarithmic lower bounds on digital sums of powers, multiples of powers, factorials, and the least common multiple of \1,…, n\, using only elementary number theory. We conclude with an expository proof of Stewart's theorem on digital sums of powers, which uses Baker's theorem on linear forms in logarithms.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.