Abstract
A positive integer n is called an r-full integer if for all primes \(p\mid n\) we have \(p^r\mid n.\) Let p be an odd prime. For \(\gcd (n,p)=1\), the smallest positive integer f such that \(n^f\equiv 1\pmod p\) is called the exponent of n modulo p. If \(f=p-1\) then n is called a primitive root modulo p. Let \(T_r(n)\) be the characteristic function of the r-full primitive roots modulo p. In this paper we derive the asymptotic formula for the following sums
by using properties of character sums.
Similar content being viewed by others
References
D.A. Burgess, On character sums and primitive roots. Proc. Lond. Math. Soc. 3(1), 179–192 (1962)
S.D. Cohen, T. Trudgian, On the least square-free primitive root modulo p. J. Number Theory 170, 10–16 (2017)
H.N. Shapiro, Introduction to the theory of number. Pure and Applied Mathematics. (Wiley, New York, 1983)
M. Munsch, Character sums over squarefree and squarefull numbers. Archiv der Mathematik 102(6), 555–563 (2014)
M. Munsch, T. Trudgian, Square-full primitive roots. Int. J. Number Theory 14(04), 1013–1021 (2018)
Teerapat Srichan, Square-full and cube-full numbers in arithmetic progressions. Siauliai Math. Seminar 8(16), 223–248 (2013)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Srichan, T. On the distribution of square-full and cube-full primitive roots. Period Math Hung 80, 103–107 (2020). https://doi.org/10.1007/s10998-019-00307-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-019-00307-z