Congruence in Quadratic Integers

Frillth
Messages
77
Reaction score
0

Homework Statement



For my number theory course, I'm supposed to come up with a definition of congruence in quadratic integers, and define the operations of addition, subtraction, and multiplication.

Homework Equations



None known.

The Attempt at a Solution



I honestly have no real idea how to even start this question. Could I please get some help?
 
Physics news on Phys.org
What makes you think it is any different from congruence in the integers?
 
I just don't quite grasp the concept. We've only been working with quadratic integers for about two days, and I'm just confused. For example, if we are doing mod i, would every quadratic integer be equal to 0 mod i?
 
Does i divide every quadratic integer? Yes: i is a unit un Z, that is it has a multiplicative inverse.

It is precisely the same as ordinary modulo arithmetic, and has nothing to do with the quadratic integers per se.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
8
Views
1K
Replies
2
Views
1K
Replies
5
Views
1K
Replies
13
Views
2K
Replies
6
Views
1K
Replies
8
Views
5K
Replies
4
Views
4K
Replies
12
Views
3K
Back
Top