View Single Post
Old 2009-04-23, 19:54   #4
Zeta-Flux
 
Zeta-Flux's Avatar
 
May 2003

2·761 Posts
Default

Here is a recent paper on a fast algorithm for testing for the largest k with N a kth power, and then finding N^(1/k). http://cr.yp.to/lineartime/powers2-20060914-ams.pdf Note: The paper discusses how this is the bottleneck in AKS.

Last fiddled with by Zeta-Flux on 2009-04-23 at 20:02 Reason: correcting a mistake
Zeta-Flux is offline   Reply With Quote