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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
