1 Introduction and main results
Let
$\gcd (n_{1},\ldots ,n_{k})$
be the greatest common divisor of positive integers
$n_{1},\ldots ,n_{k}$
for any fixed integer
$k\geq 2$
. In 2012, Krätzel et al. [Reference Krätzel, Nowak and Tóth8] considered the asymptotic behavior of the summatory function
for any real number
$x>1$
and any fixed integer
$k\geq 2$
. The sum runs over the hyperbolic region
$ \{ (n_{1},\ldots ,n_{k}) \in {\mathbb N}^{k}:\ n_{1}\ldots n_{k}\leq x,\ k\geq 2 \}. $
Let
$s=\sigma +it$
be a complex variable, and let
$\zeta (s)$
denote the Riemann zeta function. For
$k=2$
, they showed that
where
$E_{2}(x)$
is the error term, which is estimated by
$O\left (x^{\theta }(\log x)^{\theta '}\right )$
for some real numbers
$\frac 12 < \theta <1$
and
$\theta '>0$
. Using the discrete Hardy–Littlewood method [Reference Huxley4], they obtained the values:
$\theta =\frac {547}{832}(=\frac 12+\frac {131}{832})$
and
$\theta '=\frac {26947}{8320}$
(see also [Reference Tóth14, Reference Tóth and Zhai15]). For any fixed integer M, Kühleitner and Nowak [Reference Kühleitner and Nowak9] studied the summation of the arithmetic functions
$h_{M}(n)$
associated with the Dirichlet series
for
$\mathrm {Re}~s>1$
. Let
$G_{M}(x)$
denote the error term defined by
for any real number
$x>1$
. They considered a lower bound for the error term
$G_{M}(x)$
and proved the Omega-estimate for the error term:
which is a precise estimate and very sharp result.
In this study, we, inspired by their work, first investigate the mean square estimate of
$G_{M}(x)$
. Set the integral
for any real number
$T\geq 16$
. By (1.4), we have
To evaluate this, we employ the properties of the Riemann zeta function and Parseval’s identity (see (A.5) in [Reference Ivić5]) for Mellin transforms. This approach, which originates from the work of Titchmarsh, has since been utilized by many authors (e.g., Hilberdink [Reference Hilberdink3]). Using this method, we derive the following result.
Theorem 1.1 Let the notation be as above. For any real number
$T\geq 16$
and any fixed integer M, we have
Let
$\mu $
denote the Möbius function, defined by
Let
$\sigma $
and
$\phi $
define the sum-of-divisors function and the Euler totient function, defined by the Dirichlet convolutions
$\mathbf {1}*\mathrm {id}$
and
${\mu }*\mathrm {id}$
, respectively, where
$\mathrm {id}(n)=n$
and
$\mathbf {1}(n)=1$
for any positive integer n. From Proposition 5.1 in [Reference Krätzel, Nowak and Tóth8], we have
(see also [Reference Kühleitner and Nowak9]). Using equation (1.3) and the previous equations, the integrals
$J_{0}(T)$
and
$J_{-2}(T)$
represent the mean square estimates for the error terms in the partial sums of the functions
$\sigma $
and
$\phi $
, respectively, involving the greatest common divisor. Thus, we obtain the bounds
Using the Cauchy–Schwarz inequality and (1.5), we deduce the following.
Remark 1.2 For any real number
$T\geq 16$
, and any fixed integer M, we have
Subsequently, we may conjecture that the order of magnitude of
$G_{M}(x)$
is given by the estimation on the right-hand side of (1.6).
Remark 1.3 If
$J_{M}(T)$
can be evaluated using
as
$T \to \infty $
with a constant
$c(M)>0$
, depending on M and numbers
$\ell>0$
,
$\delta>0$
, then we obtain the following Omega-result of
$G_{M}(x)$
:
Hence, an interesting relation is revealed between equations (1.4) and (1.7). It can be observed that (1.5) provides a sharp estimate, though it is not the best one.
Moreover, by using the relationships in (1.1), (2.2), and (2.3), along with the Cauchy residue theorem to obtain
where
$\alpha _{k}$
is defined by (5.1) below, and
$M_{k}(x)$
is the main term, which is given by
Then, the function
$E_{k}(x)$
provides the error term of
$S_{k}(x)$
, as
for
$\alpha _{k} <1$
and is close to
$1$
. For
$k=3$
, Krätzel et al. [Reference Krätzel, Nowak and Tóth8] derived the order of magnitude of the error term
$E_{3}(x)$
:
Assume that the Riemann hypothesis (RH) is true. The second goal of this article is to consider the estimate for the mean square of
$E_{k}(x)$
under the RH, which is given by (1.8), for any fixed integer
$k\geq 3$
. We shall derive the integral of
$I_{k}(T)$
, defined as
for any fixed integer
$k\geq 3$
and any real number
$T\geq 16$
. We use the Parseval identity for Mellin transforms and some properties of the Riemann zeta function under the RH to obtain the following.
Theorem 1.4 Assume that the RH is true. For any real number
$T\geq 16$
and any fixed integer
$k~(3 \leq k < \frac {1}{6C}\log \log T)$
with a constant
$C\ (0<C<\frac {1}{18})$
, we have
for some positive numbers A and
$A'$
.
If
$I_{k}(T)$
may be evaluated by
as
$x\to \infty $
with constants
$c', c">0$
and numbers
$l', l">0$
, and
$\delta ', \delta ">0$
, then we can deduce the Omega-result for
$E_{k}(x)$
as
The Omega-result (1.12) for
$k\geq 4$
is completely analogous to the conjecture (2.1) stated below for the Piltz divisor problem (see [Reference Hilberdink3, Reference Ivić5, Reference Takeda10, Reference Takeda11, Reference Titchmarsh13]).
Using Cauchy–Schwarz’s inequality and (1.11), we deduce the following.
Remark 1.5 Let the notations be defined as above. For any real number
$T\geq 16$
, we have
Then, we may conjecture that the order of magnitude of
$E_{k}(x)$
is given by the estimates on the right-hand side of (1.13) under the RH, namely,
where
$\varepsilon $
denotes an arbitrary, small positive number that may be different at each occurrence.
For
$k=3$
, the estimate (1.14) gives us an improvement on the estimate (1.9) under the RH.
2 Initial transformation
For any positive integer
$k\geq 2$
, let
$\tau _{k}$
denote the k-factors divisor function defined as
${\mathbf {1}*\mathbf {1}*\cdots *\mathbf {1}}_{}$
,
$\tau =\tau _{2}$
. Here,
$\mathbf {1}$
is given by
$\mathbf {1}(n)=1$
for any positive integer n. We define the error term
$\Delta _{k}(x)$
in the generalized divisor problem as
where
${Q}_{k}(\log x)$
is a polynomial of degree
$k-1$
in
$\log x$
, defined as
$ Q_{k}(\log x)=\underset {s=1}{\mathrm {Res}}~\zeta ^{k}(s)\frac {x^{s-1}}{s}. $
The order of magnitude of
$\Delta _{k}(x)$
as
$x\to \infty $
, called the Piltz divisor problem, is an open problem that has attracted much interest in analytic number theory. It has been conjectured that
for any integer
$k\geq 2$
and any small number
$\varepsilon>0$
(see Chapter 13 in [Reference Ivić5], or [Reference Titchmarsh13]). Krätzel et al. (Proposition 5.1 in [Reference Krätzel, Nowak and Tóth8]) showed that
where
$\phi $
is the Euler totient function (see [Reference Heyman and Tóth2, Reference Kiuchi and Saad Eddin6, Reference Kiuchi and Tsuruta7]). We use (2.2) to get the formal Dirichlet series
for
$\mathrm {Re}~s>1$
. We can use the above expression, Parseval’s identity, and some properties of the Riemann zeta function to derive the mean square estimate for
$E_{k}(x)$
.
3 Auxiliary results
To prove the theorems, we need the following lemmas.
Lemma 3.1 For
$|t|\geq t_{0}>0$
uniformly in
$\sigma $
, we have
Footnote 1 and
Proof This lemma follows from [Reference Tenenbaum12, Theorem II.3.8] and [Reference Titchmarsh13, formula (3.11.8)].
The following two lemmas are well-known results (see [Reference Ivić5, Reference Titchmarsh13]) and famous bounds for the Riemann zeta function under the RH (see [Reference Ivić5, Reference Titchmarsh13]), respectively.
Lemma 3.2 The Riemann zeta function
$\zeta (s)$
can be analytically continued to a meromorphic function in the whole complex plane
${\mathbb C}$
, its only singularity being a simple pole at
$s=1$
with residue
$1$
. It satisfies a functional equation
where
$ \chi (s)=2^{s}\pi ^{s-1}\sin \frac {\pi s}{2}\Gamma (1-s). $
In addition, in any bounded vertical strip, using the Stirling formula, we deduce that
$ \chi (s) =\left (\frac {t}{2\pi }\right )^{\frac 12-\sigma -it}e^{i(t+\frac {\pi }{4})}\left (1+O\left (\frac {1}{t}\right )\right ) $
for
$t\geq t_{0}>0$
.
Lemma 3.3 Assume that the RH is true.Footnote
2
For
$|t|\geq t_{0}> 0$
, uniformly in
$\sigma $
, we have
and
where
$\varepsilon $
denotes an arbitrary, small positive number.
The following lemma gives the convexity of moments.
Lemma 3.4 Let
$f(s)$
be analytic in the region
and suppose that
$f(s) \ll e^{C t^2}$
in
$\mathcal {D}$
. Then, for any fixed
$q>0$
and
$\alpha <\gamma <\beta $
, we have
as
$U\to \infty $
.
Proof The estimate is Lemma 8.3 of Ivić [Reference Ivić5].
4 Proof of Theorem 1.1
4.1 Nonnegative integers
$M\geq 0$
We prove the upper bound of the mean square estimate of
$G_{M}(x)$
for any nonnegative integer M. We use (1.2) and the inversion formula (see (A.8) of [Reference Ivić5]) to deduce
First, we define
$\alpha _{0}$
as the infimum of
$\alpha>\frac 12$
for which
Moving the line of integration in (4.1) to some
$\alpha _{0} < \alpha < 1$
, and we encounter a triple pole at
$s=1$
with the integrand. We use the Cauchy residue theorem to obtain
It follows from (1.3) and (4.2) that
for
$\alpha _{0}<\alpha _{} <1$
and close to
$1$
. Since
$ {\zeta ^{2}(s)\zeta (2s-1)\zeta ^{M}(2s)}{s^{-1}} \to 0 $
uniformly in the strip
$\alpha _{0}<\alpha _{}' <\alpha _{} < 1$
as
$t\to \pm \infty $
, it is seen on integrating over the rectangle
$\alpha _{}' \pm iU$
,
$\alpha _{}\pm iU\ (\alpha _{0}<\alpha _{}'<\alpha _{}<1)$
, that (4.3) holds for any
$\alpha _{}>\alpha _{0}$
. Replacing in (4.3) x by
$1/x$
, taking
$\alpha>\alpha _0$
and using the Parseval identity (see (A.5) in [Reference Ivić5]), we have
We set
From Parseval’s identity, it follows that once the estimate
is established, we obtain
Consequently, we have
Furthermore,
by applying (4.5) to each dyadic interval.
To estimate the integral in (4.4), we introduce an auxiliary truncation parameter
$U\ge T\geq 16$
and define
Using Lemma 3.2, we obtain
Using the Laurent expansion of the Riemann zeta function at
$s=1$
,
we obtain
By Lemma 3.4, we have
By inserting
$\alpha =1/2+\varepsilon $
and using (3.1) together with the estimate (4.7), we obtain
Hence, we obtain (4.4) and it follows that
holds.
4.2 Negative integers
$M<0$
According to the method described in Section 4.1, we consider the estimate
$J_{M}(T)$
for a negative integer M. Now, setting
$M=-m$
, where m is a positive integer, we obtain
Define
$\alpha _{0}$
as the infimum of
$\alpha>0$
satisfying
Using (1.3), (4.8), and the Cauchy residue theorem, we obtain
Then we have
for
$\alpha _{0}<\alpha _{} <1$
. Similar to the proof in Section 4.1, we have
We set
We see that if
then, for any
$T\geq 16$
, we have
For any
$U\geq 16$
, using Lemma 3.2, we obtain
Inserting
$\alpha _{} = 1/2+\varepsilon $
into the above, and using (3.1), (3.3), and (4.7), we obtain for
$U\ge T\ge 16$
,
Therefore, we obtain
Therefore, we complete the proof of (1.5).
5 Proof of Theorem 1.4
Assume that the RH is true. Similar to the proof of Theorem 1.1, we shall calculate the mean square estimate for
$E_{k}(x)$
. Define
$\alpha _{0,k}$
as the infimum of
$\alpha _{k}>0$
for which
for any integer
$k\geq 3$
. Then, using (1.8) and Mellin transforms, we obtain
We see that if
for some
$\alpha _{k}$
(
$\alpha _{0,k}<\alpha _{k}<1$
), then we have
for any
$T\geq 16$
. Set
For any
$U\geq 16$
, we shall consider the estimate of the integral
For
$k=3$
, similar to the proof of Theorem 1.1, we have for
$U\ge T\ge 16$
,
Then the integral
$K_{3}(U)$
converges as
$U\to \infty $
. Putting
$ \varepsilon =\frac {C}{\log \log T}$
with a constant
$C~(0<C<\frac {1}{18})$
into (5.2), we obtain the estimate
with a positive number A.
Similarly, for
$k\geq 4$
, we have
Inserting
$ \alpha _{k}=\frac 12-\frac {1}{2k}+2\varepsilon \ (\varepsilon :=\frac {C}{\log \log T}) $
with a constant
$C~(0<C<\frac {1}{18})$
into the above, the integral
$ K_{k}(U) $
converges as
$U\to \infty $
. Hence, inserting
$ \alpha _{k}=\frac 12-\frac {1}{2k}+2\varepsilon $
into (5.2), the estimate
holds with a positive number
$A'$
, and any fixed integer
$k~(4\leq k < \frac {1}{6C}\log \log T)$
.Footnote
3
This proves the estimate (1.11).
Acknowledgments
The authors would like to thank the referee for his/her careful reading of the earlier versions of this article and giving them many valuable suggestions and pointing out errors.



