First-hit analysis of algorithms for computing quadratic irregularity

Details First-hit analysis of algorithms for computing quadratic irregularity First-hit analysis of algorithms for computing quadratic irregularity

2000-11-08

arxiv.org/abs/math/0011054v2

Mathematics of Computation, 73:939--948, 2004

Mathematics

Number Theory

9 pages, submitted to Mathematics of Computation; work-around for problem with AMS style files

Scientific paper

The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta function at odd negative integers, are evenly distributed modulo p for every p. This is the basis of a well-known heuristic given by Siegel for estimating the frequency of irregular primes. So far, analyses have shown that if Q(\sqrt{D}) is a real quadratic field, then the values of the zeta function \zeta_{D}(1-2m)=\zeta_{Q(\sqrt{D})}(1-2m) at negative odd integers are also distributed as expected modulo p for any p. We use this heuristic to predict the computational time required to find quadratic analogues of irregular primes with a given order of magnitude. We also discuss alternative ways of collecting large amounts of data to test the heuristic.

Affiliated with

Also associated with

No associations

Rating

First-hit analysis of algorithms for computing quadratic irregularity 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 First-hit analysis of algorithms for computing quadratic irregularity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and First-hit analysis of algorithms for computing quadratic irregularity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607964