Square-full primitive roots

From MaRDI portal



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 p less than p2/3+3/(4sqrte)+epsilon, and we give some conditional bounds.












This page was built for publication: Square-full primitive roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639962)