Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

share|improve this question
2  
Hint: Consider the norm! And notice that the Gausian norm is Euclidean! –  awllower May 7 '13 at 4:08
add comment

1 Answer

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.

share|improve this answer
    
Could you elaborate on how the Euclidean Algorithm could be used for this? Thanks. –  David James Ball May 11 '13 at 10:55
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.