On the $2$-adic valuation of $\sigma_k(n)$

TL;DR

This paper investigates the 2-adic valuation of the divisor function 5_k(n), establishing sharp bounds and characterizing when these bounds are attained, with explicit formulas based on prime factorizations.

Contribution

It provides the first precise bounds for 5_2(n) depending on the parity of k and characterizes the cases of equality, advancing understanding of the 2-adic properties of divisor sums.

Findings

5_2(n)  ceil log_2 n for odd k

5_2(n)  floor log_2 n for even k

Equality cases characterized by n being a product of Mersenne primes or n=3

Abstract

For a positive integer $k$, let \[ \sigma_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $\nu_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of $\sigma_k(n)$, we study $\nu_2(\sigma_k(n))$ in detail. We prove that, for every integer $n\ge 2$, \[ \nu_2(\sigma_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 $\nu_2(\sigma_k(n))$ in terms of the prime factorization of $n$.