Abstract
An asymptotic estimate for the number of positive primitive roots which are square-full integers in arithmetic progressions is derived. The employed method combines two techniques and is based on the character-sum method involving two characters; one character is to take care of being a primitive root, based on a result of Shapiro, and the other character is to take care of being square-full, based on a result of Munsch.
Citation
Vichian Laohakosol. Teerapat Srichan. Pinthira Tangsupphathawat. "Square-full primitive roots in arithmetic progressions." Mosc. J. Comb. Number Theory 9 (2) 187 - 202, 2020. https://doi.org/10.2140/moscow.2020.9.187
Information
