Year: 2024
Type: article
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.
Source: The Ramanujan Journal
Authors: Jonathon Hales, Ghaith Hiary
Institution: The Ohio State University
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,890
OpenAlex ID: W4403842282