Factoring in the Gaussian Integers

Firepanda
Messages
425
Reaction score
0
I need to factorise 70 into primes, how do I go about this?

So far I have 2,5,7 as primes in Z.

So I suppose I need to factorise these in Z?

2 = (1+i)(1-i)

How do I go around doing the other two, is it possible that they're primes in Z?

Edit:

I have a corollary where if p is a prime in Z, then p is a prime in Z if p = 3 mod 4

So 7 stays prime in Z.

Also I have that if the norms of elements in Z are congruent to 1 mod 4 and prime in Z, then the elements in Z are prime, so

5 = (2+1)(2-i) = 1 mod 4

so 70 = 7*(2+1)(2-i)*(1+i)(1-i)

Correct?

Thanks
 
Last edited:
Physics news on Phys.org
Yes, that's correct.
 
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...
Back
Top