# 1. Factorization Divisibility in Z.

Size: px
Start display at page:

Transcription

1 8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that b is a multiple of a. If a 0 this is equivalent to the statement that the rational number b/a is an integer c. If a does not divide b we write a b. Lemma [Easy facts about divisibility] For all a, b,... Z: (1) a b = a kb ( k Z); (2) a b 1, a b 2 = a b 1 ± b 2 ; hence if b 1 and b 2 are multiples of a, then so are all integers of the form k 1 b 1 + k 2 b 2. (3) a b, b c = a c; (4) a b, b a a = ±b; (5) a b, b 0 = a b ; so nonzero integers have only a finite number of divisors; (6) If k 0 then a b ka kb; (7) Special properties of ±1: ±1 a ( a Z), and a ± 1 a = ±1; (8) Special properties of 0: a 0 ( a Z), and 0 a a = 0. Proposition (Division Algorithm in Z). Let a, b Z with a 0. There exist unique integers q, r such that b = aq + r with 0 r < a.

2 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES Notation: the set of all multiples of a fixed integer a is denoted (a) or az: (a) = az = {ka k Z}. Then we have a b b (a) (a) (b): to contain is to divide. From Lemma 1.1.2(4) we have (a) = (b) a = ±b. An ideal in a commutative ring R is a subset I of R satisfying (i) 0 I; (ii) a, b I = a ± b I; (iii) a I, r R = ra I. Notation: I R. For example, the set of all multiples of a fixed element a of R is the principal ideal denoted (a) or ar. We say that a generates the principal ideal (a). The other generators of (a) are the associates of a: elements b = ua where u is a unit of R. Proposition Every ideal in Z is principal. Definition A Principal Ideal Domain or PID is a (nonzero) commutative ring R such that (i) ab = 0 a = 0 or b = 0; (ii) every ideal of R is principal. So Z is a principal ideal domain. Every nonzero ideal of Z has a unique positive generator Greatest Common Divisors in Z. Theorem Let a, b Z. (1) There exists a unique integer d satisfying (i) d a and d b;

3 10 J. E. CREMONA (ii) if c a and c b then c d; (iii) d 0. (2) The integer d can be expressed in the form d = au + bv with u, v Z. Definition For a, b Z we define the Greatest Common Divisor (or GCD) of a and b to be the integer d with the properties given in the theorem. Notation: gcd(a, b), or sometimes just (a, b). Integers a and b are said to be coprime (or relatively prime) if gcd(a, b) = 1. So integers are coprime if they have no common factors other than ±1. The identity gcd(a, b) = au + bv is sometimes called Bezout s identity. Corollary [Basic Properties of gcd] For all a, b, k, m Z: (1) a and b are coprime iff there exist u, v Z such that au + bv = 1; (2) gcd(a, b) = gcd(b, a) = gcd( a, b ); (3) gcd(ka, kb) = k gcd(a, b); (4) gcd(a, 0) = a ; gcd(a, 1) = 1; (5) gcd(a, b) = gcd(a, b + ka) for all k Z; (6) if gcd(a, m) = gcd(b, m) = 1 then gcd(ab, m) = 1; (7) if gcd(a, b) = 1 then gcd(a k, b l ) = 1 for all k, l N. Lemma [Euler s Lemma] If a bc and gcd(a, b) = 1 then a c. If a 1, a 2,..., a n is any finite sequence of integers then we similarly find that the ideal they generate, I = (a 1, a 1,..., a n ) = {k 1 a 1 + k 2 a k n a n k 1, k 2,..., k n Z} is an ideal of Z, hence I = (d) for a unique d 0, and we define d = gcd(a 1, a 2,..., a n ). We say that

