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.

31 pages, 3 figures, latest version

Cited by in corpus (7)

• L-functions as distributions
• A deterministic algorithm for finding $r$-power divisors
• On the Sum of the Square of a Prime and a Square-Free Number
• Turing's method for the Selberg zeta-function
• Predicting root numbers with neural networks
• Reconstructing Test Labels from Noisy Loss Functions
• Elliptic curves of high rank and the Riemann zeta function on the one line