Abstract

Let be a positive integer and be the sum of the digits in basis q of the positive integer n. We prove that the quotient has a normal order one, where and are respectively, the number of distinct prime factors and the number of prime factors p of a positive integer n counted with multiplicity such that mod Moreover, we discuss sums of the form where f is a multiplicative function.

1. Introduction

Let be a fixed integer. Every positive integer n has a unique q-adic expansion of the form

with For we admit to set The sum of digits function in basis q is defined by

The function S is one of the most natural examples of q-additive functions (i.e. with ) and is the set of non negative integers. Such functions were introduced by Gelfond ⁷ and further studied by Coquet ¹, Kátai ⁹ and others.

For every and such that we define as the number of distinct prime factors p of n such that mod b and the number of distinct prime factors of n counted with multiplicity such that mod b. Therefore,

Both functions have been studied in ^{12, 13}, it was proved that their normal order is A crucial part in the proof is the following estimation

(1.1)

where

The aim of this paper is to provide asymptotic formulas for sums involving and We consider firstly the sum

Then, by using elementary methods, we discuss sums of the form

where f is one of the classical arithmetic functions , and where is the Möbius function, while and are respectively, the Euler function and the sum of divisors function. This extends the results known through the work of De Koninck ⁴, De Koninck and Sitaramachandrarao ⁵ to primes verifying a digital constraint. Finally, we give some related results about the distribution of and uniform distribution modulo 1 of sequences involving and

Throughout this paper, always denotes a prime number. For any real x, we set The notation refers to the greatest common divisor of a and b. is the number of distinct prime factors of n while is the number of prime factors counted with multiplicity of the integer n. We recall that the notation is equivalent to the statement that for positive functions U and V and the implied constants in the symbols “O”, “” are absolute. We also use the symbol “o” with its usual meaning, the statement is equivalent to

2. The Sum of Quotients

Since and have both the normal order (see ⁸), it is obvious that has normal order one which is shown by De Koninck in ⁴. A crucial part in his proof is an elementary estimation of In this part, we consider an analogue problem, since and have both the normal order (see ¹²). So, we put

Then, the average value of is given in the following theorem.

Theorem 2.1.

(2.1)

Proof. Our first task is to estimate Indeed, we have

Proposition 2.2 of ¹² implies that

where C is an absolute constant. So,

Or,

Then,

So, we obtain

(2.2)

Now, we use (2.2) to estimate the left hand side of (2.1) as follows

(2.3)

Since then by partial summation, we can write

(2.4)

where the last equality is derived from (2.2). Assembling (2.3) and (2.4), we obtain

which completes the proof of the theorem.

3. On the Sum

In this section, we discuss sums of the form where is either or We note that the case where f is a multiplicative function, was discussed in [ ⁶, Chapter 9].

Theorem 3.1. Let q, b be integers satisfying Then for any integer there exist constants such that

Proof.

(3.1)

By pursuing the same procedure, we get

Now, we write

(3.2)

say.

For the estimation of we use Dirichlet’s hyperbola method and we obtain

(3.3)

Now, it is well-known (See ¹⁵) that there exists a constant A > 0 such that

(3.4)

Hence,

(3.5)

where the last bound is derived from (1.1). For the estimations of and we write

(3.6)

for any c > 0, by using the prime number theorem and [ ¹¹, Théorème 3] in the case Here Also

(3.7)

However, by partial summation, we derive that

(3.8)

Now,

(3.9)

From (3.7), (3.8) and (3.9), we deduce

Assembling (3.5), (3.6) and the last equality, one can show that

(3.10)

with

For by using (3.4), we get

(3.11)

Finally, formulas (3.2), (3.10) and (3.11) give the desired estimation.

In order to provide a corresponding result for φ and σ, we need the lemma below, which can be proved by the same method as in the proof provided in ¹³.

Lemma 3.2. Let and Then, for any integer we have

Theorem 3.3. Let q, b be integers verifying Then for any integer there exist constants K₁, K₂, F_i, G_i, such that

Proof. For the Euler function, if we proceed as in (3.1), we obtain

(3.12)

Since is a multiplicative function verifying one can show that

(3.13)

By using the same approach as in Theorem 3.1, Lemma 3.2 and the following well known formulas

combined with (3.12) and (3.13), we get the result.

4. Other Results

4.1. The Distribution of

Rényi proved that for any positive integer k, the set of numbers n such that has density where are the power series coefficients of the meromorphic function

Let denote the number of for which In [ ¹⁴, Theorem 2.16], Montgomery and Vaughan showed a quantitative form of Rényi’s theorem which states that for any nonnegative integer and any , one has

(4.1)

where

and is the set of powerful numbers i.e., those m such that In this section, we will study the distribution of the function An analogous formula to (4.1) holds for the number of for which Denote this number. By following the same steps as in the proof of [ ¹⁴, Theorem 2.16], we get the following result.

Proposition 4.1. For any nonnegative integer k and any

where

and is the set defined above.

We denote by the set of multiplicative arithmetical functions verifying

H. Daboussi proved that for every irrational uniformly for in we have

The proof is given in his paper ² written jointly with H. Delange.

An immediate consequence of Daboussi’s result is the following: If is an irrational number and g is a real valued additive arithmetical function, then the sequence is uniformly distributed modulo 1 and this follows from Weyl’s criterion (see [ ¹⁰, Theorem 5.6]). Since and are both additive real valued arithmetical functions then, for any irrational number the following sequences and are uniformly distributed modulo 1.

References