4 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES a 1, a 2,..., a n are coprime if gcd(a 1, a 2,..., a n ) = 1. This is weaker than the condition that gcd(a i, a j ) = 1 for all i j: for example, gcd(6, 10, 15) = 1 since = 1, but no pair of 6, 10, 15 is coprime. When gcd(a i, a j ) = 1 for all i j, we say that the a i are pairwise coprime. Our proofs have been non-constructive. A very important computational tool is the Euclidean Algorithm, which computes d = gcd(a, b) given a and b Z, and its extended form which also computes the (non-unique) u, v such that d = au + bv The Euclidean Algorithm in Z. The Euclidean Algorithm is an efficient method of computing gcd(a, b) for any two integers a and b, without having to factorize them. It may also be used to compute the coefficients u and v in the identity d = gcd(a, b) = au + bv. The basic idea is this. We may assume b > a > 0 (see the Basic Properties above). Write r = b aq with 0 r < a; then gcd(a, b) = gcd(r, a) and we have reduced the problem to a smaller one. After a finite number of steps we reach 0, and the last positive integer in the sequence a, b, r,... is the gcd. Example: (963, 657) = (657, 963) = (306, 657) = (45, 306) = (36, 45) = (9, 36) = (0, 9) = 9. Here we have used = 306, = 45, = 36, = 9. To solve 9 = 963u+657v we can back-substitute in these equations: 9 = = 45 ( ) = = 7 ( ) 306 = = ( ) = , so u = 15 and v = 22. There is a simpler way of keeping track of all these coefficients while reducing the amount which needs to be written down, using some auxiliary variables, which leads to the Euclidean algorithm. We give it in a form which keeps all the auxiliary variables positive which is easier to carry out in practice.

5 12 J. E. CREMONA Extended Euclidean Algorithm: Given positive integers a and b, this algorithm computes (d, u, v) such that d = gcd(a, b) = au + bv: (1) Set a 1 = a, a 2 = b; x 1 = 1, x 2 = 0; y 1 = 0, y 2 = 1. (2) Let q = [a 1 /a 2 ]. (3) Set a 3 = a 1 qa 2 ; x 3 = x 1 + qx 2 ; y 3 = y 1 + qy 2. (4) Set a 1 = a 2, a 2 = a 3 ; x 1 = x 2, x 2 = x 3 ; y 1 = y 2, y 2 = y 3. (5) If a 2 > 0 loop back to Step 2. (6) If ax 1 by 1 > 0 return (d, u, v) = (a 1, x 1, y 1 ), else return (d, u, v) = (a 1, x 1, y 1 ). Example: In the previous example, the a i sequence is 963, 657, 306, 45, 36, 9, 0 using quotients q = 1, 2, 6, 1, 4. So the x i sequence is 1, 0, 1, 2, 13, 15, 73 and the y i sequence is 0, 1, 1, 3, 19, 22, 107. Using the last x i and y i provides a check: 73a 107b = = 0 and the preceding values give the solution: 15a 22b = = 9. So we may take u = 15, v = 22.

6 1.4. Primes and unique factorization. MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES Definition A prime number (or prime for short) is an integer p > 1 whose only divisors are ±1 and ±p; the set of primes is denoted P: p P p > 1 and p = ab = a = ±1 or b = ±1. For example 2, 3, 5, 7, 11 are primes. Integers n > 1 which are not prime are called composite. If a is any integer then either p a, in which case gcd(p, a) = p, or p a, in which case gcd(p, a) = 1. Lemma Let p be a prime and a, b Z. If p ab then either p a or p b (or both). This property of primes is very important, and the uniqueness of prime factorization relies on it. (It is easy to see that composite numbers do not have this property.) More generally: Corollary Let p be a prime and a 1, a 2,..., a n Z. Then p a 1 a 2... a n = p a i for some i. Theorem (Fundamental Theorem of Arithmetic). Every positive integer n is a product of prime numbers, and its factorization into primes is unique up to the order of the factors. Note that this includes n = 1 which is an empty product, and primes themselves with only one factor in the product. Collecting together any powers of primes which occur in a prime factorization, we obtain

