Detecting squarefree numbers
We present an algorithm, based on the explicit formula for L-functions and conditional on the generalized Riemann hypothesis, 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 pro...
| Auteurs principaux: | , , |
|---|---|
| Format: | Journal article |
| Publié: |
Duke University Press
2015
|