1.2 Properties of Integers

Transcription

1 10 CHAPTER 1. PRELIMINARIES 1.2 Properties of Integers The Well Ordering Principle and the Division Algorithm We now focus on a special set, the integers, denoted Z, as this set plays an important role in abstract algebra. We begin with an important result we will use often, the Well Ordering Principle. We will state it as an axiom, as it cannot be proven using the usual properties of arithmetic. Axiom 23 (Well Ordering Principle) Every nonempty set of positive integers contains a smallest element. Example 24 S = {1, 3, 5, 7, 9} is a set of positive integers. Its smallest element is 1. Can we say the same about sets of positive real numbers? Next, we look at the concept of divisibility, an important concept in number theory. Definition 25 A nonzero integer t is a divisor of an integer s and we write t s (read " t divides s") if there exists an integer k such that s = kt. In this case, we also say that s is a multiple of t. When t is not a divisor of s, we write t s. Definition 26 A prime is a positive integer greater than 1 whose only positive divisors are 1 and itself. Example 27 The divisors of 8 are ±1, ±2, ±4 and ±8. Example 28 The divisors of 7 are ±1 and ±7. So, 7 is prime. Example 29 What are the divisors of 0? A fundamental property of the integers is the division algorithm. Its proof involves the Well Ordering Principle. We now state and prove this result which we will use often. Theorem 30 (Division Algorithm) Let a and b be integers with b > 0. Then, there exists unique integers q and r with the property that where 0 r < b Proof. First we prove existence, then uniqueness. a = bq + r (1.1) Existence. With a and b as given, consider the set S = {a bk k is an integer and a bk 0}. Either 0 S or 0 / S.

2 1.2. PROPERTIES OF INTEGERS 11 Case 1 0 S, then there exists an integer k, call it q, such that a qb = 0 or a = qb. hence, we have existence with q = a and r = 0. b Case 2 0 / S. We want to use the Well Ordering Principle. For this, we have to show S is a nonempty set of positive integers. Since a, b and k are integers, a bk is also an integer. Since a bk 0 and 0 / S, we know that a bk > 0. We need to show S. If a > 0 then a 0 b = a > 0 S. If a < 0, then a b (2a) = a (1 2b) > 0 S. By the Well Ordering Principle, S has a smallest member. Call q the value of k for which a bk is the smallest member of S and r = a bq. Then, r 0 and a = bq + r. We still need to prove r < b. We do a proof by contradiction. Suppose r b. Then a b (q + 1) = a bq b = r b 0. However, a b (q + 1) < a bq and a bq is the smallest member of S, so we can t have a b (q + 1) 0. Thus r < b. Uniqueness. We assume there are at least two integers satisfying the condition and we show they are equal. Suppose that there exist integers q and q and r and r such that a = bq + r and a = bq + r with 0 r < b and 0 r < b. Without loss of generality, we may assume r r. Then, bq + r = bq + r or b (q q) = r r. so b r r but 0 r r < r < b. So, we must have r r = 0 which also implies q q = 0. Remark 31 This is the division you have been doing since you were little. r is the remainder. If r = 0, then b a. Example 32 For a = 20 and b = 3, the algorithm gives 20 = Greatest Common Divisor, Relatively Prime Integers Definition 33 (Greatest Common Divisor) Let m and n be two nonzero integers. The greatest common divisor of m and n, denoted gcd (m, n), is defined to be the largest of all common divisors of m and n. Definition 34 (Relatively Prime) Two nonzero integers m and n are said to be relatively prime if gcd (m, n) = 1. There are different techniques to find gcd (a, b). We illustrate one known as the Euclidean algorithm. We begin with some remarks. Suppose we are given integers a and b, assume a b. Then, by the division algorithm, there exists unique integers q 1 and r 1, 0 r 1 < b such that a = bq 1 +r 1. Any integer dividing a and b will also divide b and r 1 (see problems) hence gcd (a, b) = gcd (b, r 1 ). We repeat the process with b and r 1. There exists unique integers q 2 and r 2, 0 r 2 < r 1 such that b = r 1 q 2 + r 2. As before, gcd (b, r 1 ) = gcd (r 1, r 2 ). We