7 14 J. E. CREMONA Corollary Every positive integer n may be expressed uniquely in the form n = p e 1 1 pe pe k k where p 1,..., p k are primes with p 1 < p 2 < < p k and each e i 1. Alternatively, every positive integer n may be expressed uniquely in the form n = p P p e p where the product is over all primes, each e p 0, but only a finite number of e p > 0. The exponent e p which appears in this standard factorization of n is denoted ord p (n); it is characterized by the following property: e = ord p (n) p e n and p e+1 n. For example, 700 = , so ord 2 (700) = ord 5 (700) = 2, ord 7 (700) = 1, and ord p (700) = 0 for primes p 2, 5, 7. Every positive integer n is uniquely determined by the sequence of exponents ord p (n). This standard factorization of positive integers into primes may be extended to negative integers by allowing a factor ±1 in front of the product, and to nonzero rational numbers by allowing the exponents to be negative. We may accordingly extend the function ord p to Q, by setting ord p ( n) = ord p (n) and ord p (n/d) = ord p (n) ord p (d) for nonzero rationals n/d. [You should check that this is well-defined, independent of the representation of the fraction n/d.] Then we have the following extension of the main theorem on unique factorization:

8 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES Corollary Every nonzero rational number x may be uniquely expressed in the form x = ± p P p ord p(x). For example, 72/91 = Many facts about integers may easily be proved using their unique factorization into primes. For example: Proposition Let m, n Z be nonzero. Then m = ±n ord p (m) = ord p (n) p P. The function ord p works rather like a logarithm. The following is easy to check: Proposition Let m, n Z be nonzero. Then ord p (mn) = ord p (m) + ord p (n). The previous result looks elementary enough, but it is sufficient to imply the uniqueness of prime factorization: for if n = p e p is any factorization of n in to primes, applying ord q to both sides (where q is some fixed prime) and using the Proposition gives ord q (n) = e p ord q (p) = e q, since ord q (q) = 1 and ord q (p) = 0 when p q. It follows that the exponents e p are uniquely determined.

9 16 J. E. CREMONA Proposition Let n Z be nonzero. Then n is a perfect square if and only if n > 0 and ord p (n) is even for all primes p. We end this section with a famous and ancient result of Euclid. Theorem [Euclid] The number of primes is infinite. Note that this proof actually shows how to construct a new prime from any given finite set of known primes. Variations of this proof can show that there are infinitely many primes of various special forms: see the Exercises Unique Factorization Domains. Theorem (extended to include negative integers) may be expressed succinctly by the statement that Z is a Unique Factorization Domain or UFD. Roughly speaking, a UFD is a ring in which every element has an essentially unique factorization as a unit times a product of prime elements. Every PID is a UFD (but not conversely: Z[X] is a UFD but not a PID), and an important source of PIDs is rings which have a division algorithm similar to the one for Z. Such rings are called Euclidean Domains, and we start by defining these. Definition (a) A nonzero ring R is an Integral Domain if, for a, b R, ab = 0 (a = 0 or b = 0). (b) A nonzero ring R is a Euclidean Domain or ED if it is an integral domain equipped with a function λ : R {0} N 0 such that, for a, b R with a 0, there exist q, r R such that b = aq + r with either r = 0 or λ(r) < λ(a).

10 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES Examples: Z is an ED with λ(n) = n : this is what Proposition states (though note that the definition of an ED does not require q and r to be unique). Any field F is an ED with λ(x) = 0 for all x 0; this is a degenerate example since we may always take r = 0 in division. If F is a field then the polynomial ring F [X] is an ED, using the degree function λ(f(x)) = deg(f(x)). The required division property is well-known, being just the usual long division for polynomials. It is important that F is a field here: for example, Z[X] is not Euclidean (exercise). The ring Z[i] of Gaussian Integers is defined as Z[i] = {a + bi a, b Z}; it is a subring of C. We will study this in some detail as it gives another example of a Euclidean Domain which is of interest in number theory, both for its own sake and also for proving some properties of the ordinary or rational integers Z. The Euclidean function λ on Z[i] is usually called the norm and denoted N: N(α) = αα = a 2 + b 2 for α = a + bi Z[i]. Theorem The ring Z[i] of Gaussian Integers is a Euclidean Domain. Lemma The norm function N on Z[i] has the following properties: (1) Multiplicativity: for all α, β Z[i], N(αβ) = N(α)N(β);

