首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Comparison of algorithms to calculate quadratic irregularity of prime numbers
Authors:Joshua Holden
Institution:Department of Mathematics and Statistics, University of Massachusetts at Amherst, Amherst, Massachusetts 01003
Abstract:

In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields $k_{0}$, using the values of the zeta function $\zeta_{k_{0}}$at negative integers as our ``higher Bernoulli numbers'. In the case where $k_{0}$ is a real quadratic field, Siegel presented two formulas for calculating these zeta-values: one using entirely elementary methods and one which is derived from the theory of modular forms. (The author would like to thank Henri Cohen for suggesting an analysis of the second formula.) We briefly discuss several algorithms based on these formulas and compare the running time involved in using them to determine the index of $k_{0}$-irregularity (more generally, ``quadratic irregularity') of a prime number.

Keywords:Bernoulli numbers  Bernoulli polynomials  irregular primes  zeta functions  quadratic extensions  cyclotomic extensions  class groups  cryptography
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号