arXiv · 1304.6937
Detecting squarefree numbers
Abstract
We present an algorithm, based on the explicit formula for $L$-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically and practically, and use it to prove that several RSA challenge numbers are not squarefull.
Explore related subjects
Keep this discovery
Andrew R. Booker, Ghaith A. Hiary, Jon P. Keating. 2013-04-25. Detecting squarefree numbers. https://doi.org/10.1215/00127094-2856619
Cite the original work for its findings. Save a collection to share your selection of sources.