11 18 J. E. CREMONA (2) Positivity: N(0) = 0, N(α) 1 for α 0; (3) Units: N(α) = 1 α U(Z[i]) = {±1, ±i}. Recall that for a ring R, the group of units (invertible elements) is denoted U(R). Elements of an integral domain are called associate if one is a unit times the other, or (equivalently) if each divides the other. Example: Take α = 3 + 4i and β = i. Then i ( i)(3 4i) 74 7i 1 7i = = = 3 +, 3 + 4i so the quotient is 3 and remainder ( i) 3(3 + 4i) = 1 i. Check: N(1 i) = 2 is less than N(3 + 4i) = 25. Just as we did for Z, we can now prove that every ED is a PID: Theorem Let R be a Euclidean Domain. Then R is a Principal Ideal Domain. In a PID we have gcds just as in Z, and Bezout s identity. In general we do not have uniqueness of gcds, only uniqueness up to associates (multiplication by a unit). (In Z we avoided this nonuniqueness by insisting that all gcds were non-negative.) Definition In a ring R, a gcd of two elements a and b is an element d satisfying (i) d a and d b; (ii) if c a and c b then c d. Lemma If gcd(a, b) exists then it is unique up to associates.

12 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES Because of this non-uniqueness we cannot talk about the gcd, only a gcd of a and b. In specific rings, one may impose an extra condition to ensure uniqueness: in Z we insisted that gcd(a, b) 0; in the polynomial ring F [X] (with F a field) one usually insists that gcd(a(x), b(x)) is monic (with leading coefficient 1). Proposition In a PID, the gcd of two elements a and b exists, and may be expressed in the form au + bv. So in a PID, whether Euclidean or not, the gcd always exists. However, it is only in a ED that computing gcds is easily possible via the Euclidean Algorithm. Example: Take α = 3 + 4i and β = i. Then from the previous example we have β 3α = 1 i. Similarly, α 3i(1 i) = i, and lastly 1 i = i( 1 i) with zero remainder. The last nonzero remainder was i which is therefore a gcd of α and β; one would normally adjust this since i is a unit and say that gcd(α, β) = 1. Back-substitution gives i = α 3i(β 3α) = (1+9i)α 3iβ, so finally 1 = (9 i)α 3β. The next step is to show that every PID is also a unique factorization domain. In the case of Z, we used the Euclidean property again, and not just the PID property, for this step, but since there are rings which are PIDs but not Euclidean we give a proof which works for all PIDs. Definition In an integral domain R, an element p is called irreducible if it is neither 0 nor a unit and p = ab implies that either a or b is a unit; p is called prime if it is neither 0 nor a unit and p ab implies that either p a or p b. Lemma Every prime is irreducible. In a PID, every irreducible is prime.

13 20 J. E. CREMONA The last property will be crucial in proving the uniqueness of factorizations into irreducibles, but for the existence we need to do some more preparation. The following lemma is called the ascending chain condition or ACC for ideals in a PID. Lemma Let R be a PID. Let (a i ) i N be a sequence of elements of R with (a 1 ) (a 2 ) (a 3 ).... (So each a i is a multiple of the next). Then there exists k such that (a k ) = (a k+1 ) = (a k+2 ) =..., so the chain of ideals stabilizes. Hence any strictly ascending chain of ideals (a 1 ) (a 2 ) (a 3 )... must be finite. This lemma is used to replace induction in the proof of the existence of factorizations into irreducibles, which was used for Z. Proposition Let R be a PID. Every element of R which is neither 0 nor a unit is a product of irreducibles. Finally, we use the fact that in a PID irreducibles are prime to prove that the factorizations of any given nonzero non-unit are essentially the same, up to reordering the factors and replacing irreducibles by associates. Definition An Integral Domain R is a Unique Factorization Domain or UFD if (i) every nonzero element may be expressed as a unit times a product of irreducibles; (ii) the factorization in (i) is unique up to the order of the factors and replacing the irreducibles by associates; that is, if a R is nonzero and a = up 1 p 2... p r = vq 1 q 2... q s

