no. 16 · Tuesday 17 November 2026
On the behavior of the number of $k$-full integers between successive $k$-th powers
Abstract
Let $k\ge2$ be an integer. Inspired by an observation of Erdős (1976), we investigate the behavior of $h_k(n)$, the number of $k$-full integers in the interval $(n^k, (n+1)^k)$ for positive integers $n$. Let $δ_k$ denote the supremum of the exponents $δ$ for which the inequality $h_k(n) > (\log n)^δ$ holds for infinitely many positive integers $n$. We improve the previously known lower bound $δ_k \ge 1/2$, implied by Munsch, Shparlinski, and Yau (2020), to $δ_k \ge 1$. Furthermore, for any given integer $m \ge 1$, we derive an effective upper bound for the smallest positive integer $n$ satisfying $h_k(n)\ge m$.
- comments
- 8 pages
- fields
- Number Theory