Year: 2026
Type: article
Abstract: A k−full integer (k ≥ 2) is a positive integer n such that pk divides n whenever p is a prime divisor of n. Let Nk be the set of such integers. For a real x ≥ 1, we present an asymptotic formula for the number of natural numbers {n ≤ x, n ∈ Nk} such that the sum of their digits, sg(n), in base g ≥ 2 satisfies sg(n) ≡ a mod b, where a ∈ Z and b ≥ 2. Keywords: Exponential sums, K-full integers, Sum of digits function. 2020 Mathematics Subject Classification. 11A63, 11L03, 11N69
Authors: Nadia Ayachi, Walid Wannes
Institutions: University of Sfax, Faculty of Sciences of Sfax
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7220548733