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 p ≤ 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.
| Original language | English |
|---|---|
| Pages (from-to) | 582-594 |
| Number of pages | 13 |
| Journal | Canadian Journal of Mathematics |
| Volume | 62 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jun 2010 |
Fingerprint
Dive into the research topics of 'On the distribution of pseudopowers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver