Detecting squarefree numbers
Number Theory
2015-11-03 v2 Data Structures and Algorithms
Mathematical Physics
math.MP
Abstract
We present an algorithm, based on the explicit formula for -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.
Cite
@article{arxiv.1304.6937,
title = {Detecting squarefree numbers},
author = {Andrew R. Booker and Ghaith A. Hiary and Jon P. Keating},
journal= {arXiv preprint arXiv:1304.6937},
year = {2015}
}
Comments
31 pages, 3 figures, latest version