Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2511.15850 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918277478875136 |
|---|---|
| author | Radcliffe, David G. |
| author_facet | Radcliffe, David G. |
| contents | We prove logarithmic lower bounds on digital sums of powers, multiples of powers, factorials, and the least common multiple of $\{1,\ldots, 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_15850 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs Radcliffe, David G. Number Theory 11A63 We prove logarithmic lower bounds on digital sums of powers, multiples of powers, factorials, and the least common multiple of $\{1,\ldots, 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. |
| title | Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs |
| topic | Number Theory 11A63 |
| url | https://arxiv.org/abs/2511.15850 |