Hostname: page-component-7b7567c8c-p67k6 Total loading time: 0 Render date: 2026-11-19T17:38:40.756Z Has data issue: false hasContentIssue false

A lower bound for a remainder term associated with the sum of digits function

Published online by Cambridge University Press:  20 January 2009

D. M. E. Foster
Affiliation:
Mathematical InstituteUniversity Of St AndrewsNorth HaughSt Andrews, KYI6 9SS
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For a fixed integer q≧2, every positive integer k = Σr≧0ar(q, k)qr where each ar(q, k)∈{0,1,2,…, q−1}. The sum of digits function α(q, k) Σr≧0ar(q, k) behaves rather erratically but on averaging has a uniform behaviour. In particular if , where n>1, then it is well known that A(q, n)∼½((q − 1)/log q)n logn as n → ∞. For odd values of q, a lower bound is now obtained for the difference 2S(q, n) = A(q, n)−½(q − 1))[log n/log q, where [log n/log q] denotes the greatest integer ≦log n /log q. This complements an upper bound already found.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1991