betaFeedback

WorksMathematics

On the behavior of the number of kk-full integers between successive kk-th powers

Abstract

Let k≥2k\ge2 be an integer. Inspired by an observation of Erdős (1976), we investigate the behavior of hk(n)h_k(n), the number of kk-full integers in the interval (nk,(n+1)k)(n^k, (n+1)^k) for positive integers nn. Let δkδ_k denote the supremum of the exponents δδ for which the inequality hk(n)>(log⁡n)δh_k(n) > (\log n)^δ holds for infinitely many positive integers nn. We improve the previously known lower bound δk≥1/2δ_k \ge 1/2, implied by Munsch, Shparlinski, and Yau (2020), to δk≥1δ_k \ge 1. Furthermore, for any given integer m≥1m \ge 1, we derive an effective upper bound for the smallest positive integer nn satisfying hk(n)≥mh_k(n)\ge m.

Paper details

vlnc:W_uyd26wu6
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…