14 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES with u, v units and all p i, q j irreducibles, then r = s, and after permuting the q j if necessary, there are units v j for 1 j r such that q j = v j p j and u = vv 1 v 2... v r. Theorem Let R be a PID. Then R is a UFD. Example (continued): Since the ring Z[i] of Gaussian Integers is Euclidean, it is a PID and a UFD. We have already determined that its units are the four elements ±1 and ±i, but what are its primes/irreducibles? (1) If π Z[i] is prime then π divides some ordinary rational prime p, since if n = N(π) = ππ then π n so by primality of π, π divides at least one prime factor p of n. (2) If N(π) = p is prime, then π is irreducible: for if π = αβ then p = N(π) = N(α)N(β), so one of α, β has norm 1 and is a unit. For example, 1 + i, 2 + i, 3 + 2i, 4 + i are prime since their norms are 2, 5, 13, 17. (3) If a rational prime p is a sum of two squares, p = a 2 + b 2, then setting π = a + bi gives p = N(π) = N(π), so π and π are both Gaussian primes. We will prove later, in Theorem 2.4.2, that every rational prime p of the form 4k + 1 can be expressed in this way; the factors π and π are not associate (exercise). (4) However, rational primes q of the form 4k + 3 can not be expressed as sums of two squares, since squares all leave remainder of 0 or 1 when divided by 4, so all numbers of the form a 2 + b 2 leave a remainder of 0, 1 or 2 on division by 4. Such primes q remain prime in Z[i]. For if q = αβ with neither α nor β a unit, then q 2 = N(α)N(β) with both N(α), N(β) > 1, so (by unique factorization in Z) we must have N(α) = N(β) = q, so q would be a sum of two squares.

15 22 J. E. CREMONA We sum up this example as follows; we have proved everything stated here except for the fact that all primes of the form 4k + 1 are sums of two squares (Theorem 2.4.2), and the remark about associates (exercise). Theorem The ring Z[i] of Gaussian Integers is a Euclidean Domain and hence also a Principal Ideal Domain and a Unique Factorization Domain. Its units are the four elements ±1, ±i. Its primes are as follows (together with their associates): (1) 1 + i, of norm 2; (2) each rational prime p of the form 4k + 1 is a sum of two squares, p = a 2 + b 2, and p factorizes in Z[i] as p = ππ where π = a + bi and π = a bi are non-associate Gaussian primes of norm p; (3) each rational prime q of the form 4k + 3 is also a Gaussian prime. For example, here are some Gaussian factorizations: i = 3 (1 + 2i) ( i) (the last factor has prime norm 4957), 2000 = (1 + i) 8 (1 + 2i) 3 (1 2i) 3. sage : Qi.< i > = QQ. e x t e n s i o n ( xˆ2+1) sage : f a c t o r ( ) sage : Qi ( ). f a c t o r ( ) ( i ) (15 i 28) ( i + 1)ˆ2 (15 i + 28) sage : ( i ). norm ( ). f a c t o r ( ) 3ˆ sage : ( i ). f a c t o r ( ) ( 1) ( 14 i 69) (2 i + 1) 3

16 MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES There are other number rings similar to Z[i], but not many which are known to have unique factorization. A complete study requires more algebra, and is done in Algebraic Number Theory. Here are some further examples. Example: The ring R = Z[ 2] is also Euclidean and hence a UFD. The proof is almost identical to the one given above for Z[i], using the norm N(α) = αα, so that N(a + b 2) = a 2 + 2b 2. The key fact which makes R Euclidean via the norm is that every point in the complex plane is at distance less than 1 from the nearest element of R, as was the case with Z[i]. Factorization of primes p now depends on p (mod 8). Example: The ring R = Z[ 3] is not Euclidean, and neither a PID nor a UFD. For example, 4 = 2 2 = (1 + 3) (1 3) with all factors on the right irreducible in R. Also: the ideal (2, 1 + 3) is not principal; and the element 2 is irreducible but not prime (as the previous equation shows, since neither 1 ± 3 are divisible by 2 in R). However, if we enlarge the ring by including numbers of the form (a+b 3)/2 where a and b are both odd, we obtain the larger ring S = Z[ω], where ω = ( 1 + 3)/2, satisfying ω 2 + ω + 1 = 0, which is Euclidean and hence a UFD. The norm is again N(α) = αα; with α = a + bω one computes that N(α) = a 2 ab + b 2, and 4N(α) = (2a b) 2 + 3b 2. This ring turns out to be useful in the solution of the Fermat equation x 3 + y 3 = z 3. Example: As in the previous example, the ring Z[ 19] is not Euclidean. Enlarging it to R = Z[ω], where now ω = ( )/2, satisfying w 2 + w + 5 = 0, we find a ring which is still not Euclidean, but is a PID and hence a UFD. This example shows that not every PID is Euclidean. We omit the details.

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common

