Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs

We prove logarithmic lower bounds on digital sums of powers, multiples of powers, factorials, and the least common multiple of $\{1,\dots ,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.