Congruence Classes in the Guassian Integers?

471 Views Asked by At

For some non-zero Gaussian integer n, how can I find a finite upper bound for the number of congruence classes mod n?

1

There are 1 best solutions below

1
On

If $n = a + bi$, then there will be $a^2 + b^2$ distinct residue classes. Proving this in the $\mathbb{Z}[i]$ case may be done with the Euclidean algorithm (and some work.) However, it is a general fact of number fields that the number of distinct residue classes is given by a norm function.