On the least square-free primitive root modulo p
详细信息 查看全文
- 作者：Stephen D. Cohena ; Stephen.Cohen@glasgow.ac.uk" class="auth_mail" title="E-mail the corresponding author ; Tim Trudgianb ; 1 ; timothy.trudgian@anu.edu.au" class="auth_mail" title="E-mail the corresponding author
- 关键词：Character sums ; Primitive roots ; Square-free integers
- 刊名：Journal of Number Theory
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：170
- 期：Complete
- 页码：10-16
- 全文大小：250 K
文摘
Let class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0022314X16301627&_mathId=si1.gif&_user=111111111&_pii=S0022314X16301627&_rdoc=1&_issn=0022314X&md5=9c79c55c5226658ebe8d394d6d433415" title="Click to view the MathML source">g□(p)class="mathContainer hidden">class="mathCode"> denote the least square-free primitive root modulo p . We show that class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0022314X16301627&_mathId=si18.gif&_user=111111111&_pii=S0022314X16301627&_rdoc=1&_issn=0022314X&md5=a34a94603f585c9a58056a5b81cbe8aa" title="Click to view the MathML source">g□(p)<p0.96class="mathContainer hidden">class="mathCode"> for all p.