Square-full primitive roots
arXiv:1703.04953
Abstract
We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod less than , and we give some conditional bounds.
9 pages