arXiv · 2202.12401
A deterministic algorithm for finding $r$-power divisors
Abstract
Building on work of Boneh, Durfee and Howgrave-Graham, we present a deterministic algorithm that provably finds all integers $p$ such that $p^r \mathrel| N$ in time $O(N^{1/4r+\epsilon})$ for any $\epsilon > 0$. For example, the algorithm can be used to test squarefreeness of $N$ in time $O(N^{1/8+\epsilon})$; previously, the best rigorous bound for this problem was $O(N^{1/6+\epsilon})$, achieved via the Pollard--Strassen method.
Explore related subjects
Keep this discovery
David Harvey, Markus Hittmeir. 2022-02-24. A deterministic algorithm for finding $r$-power divisors. https://doi.org/10.1007/s40993-022-00387-w
Cite the original work for its findings. Save a collection to share your selection of sources.