3 12 CHAPTER 1. PRELIMINARIES repeat the process with r 1 and r 2 to obtain unique integers q 3 and r 3, 0 r 3 < r 2 such that r 1 = r 2 q 3 + r 3. As before gcd (r 1, r 2 ) = gcd (r 2, r 3 ). Continuing this way, we obtain a sequence of remainders r 1 > r 2 > r 3... where each r i 0. By the well ordering principle, this process has to stop and some r i must eventually be 0. We have gcd (a, b) = gcd (b, r 1 ) = gcd (r 1, r 2 ) =... = gcd (r i, 0) = r i See the problems for the last equality. Thus, gcd (a, b) is the last nonzero remainder arising from our repeated division. We illustrate this with an example. Example 35 Let s find gcd (100, 64). Thus gcd (100, 64) = = = = = = Remark 36 If a number is written as a product of prime factors, then finding the greatest common divisor is simply a matter of gathering the common prime factors which are common to both. More specifically, if a = p h1 1 ph2 2...phn n and b = p k1 1 pk2 2...pkn n where p i are primes, with the understanding that some of the k i or h i might be 0 (if the corresponding prime is not present) and if we define s i = min (h i, k i ) for each i = 1..n, then gcd (a, b) = p s1 1 ps2 2...psn n Example 37 Find gcd ( , ) gcd ( , ) = = 70 Theorem 38 For any nonzero integers a and b, there exists integers s and t such that gcd (a, b) = as + bt Moreover, gcd (a, b) is the smallest positive integer of the form as + bt. Proof. There are diff erent ways to prove the existence part. We outline them here. Method 1: Here, we only show that gcd (a, b) = as + bt. We use the Euclidean algorithm developed above. So, this is a constructive proof. It will show

4 1.2. PROPERTIES OF INTEGERS 13 us how to find s and t. Let us assume that the Euclidean algorithm gave us the following: a = bq 1 + r 1 b = r 1 q 2 + r 2 r 1 = r 2 q 3 + r 3. r i 3 = r i 2 q i 1 + r i 1 r i 2 = r i 1 q i + r i r i 1 = r i q i Thus gcd (a, b) = r i. But using r i 2 = r i 1 q i + r i, we can write r i = r i 2 r i 1 q i thus writing r i as a linear combination of r i 1 and r i 2.Using the previous equation, we can write r i 1 = r i 3 r i 2 q i 1 thus we can express r i as a linear combination of r i 2 and r i 3. Using all the equations in the Euclidean algorithm in reverse order, we can express r i as a linear combination of a and b. Method 2: This proof involves the division algorithm and the Well Ordering Principle. It is similar in some ways to the proof of the division algorithm. Here, we will prove everything stated in the theorem. But this proof is not constructive, it does not tell us how to find s and t. Consider the set S = {am + bn am + bn > 0 and m and n are integers}. Since a, b, m, n are all integers, am+bn is an integer. So, S is a set of positive integers. It is not empty because if am + bn < 0 then a ( m) + b ( n) > 0. Thus, by the Well Ordering Principle, S has a smallest member, say d = as+bt. We now prove that d = gcd (a, b). For this, we first prove that d is a divisor of both a and b and then that it is in fact, the largest common divisor. d is a divisor of both a and b. First, we establish d divides a. Using the division algorithm, we can write a = dq +r with 0 r < d. If we had r > 0, then r = a dq = a (as + bt) q = a asq btq = a (1 sq) + b ( tq) Thus we would have a (1 sq) + b ( tq) S contradicting d is the smallest member of S. Thus r = 0 hence a = dq or d a. We can carry a similar argument for d b. Hence, d is a common divisor to both a and b. d is the largest common divisor to both a and b. Suppose d is another common divisor to both a and b that is a = d h and b = d k.

