原根中的主题
Topics In Primitive Roots
摘要:
这本专著认为几个主题的理论原根g(p)模一个素数p>=2。给出了最小原根g(p)和最小素原根g^*(p)模p(大素数)的一些估计.这里的一个估计似乎将伯吉斯估计g(p)<< p^(1/4+e)(对于任意小的数3 > 0)统一地锐化为更小的估计g(p)<= p^(5/loglog p)(对于所有大素数p => 2)。预期的数量级为g(p)<<(log p)^c,c>1常数。最小素原根g^*(p)的相应估计值略高。另一个问题是关于素数p <= x且有固定原根g!=的个数的有效下界#{p <= x:ord(g)= p-1} >> x/log x -1,b^2对所有大于1的大数。目前文献中的结果要求有下界#{p <= x:ord(g)= p-1} >> x/(log x)^2,并且对最小固定整数个数限制为3或更多。
英文摘要:
This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of the estimate here seems to sharpen the Burgess estimate g(p) << p^(1/4+e) for arbitrarily small number 3 > 0, to the smaller estimate g(p) <= p^(5/loglog p) uniformly for all large primes p => 2. The expected order of magnitude is g(p) <<(log p)^c, c>1 constant. The corresponding estimates for least prime primitive roots g^*(p) are slightly higher. Anotrher topic deals with an effective lower bound #{p <= x : ord(g)= p-1} >> x/log x for the number of primes p <= x with a fixed primitive root g != -1, b^2 for all large number x >1. The current results in the literature claim the lower bound #{p <= x : ord(g) = p-1} >> x/(log x)^2, and have restrictions on the minimal number of fixed integers to three or more.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。