On the least square-free primitive root modulo p

2016/02/07 by Stephen D. Cohen, Tim Trudgian, Cohen, Stephen D. +1
Mathematics · #11L40 #11N25 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11L40 #msc:11N25

paper · pdf · doi:10.48550/arxiv.1602.02440

7 pages

arxiv created 2016/02/09 · arxiv updated 2016/02/10

Abstract

Let g^\square(p) denote the least square-free primitive root modulo p. We show that g^\square(p)< p^0.96 for all p.

Related

• The Least Square-free Primitive Root Modulo a Prime
• Explicit upper bounds on the least primitive root
• The least primitive root modulo p²
• Square-full primitive roots
• Least Prime Primitive Roots