1 Introduction
1.1 Main results
Let q be a prime number and
$k \in \mathbb {Z}_{\geqslant 1}$
. In recent years, several papers have appeared dealing with the q-adic valuation of
$\sigma _k(n) := \sum _{d \mid n} d^{k}$
. For instance, when
$k=1$
and
$q=2$
, the authors in [Reference Amdeberhan, Moll, Sharma and Villamizar1] proved that
$v_2(\sigma (n)) \leqslant \left \lceil \frac {\log n}{\log 2} \right \rceil $
, and also obtained conditional upper bounds for
$v_q(\sigma (n))$
when q is odd. These conditions were next dropped off in [Reference Zhao and Chen10] where the authors showed that
$v_q(\sigma (n)) \leqslant \left \lceil \frac {\log n}{\log q} \right \rceil $
whenever
$q \geqslant 3$
. Subsequently, Zhao [Reference Zhao9] generalized this result to the function
$\sigma _k(n)$
, establishing the bound
for all
$n \geqslant 2$
,
$k \geqslant 1$
, and primes
$q \geqslant 2$
. The case
$q=2$
was later improved by Cheng and Zhang in [Reference Cheng and Zhang3] in which it is proven that
and from which the authors derived the bound
The aim of this note is to generalize (1.2) to every prime
$q \geqslant 3$
, and then derive an upper bound for
$v_q \left ( \sigma _k(n) \right )$
which is asymptotically better than (1.1) when n is large and
$k \geqslant q-2$
.
Theorem 1.1 Let
$n \in \mathbb {Z}_{\geqslant 2}$
,
$k \in \mathbb {Z}_{\geqslant 1}$
, and
$q \geqslant 3$
be a prime number. Then
where
$\varpi _1 := \mathrm {ord}_q (p)$
,
$\varpi _k := \mathrm {ord}_q \big (p^k \big )$
, and
$\Phi _m(X)$
is the mth cyclotomic polynomial.
Example 1.2 With
$q=5$
and
$k=2$
, Theorem 1.1 yields
With
$q=7$
and
$k=9$
, we derive
Corollary 1.3 Let
$n \in \mathbb {Z}_{\geqslant 3}$
,
$k \in \mathbb {Z}_{\geqslant 1}$
, and
$q \geqslant 3$
be a prime number. Then
Here,
$M_{q,k} := \max \varphi (d)$
where the maximum runs over the divisors
$ d$
of
$q-1 $
such that
$d \nmid k$
, with the convention
$M_{q,k} = 0$
if this set is empty. In particular,
Furthermore, if
$v_q(k)=0$
, then the term
$ {1.385} \log k$
can be omitted.
Note that
$M_{q,k}$
may be much smaller than
$\min (q-2,k)$
since the use of the cyclotomic polynomial
$\Phi _{\varpi _1}(X)$
may reduce drastically the q-adic valuation of the second sum in Theorem 1.1. For instance,
$M_{7,9} = 2$
as can be seen in Example 1.2. Also note that Theorem 1.1 implies that, if
$p \ne q$
,
$p^k \not \equiv 1 \; (\mathrm {mod}\ q)$
, and
$\mathrm {ord}_q \left ( p^{k}\right ) \mid \alpha + 1$
, then
$ v_q \left ( \sigma _k \left ( p^{\alpha }\right ) \right ) \geqslant 1 $
.
1.2 Notation
In what follows, p and q are always prime numbers satisfying
$p \ne q$
and
$q \geqslant 3$
. The notation
$p^{\alpha } \| n$
means
$p^{\alpha } \mid n$
and
$p^{\alpha + 1} \nmid n$
, so that
$v_p(n) = \alpha $
. The
$\gcd $
of the integers a and b is denoted by
$(a,b)$
. For all
$k \in \mathbb {Z}_{\geqslant 1}$
,
$\varpi _k := \mathrm {ord}_q \big (p^k \big )$
and
$d_k := (k,\varpi _1) = \Big ( k, \mathrm {ord}_q(p)\Big )$
. If
$n \geqslant 2$
,
$\varphi (n)$
is the Euler totient,
$\tau (n) := \sum _{d \mid n} 1$
is the number of divisors of n,
$\omega (n) := \sum _{p \mid n} 1$
is the number of distinct prime divisors of n, and
$\gamma (n) := \prod _{p \mid n} p$
is the squarefree kernel of n. Finally,
$\Phi _m(X)$
is the mth cyclotomic polynomial.
2 Proofs
2.1 The LTE lemma
The next result, which seems to appear for the first time in 1878 in the work of Lucas [Reference Lucas4, Section XIII], will play a key part in the proof of Theorem 1.1. For a proof, see, for instance, [Reference Manea5, Theorem 1].
Lemma 2.1 (LTE)
Let
$a \ne b \in \mathbb {Z}$
,
$q \geqslant 3$
prime such that
$q \nmid ab$
and
$q \mid a-b$
, and
$m \in \mathbb {Z}_{\geqslant 1}$
. Then
2.2 Tools for values of cyclotomic polynomials
The following lemma is quite well known and may follow from the fact that
$\Phi _m(X)$
is a reciprocal polynomial for instance. We provide here a slightly different proof.
Lemma 2.2 Let
$n \in \mathbb {Z}_{\geqslant 2}$
and
$m \in \mathbb {Z}_{\geqslant 1}$
. Then
Proof By Möbius inversion,
and
where we used the Dirichlet convolution identity
$\mathrm {id} \star \mu = \varphi $
, so that
and the asserted bounds follow easily.
The next result is well known (see [Reference Washington8, Lemma 2.9] for instance).
Lemma 2.3 Let q be a prime. Then, for all
$n \in \mathbb {Z}$
and
$m \in \mathbb {Z}_{\geqslant 1}$
such that
$q \nmid mn$
, we have
2.3 Proof of Theorem 1.1
Write
$n = q^{\nu } a b$
with
$\nu \in \mathbb {Z}_{\geqslant 0}$
,
$(a,b)=1$
such that
$p \mid a \Longrightarrow p^{k} \equiv 1 \; (\mathrm {mod}\ q)$
and
$p \mid b \Longrightarrow \left ( p \ne q \right .$
and
$\left. p^{k} \not \equiv 1 \; (\mathrm {mod}\ q) \right )$
. Note that
$\sigma _k \big ( q^{\nu } \big ) = 1 + q^k + \dotsb + q^{k \nu } \equiv 1 \; (\mathrm {mod}\ q)$
, and hence
$v_q \left ( \sigma _k \big ( q^{\nu } \big ) \right ) =0$
. Thus,
If
$q \geqslant 3$
,
$q \ne p$
, and
$q \mid p^k - 1$
, we apply Lemma 2.1 with
$a=p^k$
,
$b=1$
, and
$m= \alpha +1$
, yielding
so that
To evaluate
$v_q \left ( \sigma _k(b)\right )$
, we assume throughout that
$p^k \not \equiv 1 \; (\mathrm {mod}\ q)$
and first note that, for all
$p^{\alpha } \| b$
, we have
since
$q \nmid p^{k}-1$
. Also notice that this latter condition implies
$\varpi _1 \geqslant 2$
and
$\varpi _k \geqslant 2$
.
-
⊳ If $ \varpi _k \nmid \alpha + 1 $
, the Euclidean division of
$\alpha + 1$
by
$\varpi _k$
yields
$\alpha + 1 = h \varpi _k + r$
with
$1 \leqslant r < \varpi _k$
, so that $$ \begin{align*}p^{k(\alpha+1)}-1 = \left( p ^{k \varpi_k} \right)^{h} \times p^{rk} - 1 \equiv p^{rk} - 1 \not \equiv 0 \; (\mathrm{mod}\ q)\end{align*} $$otherwise we would have $\varpi _k \leqslant r$
since
$r \geqslant 1$
, which would contradict the inequality
$r < \varpi _k$
. We infer that, in this case, we have $$ \begin{align*}v_q \left( \sigma_k\big( p^{\alpha} \big)\right) = 0.\end{align*} $$
-
⊳ If $ \varpi _k \mid \alpha + 1 $
, write
$\alpha + 1 = h \varpi _k$
with
$h \in \mathbb {Z}_{\geqslant 1}$
. Since
$p^{k \varpi _k} \equiv 1 \; (\mathrm {mod}\ q)$
, Lemma 2.1 yields $$ \begin{align*} v_q \left( \sigma_k\big( p^{\alpha} \big)\right) &= v_q \left( p^{k h \varpi_k} - 1 \right) = v_q \left( p^{k \varpi_k} - 1 \right) + v_q(h) \\ &= v_q \left( p^{k \varpi_k} - 1 \right) + v_q(\alpha+1) - v_q(\varpi_k) \\ &= v_q \left( p^{k \varpi_k} - 1 \right) + v_q(\alpha+1), \end{align*} $$where we used $\varpi _k \mid q-1$
and hence
$ v_q(\varpi _k) = 0 $
. Therefore, $$ \begin{align*} v_q \left( \sigma_k(b)\right) &= \sum_{\substack{p^{\alpha} \| b \\ \varpi_k \mid \alpha + 1}} \left( v_q(\alpha+1) + v_q \left( p^{k \varpi_k} - 1 \right) \right) \\ & = \sum_{\substack{p^{\alpha} \| n \\ p \ne q \\ p^{k} \not \equiv 1 \; (\mathrm{mod}\ q) \\ \varpi_k \mid \alpha + 1}} \left( v_q(\alpha+1) + v_q \left( p^{k \varpi_k} - 1 \right) \right). \end{align*} $$We now distinguish between two cases:
-
(a) If $q \mid p^{\varpi _k} - 1$
, Lemma 2.1 implies that $$ \begin{align*}v_q \left( p^{k \varpi_k} - 1 \right) = v_q \left( p^{\varpi_k} - 1 \right) + v_q(k).\end{align*} $$Also note that, since $1 \equiv p^{k \varpi _k} \equiv p^{\varpi _k} \; (\mathrm {mod}\ q)$
, we derive
$\varpi _1 \mid \varpi _k (k-1)$
, and since
$\varpi _1 = \varpi _k d_k $
, where
$d_k := \left ( \varpi _1,k\right )$
, we get
$d_k \mid k-1$
. Since
$d_k \mid k$
, we obtain
$d_k = 1$
and then
$\varpi _k = \varpi _1$
. Hence, $$ \begin{align*}v_q \left( p^{k \varpi_k} - 1 \right) = v_q \left( p^{\varpi_1} - 1 \right) + v_q(k).\end{align*} $$
-
(b) Assume $q \nmid p^{\varpi _k} - 1$
. Using again
$\varpi _1 = \varpi _k d_k $
, we derive
$ k \varpi _k = \frac {k \varpi _1}{d_k} := m \varpi _1$
, where
$m:= \frac {k}{d_k}$
. Since
$q \mid p^{\varpi _1} - 1$
, Lemma 2.1 yields $$ \begin{align*} v_q \left( p^{k \varpi_k} - 1 \right) &= v_q \left(p^{m \varpi_1} - 1\right) \\ &= v_q \left( p^{\varpi_1} - 1 \right) + v_q(m) \\ &= v_q \left( p^{\varpi_1} - 1 \right) + v_q (k) - v_q (d_k). \end{align*} $$Furthermore, since $\varpi _1 \mid q-1$
, we have
$q \nmid \varpi _1$
, so that
$ v_q (d_k) = 0 $
.
Hence,
$$ \begin{align*}v_q \left( \sigma_k(b)\right) = \sum_{\substack{p^{\alpha} \| n \\ p \ne q \\ p^{k} \not \equiv 1 \; (\mathrm{mod}\ q) \\ \varpi_k \mid \alpha + 1}} \left( v_q(\alpha+1) + v_q(k) +v_q \left( p^{\varpi_1} - 1 \right) \right).\end{align*} $$Now
$$ \begin{align*}v_q \left( p^{\varpi_1} - 1 \right) = v_q \left( \prod_{d \mid \varpi_1} \Phi_d (p) \right) = \sum_{d \mid \varpi_1} v_q \left( \Phi_d (p) \right)\end{align*} $$and since $q \ne p$
and
$q \nmid d$
for all
$d \mid \varpi _1$
because
$\varpi _1 \mid q-1$
, Lemma 2.3 yields
$v_q \left ( \Phi _d (p) \right ) \ne 0 \iff d= \mathrm {ord}_q(p)= \varpi _1$
, so that $$ \begin{align*}v_q \left( p^{\varpi_1} - 1 \right) = v_q \left( \Phi_{\varpi_1} (p) \right).\end{align*} $$
-
Finally, we get
and we complete the proof by reporting (2.2) and (2.3) in (2.1).
2.4 Proof of Corollary 1.3
First note that, when
$p^k \equiv 1 \, (\mathrm {mod}\ q)$
, then
$\varpi _k = 1$
, so that Theorem 1.1 may be restated as
and therefore,
say.
-
⊳ The sum $S_1$
does not exceed $$ \begin{align*}S_1 \leqslant \frac{1}{\log q} \left( \sum_{p^{\alpha} \| n} \log (\alpha + 1) + \log k \sum_{p \mid n} 1 \right) = \frac{\log \tau(n) + \omega(n) \log k}{\log q}\end{align*} $$and the bounds [Reference Nicolas and Robin6, Théorème 1] and [Reference Robin7, Théorème 11] imply that
(2.5) $$ \begin{align} S_1 < \frac{\left( {1.385} \log k + {1.066} \right) \log n}{\log q \log \log n}. \end{align} $$
-
⊳ It remains to estimate $S_2$
. Let us first note that the condition
$p^k \not \equiv 1 \; (\mathrm {mod}\ q)$
is equivalent to
$\varpi _1 \mid q-1$
and
$\varpi _1 \nmid k$
. Also recall that
$M_{q,k} = \max \varphi (d)$
, where the maximum is taken over the divisors
$ d$
of
$q-1 $
such that
$d \nmid k$
, with the convention
$M_{q,k} = 0$
if this set is empty. Hence, in view of the previous remark, we get the bound
$\varphi (\varpi _1) \leqslant M_{q,k}$
for all primes
$p \mid n$
satisfying
$p^k \not \equiv 1 \; (\mathrm {mod}\ q)$
.Using Lemma 2.2, we derive for $n \geqslant 3$
, (2.6) $$ \begin{align} S_2 & \leqslant \frac{1}{\log q} \sum_{\substack{p \mid n \\ p^k \not \equiv 1 \; (\mathrm{mod}\ q)}} \log \left( \Phi_{\varpi_1} (p) \right) \notag \\ & \leqslant \frac{1}{\log q} \sum_{\substack{p \mid n \\ p^k \not \equiv 1 \; (\mathrm{mod}\ q)}} \Biggl( \log \left( p^{\varphi(\varpi_1)}\right) - \sum_{k=1}^{\infty} \log \left( 1 - \frac{1}{p^k}\right) \Biggr) \notag \\ & \leqslant \frac{1}{\log q} \log \left( \prod_{\substack{p \mid n \\ p^k \not \equiv 1 \; (\mathrm{mod}\ q)}} p^{\varphi(\varpi_1)} \right) + \frac{1}{\log q} \sum_{p \mid n} \sum_{k=1}^{\infty} \left( \frac{1}{p^k} + \frac{1}{p^{2k}}\right) \notag \\ & \leqslant \frac{1}{\log q} \log \left( \prod_{\substack{p \mid n \\ p^k \not \equiv 1 \; (\mathrm{mod}\ q)}} p^{M_{q,k}} \right) + \frac{1}{\log q} \sum_{p \mid n} \left( \frac{1}{p-1} + \frac{1}{p^2-1} \right) \notag \\ &< \frac{M_{q,k}}{\log q} \log \left( \prod_{p \mid n} p \right) + \frac{1}{\log q} \sum_{p \mid n} \left( \frac{1}{p} + \frac{4}{p^2} \right) \notag \\ & \leqslant \frac{M_{q,k} \log \gamma(n)}{\log q} + \frac{1}{\log q} \left( \log \log \log n + 2 + 4 \log \zeta(2) \right) \notag \\ & < \frac{M_{q,k} \log \gamma(n)}{\log q} + \frac{4(\log \log \log n + 1)}{\log q}, \end{align} $$
where we used [Reference Bordellès2, Exercise 61, p. 337] stating that
$\sum _{p \mid n} 1/p < \max \left ( 1, \log \log \log n + 1 \right ) $
when
$n \geqslant 3$
. The first inequality in Corollary 1.3 follows from inserting (2.5) and (2.6) into (2.4). The second inequality comes from the well-known bounds
$\varphi (\varpi _1) \leqslant \varpi _1 - 1 \leqslant q-2$
, since
$\varpi _1 \geqslant 2$
, implying that
$M_{q,k} \leqslant q-2$
.
Acknowledgments
The author deeply acknowledges the anonymous referee for his careful reading of the manuscript that has significantly enhanced the article. In particular, he spotted an error in the proof of Corollary 1.3 and provided a better definition of
$M_{q,k}$
than in the original version.