5 14 CHAPTER 1. PRELIMINARIES Then, d = as + bt = d hs + d kt = d (hs + kt) so d is a divisor of d, hence d > d. Thus d is the greatest common divisor. There is an important corollary of this theorem, which we will often use. Remark 39 The proof shown in method 1: also gives a way to find what that combination is. Example 40 Find s and t such that gcd (100, 64) = 100s + 64t. Recall from above that gcd (100, 64) = 4. Using our computations above, we have 4 = = 28 3 ( ) = = 4 (64 36) 3 36 = = (100 64) Corollary 41 If a and b are relatively prime, then there exists integers s and t such that as + bt = 1. The next lemma is very important and often used. Lemma 42 (Euclid s Lemma) Let a and b be integers. If p is prime and p ab then p a or p b. Proof. It is enough to prove that if p a then we must have p b. So, suppose p ab and p a. Then a and p are relatively prime and therefore there exist integers s and t such that 1 = as + pt. Then, b = abs + bpt. Since p divides the right hand side, it must also divide b. This fact is used in particular when proving that p is irrational when p is prime. Prime numbers are extremely important when dealing with integers. They are their building blocks, as the next result shows. Theorem 43 (Fundamental Theorem of Arithmetic) Every integer greater than 1 is either prime or a product of primes. This product is unique, except for the order of the factors. Proof. We will prove this result later in the chapter. Example = Example =

6 1.2. PROPERTIES OF INTEGERS 15 We finish this section with the notion of least common multiple. Definition 46 (Least Common Multiple) The least common multiple of two nonzero integers is the smallest positive integer that is a multiple of both integers. It is denoted lcm (a, b). Remark 47 One way to compute lcm (a, b) is to factor a and b as a product of primes and gather all the primes with the highest power which appear. More specifically, if a = p h1 1 ph2 2...phn n and b = p k1 1 pk2 2...pkn n where p i are primes, with the understanding that some of the k i or h i might be 0 (if the corresponding prime is not present) and if we define m i = max (h i, k i ) for each i = 1..n, then lcm (a, b) = p m1 1 pm2 2...pmn n Example 48 Find lcm ( , ) lcm ( , ) = = Example 49 Find lcm (100, 64) First, write 100 = and 64 = 2 6. Therefore, lcm (100, 64) = = Modular Arithmetic Before we give a formal definition let us look at simple examples we all have done in the past, without being aware we were performing modular arithmetic. Loosely speaking, modular arithmetic is a system of arithmetic for integers, where integers wrap around after they reach a certain value, called the modulus. Example 50 Suppose your electricity was out for 27 hours and all your clocks are off by that amount. Assume you have analogue clocks. To reset your clocks, you could of course, advance them by 27 hours. But you know it would be a waste of time. After you would have advanced it 27 hours, you would be at the same place. Hence, it would have been enough to advance them by 3 hours. Mathematically, this amounts to noticing that 27 = Example 51 Suppose you need to know which day of the week will be 23 days from Wednesday. It is not necessary to count 23 days. Knowing that days repeat themselves every 7 days, and the fact that 23 = , we see it is enough to add 2 days to Wednesday and we get Friday. Thus, in both cases, the answer was obtained by finding the remainder of a division. We can now state a more formal definition Definition 52 Let a and n be integers. Suppose that when we perform the division algorithm we get a = nq +r where q is the quotient and r the remainder with 0 r < n. Then, we write: a mod n = r

7 16 CHAPTER 1. PRELIMINARIES we also write a r (mod n) and read "a is congruent to r mod n". We will use the latter notation in the very near future. Remark 53 In other words, a mod n = r a = nq + r for some integer q. Also, a mod n is the remainder of the division of a by n. Example mod 12 = 1 since 25 = Example mod 64 = 36 since 100 = Example mod 45 = 0 since 32 = Example 57 2 mod 15 = 13 since 2 = 15 ( 1) + 13 In other words, when doing modular arithmetic (mod n), the following happens. Suppose we start counting from 0. Until we reach n 1, it is the same as regular arithmetic. However, with modular arithmetic, mod n, when we reach n, we restart at 0. The table below illustrates this with n = 5. i i mod We see that i mod 5 (a mod n in general) is simply the remainder of the division by 5 (n in the general case). The same idea applies when we do modular arithmetic. We use normal arithmetic, then apply modular arithmetic to the result. With this in mind, we can define addition and multiplication modulo n as follows: Definition 58 (Addition modulo n) Let a and b be two integers. Addition modulo n is defined to be regular addition mod n that is (a + b) mod n. If a+b < n then (a + b) mod n = a + b. If a + b > n then (a + b) mod n is the remainder of the division of a + b by n. Definition 59 (multiplication modulo n) This is defined similarly. Let a and b be two integers. Multiplication modulo n is defined to be regular multiplication mod n that is (ab) mod n. If ab < n then (ab) mod n = ab. If ab > n then (ab) mod n is the remainder of the division of ab by n. Example 60 Suppose that n = 5. Then But (2 + 1) mod 5 = = 3 (3 + 4) mod 5 = 7 mod n = 2

