Table of Contents
Fetching ...

On the $2$-adic valuation of $σ_k(n)$

Kaimin Cheng, Ke Zhang

Abstract

For a positive integer $k$, let \[ σ_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $ν_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of $σ_k(n)$, we study $ν_2(σ_k(n))$ in detail. We prove that, for every integer $n\ge 2$, \[ ν_2(σ_k(n)) \le \begin{cases} \lceil \log_2 n \rceil, & \text{if $k$ is odd},\\[1mm] \lfloor \log_2 n \rfloor, & \text{if $k$ is even}. \end{cases} \] These bounds are best possible. More precisely, if $k$ is odd, then equality holds if and only if $n$ is a product of distinct Mersenne primes; if $k$ is even, then equality holds if and only if $n=3$. We also obtain an explicit formula for $ν_2(σ_k(n))$ in terms of the prime factorization of $n$.

On the $2$-adic valuation of $σ_k(n)$

Abstract

For a positive integer , let be the divisor function of order , and let denote the -adic valuation of an integer . Motivated by recent work on the -adic valuation of , we study in detail. We prove that, for every integer , \[ ν_2(σ_k(n)) \le \begin{cases} \lceil \log_2 n \rceil, & \text{if is odd},\\[1mm] \lfloor \log_2 n \rfloor, & \text{if is even}. \end{cases} \] These bounds are best possible. More precisely, if is odd, then equality holds if and only if is a product of distinct Mersenne primes; if is even, then equality holds if and only if . We also obtain an explicit formula for in terms of the prime factorization of .
Paper Structure (3 sections, 13 theorems, 76 equations)

This paper contains 3 sections, 13 theorems, 76 equations.

Key Result

Theorem 1.1

Let $k\ge 1$ and $n\ge 2$. Write where $p_1,\dots,p_r$ are distinct odd primes. Then In particular:

Theorems & Definitions (23)

  • Theorem 1.1
  • Lemma 2.1
  • proof
  • Lemma 2.2
  • proof
  • Lemma 2.3
  • Theorem 2.4
  • proof
  • Corollary 2.5
  • proof
  • ...and 13 more