Skip to main navigation Skip to search Skip to main content

Higher-power divisibility in a floor function set

Research output: Contribution to journal › Article › peer-review

Abstract

Let (Formula presented) and write 1S(x) for its indicator. For fixed k⩾3 and a multiplicative function g, put (Formula presented). We study (Formula presented), and obtain explicit bounds for the error term Ek,g(x) across three natural classes (Types I–III) of multiplicative g. Our arguments use the distribution of S(x) in arithmetic progressions due to Yu and Wu, which yields (Formula presented) uniformly for (Formula presented). Consequently, all unconditional results here are uniform in this proven range; extensions to m⩽x follow conditionally under a divisible–subset alignment assumption. The case k=2 is recovered as a special instance; for k⩾3 we isolate the new features arising from higher-power divisibility, including a small/large-d decomposition tuned to the Yu–Wu range and explicit k-dependent exponents in Ek,g(x). We also include short worked examples for g≡1, g=μ, and g=μ2.

Original languageEnglish
Article number2026012
JournalScienceAsia
Volume52
Issue number1
DOIs
Publication statusPublished - Feb 2026

Keywords

  • arithmetic progressions
  • Dirichlet convolution
  • divisor sums
  • hyperbola method
  • multiplicative functions

Fingerprint

Dive into the research topics of 'Higher-power divisibility in a floor function set'. Together they form a unique fingerprint.

Cite this