computational complexity

, Volume 19, Issue 3, pp 355–366 | Cite as

Efficiently Certifying Non-Integer Powers

  • Erich KaltofenEmail author
  • Mark Lavin


We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations under the assumption of the Generalized Riemann Hypothesis. The certificate can then be verified in deterministic (log a)1+o(1) time. The certificate constitutes for each possible prime exponent p a prime number q p , such that a mod q p is a pth non-residue. We use an effective version of the Chebotarev density theorem to estimate the density of such prime numbers q p .


Integer roots integer powers linear-time algorithm bit complexity Chebotarev density theorem 

Subject classification.

11Y16 68W30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Basel AG 2010

Authors and Affiliations

  1. 1.Deptartment of MathematicsNorth Carolina State UniversityRaleighUSA

Personalised recommendations