8 1.2. PROPERTIES OF INTEGERS 17 Similarly (4 + 1) mod 5 = 5 mod 5 Example 61 Suppose that n = 7.Then, and = mod 7 = 6 mod 7 = mod 7 = 12 mod 7 = 5 Here are some properties of modular arithmetic. Proposition 62 Suppose that a, b, a, b are integers and n is a positive integer. Then, the following results are true: 1. If a mod n = a and b mod n = b then (a + b) mod n = (a + b ) mod n. 2. If a mod n = a and b mod n = b then (a b) mod n = (a b ) mod n. 3. If a mod n = a and b mod n = b then (ab) mod n = (a b ) mod n. 4. a mod n = b mod n n (a b) Proof. See problems Important things to Remember We list the important results students must know. These results come from the notes and the problems assigned. Well Ordering Principle. Division algorithm. If a and b are integers, b > 0, then there exist unique integers q and r with 0 r < b such that a = bq + r. If d = gcd (a, b) then there exists integers s and t such that d = sa + bt and the greatest common divisor of a and b is the smallest positive integer of this form. a and b are relatively prime if and only if there exist integers s and t such that 1 = as + bt. Fundamental theorem of arithmetic. p prime and p ab then p a or p b.

MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following

Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

Intermediate Math Circles March 7, 2012 Linear Diophantine Equations II Last week: How to find one solution to a linear Diophantine equation This week: How to find all solutions to a linear Diophantine

15 Prime and Composite Numbers Divides, Divisors, Factors, Multiples In section 13, we considered the division algorithm: If a and b are whole numbers with b 0 then there exist unique numbers q and r such

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

An Introductory Course in Elementary Number Theory Wissam Raji 2 Preface These notes serve as course notes for an undergraduate course in number theory. Most if not all universities worldwide offer introductory

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

0.1 Prime Factorization 0.1 OBJECTIVES 1. Find the factors of a natural number 2. Determine whether a number is prime, composite, or neither 3. Find the prime factorization for a number 4. Find the GCF

1.5 Greatest Common Factor and Least Common Multiple This chapter will conclude with two topics which will be used when working with fractions. Recall that factors of a number are numbers that divide into

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the

ON UNIQUE FACTORIZATION DOMAINS JIM COYKENDALL AND WILLIAM W. SMITH Abstract. In this paper we attempt to generalize the notion of unique factorization domain in the spirit of half-factorial domain. It

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

1 congruence mod k: a b (mod k) if and only if a b = nk for some integer n. Claim: For all integers a, b, c, d, j and k (j and k positive), if a b (mod k) and c d (mod k) and j k, then a + c b + d (mod

Public Key Cryptography: RSA and Lots of Number Theory Public vs. Private-Key Cryptography We have just discussed traditional symmetric cryptography: Uses a single key shared between sender and receiver

2.2 Factoring Whole Numbers 2.2 OBJECTIVES 1. Find the factors of a whole number 2. Find the prime factorization for any number 3. Find the greatest common factor (GCF) of two numbers 4. Find the GCF for

A Course on Number Theory Peter J. Cameron ii Preface These are the notes of the course MTH6128, Number Theory, which I taught at Queen Mary, University of London, in the spring semester of 2009. There

SECTION 3.6 The Real Zeros of a Polynomial Function 219 3.6 The Real Zeros of a Polynomial Function PREPARING FOR THIS SECTION Before getting started, review the following: Classification of Numbers (Appendix,

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Primes Name Period A Prime Number is a whole number whose only factors are 1 and itself. To find all of the prime numbers between 1 and 100, complete the following exercise: 1. Cross out 1 by Shading in

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

Lecture Notes for MA 132 Foundations D. Mond 1 Introduction Alongside the subject matter of this course is the overriding aim of introducing you to university mathematics. Mathematics is, above all, the

Prime Factorization, Greatest Common Factor (GCF), and Least Common Multiple (LCM) Definition of a Prime Number A prime number is a whole number greater than 1 AND can only be divided evenly by 1 and itself.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

Tallahassee Community College 13 PRIME NUMBERS AND FACTORING (Use your math book with this lab) I. Divisors and Factors of a Number Previously, you learned the names of the parts of a multiplication problem.

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in