Comment #5 on issue 1289 by smichr: Improvements to integer factorization http://code.google.com/p/sympy/issues/detail?id=1289
There is a nice paper on algorithms in linear time for finding if a number is a perfect power at http://cr.yp.to/papers/powers-ams.pdf. I implemented a tiny aspect of the work in modifying perfect_power: a decrease in the maximum prime to test if n is odd from log(n, 2) to log(n, 3). I suspect there are fruitful modifications that could be done with the above paper in hand. The algorithms are short and seem to be pretty straightforward.
-- You received this message because you are subscribed to the Google Groups "sympy-issues" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy-issues?hl=en.