### Chapter 14: Divisibility and factorization

Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter

### Lecture 7.5: Euclidean domains and algebraic integers

Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley

### Math 547, Exam 2 Information.

Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

### Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going

### Example: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)

Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative

### CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

### 1 Overview and revision

MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

### Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:

Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:

### Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

### 2. THE EUCLIDEAN ALGORITHM More ring essentials

2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there

### Solving Diophantine Equations With Unique Factorization

Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions

### Math 412: Number Theory Lecture 26 Gaussian Integers II

Math 412: Number Theory Lecture 26 Gaussian Integers II Gexin Yu gyu@wm.edu College of William and Mary Let i = 1. Complex numbers of the form a + bi with a, b Z are called Gaussian integers. Let z = a

### 2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

### Part IX. Factorization

IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect

### Basic elements of number theory

Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation

### Basic elements of number theory

Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a

### LECTURE NOTES IN CRYPTOGRAPHY

1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

### 4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

### Lecture 7.4: Divisibility and factorization

Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

### ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary

### Gaussian integers. 1 = a 2 + b 2 = c 2 + d 2.

Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d

### 6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree

Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S

### Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains

Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and

### THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION ADVANCED ALGEBRA I.

THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION 2006 110.401 - ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.

### 1. multiplication is commutative and associative;

Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.

### OSTROWSKI S THEOREM FOR Q(i)

OSTROWSKI S THEOREM FOR Q(i) KEITH CONRAD We will extend Ostrowki s theorem from Q to the quadratic field Q(i). On Q, every nonarchimedean absolute value is equivalent to the p-adic absolute value for

### Finite Fields. Mike Reiter

1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements

### School of Mathematics

School of Mathematics Programmes in the School of Mathematics Programmes including Mathematics Final Examination Final Examination 06 22498 MSM3P05 Level H Number Theory 06 16214 MSM4P05 Level M Number

### RINGS: SUMMARY OF MATERIAL

RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered

### Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)

### Number Theory and Group Theoryfor Public-Key Cryptography

Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography

### 5: The Integers (An introduction to Number Theory)

c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset

### a + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:

5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.

### Olympiad Number Theory Through Challenging Problems

Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents

### Homework 6 Solution. Math 113 Summer 2016.

Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x

### However another possibility is

19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b

### Modern Algebra Lecture Notes: Rings and fields set 6, revision 2

Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in

### Introduction to Algebraic Number Theory Part I

Introduction to Algebraic Number Theory Part I A. S. Mosunov University of Waterloo Math Circles November 7th, 2018 Goals Explore the area of mathematics called Algebraic Number Theory. Specifically, we

### EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)

Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

### Math 210B: Algebra, Homework 1

Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many non-associate irreducible polynomials. Recall that by Homework 9, Exercise 8 of

### INTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.

INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b

### NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

### Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)

### MTH310 EXAM 2 REVIEW

MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not

### Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures

Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?......................

### 1. Fermat, Euler, and Nonunique Factorization

1. Fermat, Euler, and Nonunique Factorization The purpose of this chapter is mainly motivational. More precise definitions of the objects we will study will be given later. 1.1 Euler and Quadratic Irrationals

### MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

### 18. Cyclotomic polynomials II

18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients

### Coding Theory ( Mathematical Background I)

N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures

### Computations/Applications

Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x

### Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary

### Divisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.

Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3

### NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,

### Chapter 5: The Integers

c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

### CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 8 February 1, 2012 CPSC 467b, Lecture 8 1/42 Number Theory Needed for RSA Z n : The integers mod n Modular arithmetic GCD Relatively

