781hw7 - into non-unit elements. 2. Prove that Z [ i ] is a...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
18.781, Fall 2007 Problem Set 7 Due: FRIDAY, October 26 We are beginning a new section on algebraic number theory. Supporting discussion for this material can be found in Chapter 9 of NZM (though it is somewhat less focused than our in-class discussions). The text “A Classical Introduction to Modern Number Theory” by Ireland and Rosen is a good source for many of the results we’ll discuss, though there are many additional books on algebraic number theory in the library that may be of use. Throughout the following problems, ω will denote a complex cubic root of unity 1+ i 3 2 . Moreover, R will be used to denote the ring Z [ ω ]. 1. Show that 13 is not a prime in R by giving an explicit factorization
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: into non-unit elements. 2. Prove that Z [ i ] is a Euclidean domain (a ring with Euclidean algorithm) by exhibiting a function from Z [ i ] to the non-negative integers, and then mimicking the proof as done in class for R . 3. What are the units of Z [ i ]? (Prove your answer is correct). 4. Factor 2 into irreducible elements in Z [ i ] (or prove that it is, itself, irreducible i.e. not able to be non-trivially factored). 5. If R , show that must be congruent to one of 0,1, or -1 mod (1- ). 6. Show that if, in R , N ( ) 6 = 3 for a prime , then 1 , , and 2 are distinct in R/R . Conclude that 3 | N ( )-1....
View Full Document

This note was uploaded on 04/28/2009 for the course MATH 18.781 taught by Professor Brubaker during the Spring '09 term at MIT.

Ask a homework question - tutors are online