2025/11/19 by David Radcliffe, Radcliffe, David G.
Computer Science · Mathematics · #11A63 #Analytic Number Theory Research #Cryptography and Residue Arithmetic #Digital Image Processing Techniques #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2511.15850
openalex publication_date 2025/11/19 · openalex created_date 2025/11/23 · openalex updated_date 2026/07/28
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.