### x 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0

1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials

### A SURVEY OF PRIMALITY TESTS

A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic

### Continuing the pre/review of the simple (!?) case...

Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m

### 32 Divisibility Theory in Integral Domains

3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible

### Factorization in Domains

Last Time Chain Conditions and s Uniqueness of s The Division Algorithm Revisited in Domains Ryan C. Trinity University Modern Algebra II Last Time Chain Conditions and s Uniqueness of s The Division Algorithm

### Applied Cryptography and Computer Security CSE 664 Spring 2017

Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric

### Euclidean Domains. Kevin James

Suppose that R is an integral domain. Any function N : R N {0} with N(0) = 0 is a norm. If N(a) > 0, a R \ {0 R }, then N is called a positive norm. Suppose that R is an integral domain. Any function N

### Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:

Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1

### FACTORING IN QUADRATIC FIELDS. 1. Introduction

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also

### FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH In these notes, we prove Fermat s Last Theorem for n = 3.

FERMAT S LAST THEOREM FOR n = 3, NOTES FOR MATH 40520 SAM EVENS In these notes, we prove Fermat s Last Theorem for n = 3. 1 Recall that Z[ω] = {a+bω : a, b Z} has a Euclidean algorithm and is norm integral.

### Eighth Homework Solutions

Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely

### Math 547, Exam 1 Information.

Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

### Selected Math 553 Homework Solutions

Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that

### Basic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series

Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony

### THUE S LEMMA AND IDONEAL QUADRATIC FORMS

THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Introduction Recently I learned about Thue s Lemma, an elementary result on congruences due to the Norwegian mathematician Axel Thue (1863-1922).

### ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

### (January 14, 2009) q n 1 q d 1. D = q n = q + d

(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)

### Chapter 2. Divisibility. 2.1 Common Divisors

Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition

### CPSC 467: Cryptography and Computer Security

CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 9 September 30, 2015 CPSC 467, Lecture 9 1/47 Fast Exponentiation Algorithms Number Theory Needed for RSA Elementary Number Theory

### Rings. Chapter Homomorphisms and ideals

Chapter 2 Rings This chapter should be at least in part a review of stuff you ve seen before. Roughly it is covered in Rotman chapter 3 and sections 6.1 and 6.2. You should *know* well all the material

### 2 Elementary number theory

2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},

### Rings and modular arithmetic

Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to

### MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

### Chapter 4 Finite Fields

Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number

### Factorization in Integral Domains II

Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and

### QUADRATIC RINGS PETE L. CLARK

QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,

### A few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in

A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough

### Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

### Modular Arithmetic and Elementary Algebra

18.310 lecture notes September 2, 2013 Modular Arithmetic and Elementary Algebra Lecturer: Michel Goemans These notes cover basic notions in algebra which will be needed for discussing several topics of

### Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence

### Beautiful Mathematics

Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a

### Lecture Notes for Math 492 Fall 2014 (Algebraic Number Theory)

Lecture Notes for Math 49 Fall 014 (Algebraic Number Theory) 1. Outline: Properties of the integers through unique factorization. The division algorithm and Euclid s algorithm. Greatest common divisor,

### Ch 4.2 Divisibility Properties

Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:

### Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

### LeLing13: Polynomials and complex numbers. Division of polynomials. Euclides s algorithm and multiple roots. R ecommended exercises: Geoling 15.

LeLing13: Polynomials and complex numbers. C ontents: Polynomials and non-polynomial expressions. The roots of x + 1 = 0: the complex numbers. The inverse 1 and the conjugate. z Roots of polynomials. Conjugate

Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,

### Lecture 4: Number theory

Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of

### THUE S LEMMA AND IDONEAL QUADRATIC FORMS

THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Abstract. The representation of integers by binary quadratic forms is one of the oldest problems in number theory, going back at least to Fermat s

### + 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4

Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number

### Some Facts from Number Theory

Computer Science 52 Some Facts from Number Theory Fall Semester, 2014 These notes are adapted from a document that was prepared for a different course several years ago. They may be helpful as a summary

### g(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.

6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral