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...
主要な著者: | Booker, A, Hiary, G, Keating, J |
---|---|
フォーマット: | Journal article |
出版事項: |
Duke University Press
2015
|
類似資料
-
Squarefree polynomials and möbius values in short intervals and arithmetic progressions
著者:: Keating, JP, 等
出版事項: (2016) -
Squarefrees are Gaussian in short intervals
著者:: Gorodetsky, O, 等
出版事項: (2022) -
A construction of polynomials with squarefree discriminants
著者:: Kedlaya, Kiran S.
出版事項: (2013) -
Stanley depth of squarefree Veronese ideals
著者:: Cimpoeas Mircea
出版事項: (2013-11-01) -
The cones of Hilbert functions of squarefree modules
著者:: Cristina Bertone, 等
出版事項: (2012-05-01)