http://dx.doi.org/10.4153/CJM-2010-020-4
Canad. J. Math. 62(2010), 582-594
Published:2009-12-04 Printed: Jun 2010
Sergei V. Konyagin
Carl Pomerance
Igor E. Shparlinski
Features coming soon:
Citations (via CrossRef)
Tools:
Search Google Scholar:
Abstract
An x-pseudopower to base g is a positive integer that is not a power of g, yet is so modulo p for all primes $ple x$. We improve an upper bound for the least such number, due to E.~Bach, R.~Lukes, J.~Shallit, and H.~C.~Williams. The method is based on a combination of some bounds of exponential sums with new results about the average behaviour of the multiplicative order of g modulo prime numbers.
© Canadian Mathematical Society, 2013
|