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...
Main Authors: | Booker, A, Hiary, G, Keating, J |
---|---|
Format: | Journal article |
Published: |
Duke University Press
2015
|
Similar Items
-
Squarefree polynomials and möbius values in short intervals and arithmetic progressions
by: Keating, JP, et al.
Published: (2016) -
Squarefrees are Gaussian in short intervals
by: Gorodetsky, O, et al.
Published: (2022) -
A construction of polynomials with squarefree discriminants
by: Kedlaya, Kiran S.
Published: (2013) -
Stanley depth of squarefree Veronese ideals
by: Cimpoeas Mircea
Published: (2013-11-01) -
The cones of Hilbert functions of squarefree modules
by: Cristina Bertone, et al.
Published: (2012-05-01)