
AbstractA 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.
algorithm, Mathematics - Number Theory, square-free numbers, integer factorization, FOS: Mathematics, 11Y05, 11Y16, Number Theory (math.NT), Factorization, Factorization; primality, rational approximation, Number-theoretic algorithms; complexity
algorithm, Mathematics - Number Theory, square-free numbers, integer factorization, FOS: Mathematics, 11Y05, 11Y16, Number Theory (math.NT), Factorization, Factorization; primality, rational approximation, Number-theoretic algorithms; complexity
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
