Abstract
A new deterministic algorithm for finding square divisors, and finding r-power divisors in general, is presented. This algorithm is based on Lehman’s method for integer factorization and is straightforward to implement. While the theoretical complexity of the new algorithm is far from best known, the algorithm becomes especially effective if even a loose bound on a square divisor is known. Additionally, we answer a question by D. Harvey and M. Hittmeir on whether their recent deterministic algorithm for integer factorization can be adapted to finding r-power divisors.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call