Mathematics – Number Theory
Scientific paper
2000-10-29
Mathematics of Computation, 71:863--871, 2002
Mathematics
Number Theory
9 pages, to appear in Mathematics of Computation
Scientific paper
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.
No associations
LandOfFree
Comparison of algorithms to calculate quadratic irregularity of prime numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Comparison of algorithms to calculate quadratic irregularity of prime numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of algorithms to calculate quadratic irregularity of prime numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-579305