Vichian Laohakosol, Teerapat Srichan and Pinthira
Tangsupphathawat
Vol. 9 (2020), No. 2, 187–202
DOI: 10.2140/moscow.2020.9.187
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.