Square-full primitive roots

被引:11
|
作者
Munsch, Marc [1 ]
Trudgian, Tim [2 ]
机构
[1] Graz Univ Technol, Inst Anal & Zahlentheorie, Graz, Austria
[2] UNSW Canberra, Sch Phys Environm & Math Sci, Canberra, ACT, Australia
基金
澳大利亚研究理事会; 奥地利科学基金会;
关键词
Primitive roots; character sums; square-full numbers;
D O I
10.1142/S1793042118500604
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We use character sum estimates to give some bounds on the least square-full primitive root modulo a prime. In particular, we show that there is a square-full primitive root mod p less than p(1/2+3/(4 root e)+epsilon).
引用
收藏
页码:1013 / 1021
页数:9
相关论文
共 50 条