Abstract

We present an algorithm for computing the class number of the quadratic number field of discriminant d. The algorithm terminates unconditionally with the correct answer and, under the GRH, executes in O ∈ (|d| 1/4+∈ ) steps. The technique used combines algebraic methods with Burgess' theorem on character sums to estimate L(1, X d ). We give an explicit version of Burgess' theorem valid for prime discriminants and, as an application, we compute the class number of a 32-digit discriminant.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.