Symbolic and Algebraic Computation
Volume 358 of the series Lecture Notes in Computer Science pp 252258
The probability of relative primality of Gaussian integers
 George E. CollinsAffiliated withDept. of Computer and Information Sciences, Ohio State University
 , Jeremy R. JohnsonAffiliated withDept. of Computer and Information Sciences, Ohio State University
Abstract
In this paper we generalize, to an arbitrary number field, the theorem which gives the probability that two integers are relatively prime. The probability that two integers are relatively prime is 1/ζ(2), where ζ is the Riemann zeta function and 1/ζ(2)=6/π ^{2}. The theorem for an arbitrary number field states that the probability that two ideals are relatively prime is the reciprocal of the zeta function of the number field evaluated at two. In particular, since the Gaussian integers are an unique factorization domain, we get the probability that two Gaussian integers are relatively prime is 1/ζ _{ G }(2) where ζ _{ G } is the zeta function associated with the Gaussian integers.
 Title
 The probability of relative primality of Gaussian integers
 Book Title
 Symbolic and Algebraic Computation
 Book Subtitle
 International Symposium ISSAC '88 Rome, Italy, July 4–8, 1988 Proceedings
 Pages
 pp 252258
 Copyright
 1989
 DOI
 10.1007/3540510842_23
 Print ISBN
 9783540510840
 Online ISBN
 9783540461531
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 358
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 eBook Packages
 Editors
 Authors

 George E. Collins ^{(1)}
 Jeremy R. Johnson ^{(1)}
 Author Affiliations

 1. Dept. of Computer and Information Sciences, Ohio State University, 43210, Columbus, OH
Continue reading...
To view the rest of this content please follow the download PDF link above.