Jonathan Pila

Learn More
This paper presents an algorithm that, given an integer n > 1, finds the largest integer k such that n is a kth power. A previous algorithm by the first author took time b 1+o(1) where b = lg n; more precisely, time b exp(O(√ lg b lg lg b)); conjecturally, time b(lg b) O(1). The new algorithm takes time b(lg b) O(1). It relies on relatively complicated(More)
  • 1