I need a way to compute the nth root of a long integer in Python.
I tried pow(m, 1.0/n), but it doesn\'t work:
pow(m, 1.0/n)
OverflowError: lo
Possibly for your curiosity:
http://en.wikipedia.org/wiki/Hensel_Lifting
This could be the technique that Maple would use to actually find the nth root of large numbers.
Pose the fact that x^n - 11968003.... = 0 mod p, and go from there...
x^n - 11968003.... = 0 mod p