Algorithmic Number Theory

Symbolic and Algebraic Computation

Volume 358 of the series Lecture Notes in Computer Science pp 252-258

Date:

# 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

* Final gross prices may vary according to local VAT.

## 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.

In order to calculate the Gaussian probability, we use a theorem that enables us to factor the zeta function into a product of the Riemann zeta function and a Dirichlet series called an L-series. For the Gaussian integers we get: ζ G (2)=ζ(2)L(2,χ), where
$$L\left( {2,\chi } \right) = 1 - \frac{1}{{3^2 }} + \frac{1}{{5^2 }} - \frac{1}{{7^2 }} + \cdots .$$
We use this factorization to approximate the Gaussian probability to 17 decimal places.