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