scholarly journals Estimates for a remainder term associated with the sum of digits function

1987 ◽  
Vol 29 (1) ◽  
pp. 109-129 ◽  
Author(s):  
D. M. E. Foster
Keyword(s):  
Positive Integer ◽  
Remainder Term ◽  
Fixed Integer ◽  
Sum Of Digits ◽  
Sum Of Digits Function ◽  
Image Position ◽  
Average Behaviour

If q(≥2) is a fixed integer it is well known that every positive integer k may be expressed uniquely in the formWe introduce the ‘sum of digits’ functionBoth the above sums are of course finite. Although the behaviour of α(q, k) is somewhat erratic, its average behaviour is more regular and has been widely studied.

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

1991 ◽  
Vol 34 (1) ◽  
pp. 121-142 ◽  
Author(s):  
D. M. E. Foster
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Upper Bound ◽  
Remainder Term ◽  
Fixed Integer ◽  
Sum Of Digits ◽  
Sum Of Digits Function ◽  
The Difference

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.

scholarly journals Averaging the sum of digits function to an even base

1992 ◽  
Vol 35 (3) ◽  
pp. 449-455 ◽  
Author(s):  
D. M. E. Foster
Keyword(s):  
Lower Bound ◽  
Positive Integer ◽  
Fixed Integer ◽  
Sum Of Digits ◽  
Sum Of Digits Function ◽  
The Difference

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

On the decimal representation of integers

1952 ◽  
Vol 48 (4) ◽  
pp. 555-565 ◽  
Author(s):  
M. P. Drazin ◽  
J. Stanley Griffith
Keyword(s):  
Positive Integer ◽  
Fixed Integer ◽  
Usual Convention ◽  
Representation Of Integers ◽  
Image Position

Let r be any fixed integer with, r≥ 2; then, given any positive integer n, we can find* integers αk(r, n) (k = 0, 1, 2, …) such thatwhere, subject to the conditionsthe integers αk(r, n) are uniquely determined, and, in fact, clearlyαk(r, n) = [n/rk] − r[n/rk+1](square brackets denoting integral parts, according to the usual convention).

scholarly journals On the representation of a number as a sum of squares

1978 ◽  
Vol 19 (2) ◽  
pp. 173-197 ◽  
Author(s):  
Karl-Bernhard Gundlach
Keyword(s):  
Positive Integer ◽  
Modular Forms ◽  
Remainder Term ◽  
Modular Group ◽  
Congruence Subgroup ◽  
Hilbert Modular Group ◽  
Totally Positive ◽  
Hilbert Modular ◽  
Image Position ◽  
Totally Real

It is well known that the number Ak(m) of representations of a positive integer m as the sum of k squares of integers can be expressed in the formwhere Pk(m) is a divisor function, and Rk(m) is a remainder term of smaller order. (1) is a consequence of the fact thatis a modular form for a certain congruence subgroup of the modular group, andwithwhere Ek(z) is an Eisenstein series and is a cusp form (as was first pointed out by Mordell [9]). The result (1) remains true if m is taken to be a totally positive integer from a totally real number field K and Ak(m) is the number of representations of m as the sum of k squares of integers from K (at least for 2|k, k>2, and for those cases with 2+k which have been investigated). then are replaced by modular forms for a subgroup of the Hilbert modular group with Fourier expansions of the form (10) (see section 2).

Some arithmetical properties of m-ary partitions

1970 ◽  
Vol 68 (2) ◽  
pp. 447-453 ◽  
Author(s):  
Öystein Rödseth
Keyword(s):  
Partition Function ◽  
Positive Integer ◽  
Asymptotic Formula ◽  
Fixed Integer ◽  
De Bruijn ◽  
Image Position

We denote by tm(n) the number of partitions of the positive integer n into non-decreasing parts which are positive or zero powers of a fixed integer m > 1 and we call tm(n) ‘the m-ary partition function’. Mahler(1) obtained an asymptotic formula for tm(n), the first term of which isMahler's result was later improved by de Bruijn (2).

scholarly journals The Divisibility of Divisor Functions

1961 ◽  
Vol 5 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Positive Integer ◽  
Divisor Functions ◽  
Image Position ◽  
Positive Integers

For any positive integers n and v letwhere d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

α-expansions, linear recurrences, and the sum-of-digits function

1991 ◽  
Vol 70 (1) ◽  
pp. 311-324 ◽  
Author(s):  
Peter J. Grabner ◽  
Robert F. Tichy
Keyword(s):  
Linear Recurrences ◽  
Sum Of Digits ◽  
Sum Of Digits Function

Uniform Distribution of the Weighted Sum-of-Digits Functions

2021 ◽  
Vol 16 (1) ◽  
pp. 93-126
Author(s):  
Ladislav Mišík ◽  
Štefan Porubský ◽  
Oto Strauch
Keyword(s):  
Uniform Distribution ◽  
Weighted Sum ◽  
Two Dimensional ◽  
Sum Of Digits ◽  
Higher Dimensional ◽  
Distribution Modulo One ◽  
Sum Of Digits Function ◽  
Uniform Distribution Modulo One ◽  
Van Der Corput Sequence ◽  
Distribution Modulo

Abstract The higher-dimensional generalization of the weighted q-adic sum-of-digits functions sq,γ (n), n =0, 1, 2,..., covers several important cases of sequences investigated in the theory of uniformly distributed sequences, e.g., d-dimensional van der Corput-Halton or d-dimensional Kronecker sequences. We prove a necessary and sufficient condition for the higher-dimensional weighted q-adic sum-of-digits functions to be uniformly distributed modulo one in terms of a trigonometric product. As applications of our condition we prove some upper estimates of the extreme discrepancies of such sequences, and that the existence of distribution function g(x)= x implies the uniform distribution modulo one of the weighted q-adic sum-of-digits function sq,γ (n), n = 0, 1, 2,... We also prove the uniform distribution modulo one of related sequences h 1 sq, γ (n)+h 2 sq,γ (n +1), where h 1 and h 2 are integers such that h 1 + h 2 ≠ 0 and that the akin two-dimensional sequence sq,γ (n), sq,γ (n +1) cannot be uniformly distributed modulo one if q ≥ 3. The properties of the two-dimensional sequence sq,γ (n),s q,γ (n +1), n =0, 1, 2,..., will be instrumental in the proofs of the final section, where we show how the growth properties of the sequence of weights influence the distribution of values of the weighted sum-of-digits function which in turn imply a new property of the van der Corput sequence.

The Distribution Of Totatives

1955 ◽  
Vol 7 ◽  
pp. 347-357 ◽  
Author(s):  
D. H. Lehmer
Keyword(s):  
Positive Integer ◽  
Prime Factors ◽  
Image Position

This paper is concerned with the numbers which are relatively prime to a given positive integerwhere the p's are the distinct prime factors of n. Since these numbers recur periodically with period n, it suffices to study the ϕ(n) numbers ≤n and relatively prime to n.

Sign in / Sign up

Export Citation Format

Share Document