Greatest common divisors


 Jewel Wright
 11 months ago
 Views:
Transcription
1 Greatest common divisors Robert Friedman Long division Does 5 divide 34? It is easy to see that the answer is no, for many different reasons: does not end in a 0 or Checking directly by hand, 34 is not equal to a multiple 5n for n 6, and for n 7, 7n > The prime factorization of 34 = 2 17 does not involve a 5. On the other hand, we can also write 34 = , so in another sense 5 does divide 34. It depends on what we mean by divides. Given integers a, n, we say that a divides n, written a n, if there exists an integer q such that n = aq. In this case, we say that a is a factor of n. For example, every integer divides 0, and the only integers which divide 1 are ±1. We can make the same definition for rational numbers, but it is not very interesting: every rational number divides every other rational number (except that 0 does not divide a nonzero rational number). For the record, let us give some notation for the various kinds of numbers: 1. N is the set of natural numbers {1, 2, 3,... }. With this definition, 0 / N, and the set {0, 1, 2, 3,... } is the set of nonnegative integers. 2. Z is the set of integers {..., 2, 1, 0, 1, 2... }. 3. Q is the set of rational numbers {a/b, a, b Z, b 0}. 4. R is the set of real numbers, which we will not attempt to define here, and C is the set of complex numbers. In Q, R, and C we can divide by every nonzero number, so the property that one number divides another is not very interesting. We will look at 1
2 divisibility in Z here; divisibility in N is much the same, but it will be a lot easier for us if we are able to subtract as well as add. When we consider numbers and divisibility we will need the following: we have operations of addition and multiplication, which satisfy the usual properties: addition and multiplication are associative and commutative, there is an additive identity 0 and additive inverses, multiplication distributes over addition, and there is a multiplicative identity 1. As mentioned above, the cases where there are multiplicative inverses for every nonzero number (Q, R, and C) are not interesting. In fact, in Z, the only numbers with multiplicative inverses are ±1. As a substitute for division, however, we do have the cancellation law: if ab = ac and a 0, then b = c. Of course this would follow if we could multiply both sides by a 1. There is at least one other familiar case where it is interesting to look at divisibility and factorization: polynomials. For example, x 1 does not divide f(x) = x 3 2x 2 + 3x + 4, which we can see as follows: the linear polynomial x 1 divides f(x) if and only if f(1) = 0, but f(1) = 6 0. On the other hand, for g(x) = x 3 2x 2 + 3x 2, g(1) = 0, and indeed g(x) = (x 1)(x 2 x + 2). We will also write a(x) f(x) to mean that the polynomial a(x) divides f(x), i.e. that there exists a polynomial q(x) with f(x) = a(x)q(x). As we shall see in just a moment, this definition depends on the context. As a matter of notation, we will denote by Z[x] the set of all polynomials with coefficients in Z (integer coefficients) and by Q[x] the set of all polynomials with coefficients in Q (rational coefficients). The sets R[x], C[x], etc. are defined in a similar way. Addition and multiplication are defined in the usual way. There is also Q[x, y], the set of polynomials in two variables x and y, with all of the possible variations by allowing different coefficients. We now ask if 2x 2 = 2(x 1) divides x 3 2x 2 + 3x 2. Answer: it depends. Clearly, since 2x 2 = 2(x 1), x 3 2x 2 + 3x 2 = (x 1)(x 2 x + 2) = (2x 2)( 1 2 x2 1 2 x + 1). So if we work in Q[x], 2x 2 divides x 3 2x 2 + 3x 2, but 2x 2 does not divide x 3 2x 2 + 3x 2 in Z[x]. We return to divisibility for ordinary integers. The basic fact is the following: Theorem 1 (Long division with remainder). Suppose that a, n Z with a > 0. Then there exist unique integers q, r with 0 r < a such that n = aq + r. 2
3 Here, q is the quotient and r is the remainder. Why is this statement true? We must use some basic fact about the integers, or in this case the natural numbers. The fact in question is important enough to have a special name: Theorem 2 (Well ordering principle). A nonempty subset of N has a smallest element. We will not attempt to give a proof of the wellordering principle here; it is closely related to an axiomatic characterization of the natural numbers. It can be paraphrased by saying that there are only finitely many natural numbers less than or equal to a given natural number N. It is also closely connected to the principle of mathematical induction. It is easy to see that the wellordering principle also holds for the set of nonnegative integers: if X is a nonempty subset of the set of nonnegative integers, then either 0 X, in which case 0 is the smallest element of X, of 0 / X, in which case X N and X is nonempty, so that X has a smallest element by the wellordering principle. On the other hand, the wellordering principle fails for the set of all integers Z, since for example Z itself does not have a smallest element. It also fails for the set of all nonnegative rational numbers, since for example the set Q + of all positive rational numbers does not have a smallest element (there is no smallest strictly positive rational number). Assuming the wellordering principle (Theorem 2), let us deduce the statement about long division. Consider the set X of all nonnegative integers of the form n aq for some q Z. In other words, we look at all integers q such that n aq > 0. Note that X is not empty. For example, if n is positive, then n = n a(0) X. If n 0, we could take q = (n 1), so that n aq = (1 a)n + a. Since n 0 and a 1, so that 1 a 0, (1 a)n 0 and so n aq = (1 a)n + a a > 0. By the wellordering principle, X has a smallest element, necessarily of the form r = n aq. Moreover, we claim that 0 r < a. Clearly, r 0 since by assumption r is a nonnegative integer. If r a, then r a 0. But then r a = n (a + 1)q is a nonnegative integer in X, and it is clearly smaller than r. This contradicts the fact that r is the smallest element of X. Thus we take r = n aq, with 0 r < a and n = aq + r as desired. We still need to check that q and r are unique. If also n = aq 1 + r 1 with 0 r 1 < a, then since n = aq + r = aq 1 + r 1, a(q q 1 ) = r 1 r. 3
4 In particular a divides r 1 r. But r 1 < a, r 0 so that r 1 r < a. Likewise r 1 0, r < a implies that r 1 r > a. Thus a r 1 r, a < r 1 r < a, and the only multiple of a strictly between a and a is 0. So r 1 r = 0 and r = r 1. Hence a(q q 1 ) = 0 and a > 0, so q q 1 = 0 and thus q = q 1. This shows that q and r are unique. This finishes the proof. In the exercises, you are asked to make the very minor changes in the statement and proof of Theorem 1 in case a < 0. Long division holds in other circumstances as well. For example, long division of polynomials should be familiar. Here we use the degree of a polynomial as a rough measure of its size. Given f(x) and a(x) in Q[x] with a(x) 0, there exist unique polynomials q(x) and r(x) in Q[x] with either r(x) = 0 (in which case deg r(x) is undefined), or 0 deg r(x) < deg a(x), such that f(x) = a(x)q(x) + r(x). However, long division definitely fails in Z[x] or in Q[x, y]. For example, you cannot divide 2x 2 into x 3 2x 2 +3x 2 in the above sense and keep all of the coefficients integers. (Long division by a(x) does work in Z[x] as long as the leading coefficient of a(x) is 1, though.) Greatest common divisors Definition 3. Let a, b Z, where not both of a, b are zero. A greatest common divisor d of aand b (written d = gcd(a, b)) is a positive integer d such that d a, d b, (i.e. d is a common divisor of a and b), and moreover, if e is an integer such that e a and e b, then e d. In other words, d is divisible by every common divisor of a and b. Two integers a and b are relatively prime if gcd(a, b) = 1, i.e. if e a and e b then e = 1, or equivalently the only factors a and b have in common are ±1. If d and d 1 are two greatest common divisors of a and b, then d d 1 and d 1 d, and then it is easy to see that d = d 1. Thus greatest common divisors are unique, if they exist. But nothing we have said up to this point indicates that greatest common divisors do exist. That is the point of the next theorem. Theorem 4 (Existence of gcds). Let a, b Z, where not both of a and b are zero. Then there exists a unique gcd d of a and b. Moreover, there exist integers x 0, y 0 such that d = ax 0 + by 0. To see this, let Y = {ax + by : x, y Z}. In other words, Y is the set of all integers which are a multiple of a plus a multiple of b; we call such an expression a linear combination of a and b. For example, a = a(1)+b(0) Y, 4
5 as is a = a( 1) + b(0); likewise b and b are in Y. Other elements of Y are a + b, 5a 28b, and so on. The key properties of Y are: (i) Y is closed under addition and subtraction: if ax 1 + by 1 and ax 2 + by 2 are two elements of Y, then (ax 1 + by 1 ) ± (ax 2 + by 2 ) = a(x 1 ± x 2 ) + b(y 1 ± y 2 ), and this is of the form a times an integer plus b times an integer and hence is in Y. (ii) Y is closed under multiplication by an arbitrary integer: if ax + by Y and n Z, then n(ax + by) = a(nx) + b(ny), and, again, this is of the form a times an integer plus b times an integer and hence is in Y. Now Y contains at least one positive integer, since at least one of a, b is nonzero and hence at least one of a, a, b, b is positive. Thus, by the wellordering principle, Y contains a smallest positive element, say d. So d > 0, and since d Y, d is of the form ax 0 + by 0 for some integers x 0, y 0. We claim that every element of Y is a multiple of d. To see this, let n Y. Applying long division by d, n = dq + r, where r is an integer and 0 r < d. By assumption, n Y. Since d Y, dq Y as well (by (ii) above) and thus n dq = r Y since Y is closed under subtraction (by (i)). But 0 r < d and d was chosen to be the smallest positive element of Y. This is only possible if r = 0. But then n = dq is a multiple of d. We have thus showed that every element n of Y is a multiple of d. We now show that d is a gcd of a and b. Since a and b are in Y, they are multiples of d, hence d a and d b. On the other hand, d = ax 0 + by 0. If e a and e b, then it is easy to see (exercise) that e ax 0 + by 0 = d. So d is a gcd (necessarily unique) of a and b. This finishes the proof of the theorem. Remark 5. 1) The last part of the proof actually shows that, if d = ax 0 +by 0 is a linear combination of a and b with d > 0, and d a and d b, then d = gcd(a, b). 2) A slightly more careful argument shows the following: let I be a nonempty subset of Z which is closed under addition and subtraction, i.e. Property (i) for Y above holds. Then one can check directly that (ii) also holds, and that there exists some integer d 0 such that I is the set of all integer multiples of d. 5
6 Now that we know that gcds exist, we would like to be able to compute them. One standard method is to factor both a and b into primes, and then prime factors of d = gcd(a, b) are the primes appearing in both the prime factorization of a and of b, raised to the smaller power. For example, gcd(40, 100) = 20, from 40 = 2 3 5, 100 = , and so the gcd is In practice, this procedure is very inefficient, because it is a hard problem for a human or computer to factor a large number into a product of primes. We shall describe a much more efficient method at the end. Let us give some consequences of the existence of gcds: Corollary 6. Suppose that a and b are integers, not both zero, and n is an integer. Then the linear equation ax + by = n has a solution in integers x and y if and only if d = gcd(a, b) divides n. To see this, suppose first that d = gcd(a, b) divides n, and let n = dk for some integer k. Then by the theorem we can write d = ax 0 + by 0 for some integers x 0, y 0. Thus n = dk = akx 0 + bky 0 = ax + by, with x = kx 0 and y = ky 0. Conversely, if d is any divisor of a and b, then d ax+by, so if n = ax+by, then n is divisible by the gcd of a and b. Corollary 7. Suppose that a and b are relatively prime integers, or equivalently that gcd(a, b) = 1. If a bc, then a c. To see this, since gcd(a, b) = 1, there exist integers x and y such that 1 = ax + by. Then c = acx + bcy. By assumption, a bc and hence a bcy; also, clearly a acx. Thus a divides the sum acx + bcy = c. Recall that a prime number p is a positive integer p > 1 such that, if d p, d > 0, then either d = 1 or d = p. (The number 1 is not a prime number.) Equivalently, a positive integer p > 1 is a prime number if and only if, for all a Z, either gcd(a, p) = 1, in which case a and p are relatively prime, or gcd(a, p) = p, in which case p divides a. Corollary 8. Let b and c be integers and let p be a prime number. If p bc, then either p b or p c. In other words, if a prime divides a product, it divides one of the factors. In fact, suppose that p bc. If p b we are done. So we can assume that p does not divide b. Thus, by the above remarks, p and b are relatively prime. Since p bc, Corollary 7 implies that p c. 6
7 Remark 9. We can ask if any of the above carries over to factorization in Z[x] or Q[x] or to similar situations. Given two polynomials a(x), b(x), not both 0, we can define a gcd of a(x) and b(x) to be a polynomial d(x) such that d(x) a(x), d(x) b(x), and for every polynomial e(x) dividing both a(x) and b(x), e(x) d(x). Of course, we would expect the existence or the form of d(x) to depend on the type of coefficients (integers, rational numbers, etc.) that we consider. It turns out that in all of the situations we have been considering (Z[x], Q[x], R[x], C[x], Q[x, y]), gcds do exist, In Q[x], R[x], C[x], the gcd of a(x) and b(x) can be written as a(x)f(x) + b(x)g(x) for some polynomials f(x), g(x), in other words the gcd of a(x) and b(x) is a linear combination of a(x) and b(x). It is not unique, since if d(x) e(x) and e(x) d(x), the most we can say is that d(x) and e(x) differ by multiplication by a nonzero constant polynomial. The gcd d(x) can be normalized, however, by requiring that its leading coefficient is 1. In Z[x] and Q[x, y], the gcd of two polynomials a(x) and b(x) cannot usually be written as a linear combination of a(x) and b(x), using polynomials of the same type. For example, it is easy to see that the gcd of 2 and x in Z[x] is 1, but we cannot write 1 = a(x)f(x) + b(x)g(x) where both f(x) and g(x) are polynomials with integer coefficients. Finally, there are situations where unique factorization fails, and which we hope to be able to describe by the end of the seminar. The Euclidean algorithm As promised, we describe a computationally efficient method for finding the gcd of two integers a and b, which at the same time shows how to write the gcd as a linear combination of a and b. Begin with a, b. Write a = bq 1 + r 1, with integers q 1 and r 1, 0 r 1 < b. Note that r 1 = a + b( q 1 ) is a linear combination of a and b. If r 1 = 0, stop, otherwise repeat this process with b and r 1 instead of a and b, so that b = r 1 q 2 +r 2, with 0 r 2 < r 1, and note that r 2 = b r 1 q 2 = b aq 2 +bq 1 q 2 is still a linear combination of a and b. If r 2 = 0, stop, otherwise repeat again with r 1 and r 2 instead of b and r 1, so that r 1 = r 2 q 3 + r 3, with 0 r 3 < r 2. We can continue in this way to find r 1 > r 2 > r 3 > > r k 0, with r k 1 = r k q k+1 + r k+1. Since the sequence of the r i decreases, and they are all nonnegative integers, eventually this procedure must stop with an r n such that r n+1 = 0, and hence r n 1 = r n q n+1. The procedure looks as 7
8 follows: a = bq 1 + r 1 b = r 1 q 2 + r 2 r 1 = r 2 q 3 + r 3. r n 2 = r n 1 q n + r n r n 1 = r n q n+1. We claim that r n is the gcd of a and b. In fact, we shall show (i) r n divides both a and b; (i) r n a linear combination of a and b. (i) Since r n r n 1, the equation r n 2 = r n 1 q n + r n implies that r n r n 2, and then working backwards from the equation r k 1 = r k q k+1 +r k+1, we see (with reverse induction) that r n r k 1 for all k < n. The fact that b = r 1 q 2 +r 2 and that r n divides r 1 and r 2 implies that r n divides b, and then the equation a = bq 1 + r 1 implies that r n divides a, too. (ii) Working the other way, we have seen that r 1 and r 2 are linear combinations of a and b. By induction, if r k 1 and r k are linear combinations of a and b, then the equation r k 1 = r k q k+1 + r k+1 implies that r k+1 = r k 1 r k q k+1 is also a linear combination of a and b (because as we saw in the proof of Theorem 4 the set of all linear combinations of a and b is closed under addition, subtraction, and multiplication by an integer). Thus r n is a linear combination of a and b as well. But we have seen that if a linear combination of a and b divides a and b and is positive, then it is equal to the gcd of a and b. So r n is the gcd of a and b. The algorithm is easier to carry out than it is to explain! For example, to find the gcd of 34 and 38, we have 38 = 34(1) = 4(8) = 2(2). This says that 2 = gcd(34, 38) and that 2 = 34 4(8) = 34 (38 34)(8) = 9(34) + ( 8)(38). It is often more efficient to choose q k+1 and r k+1 so that r k 1 = r k q k+1 ± r k+1, with r k+1 < r k the sign chosen so that r k+1 is as small as possible. 8
9 For example, to find the gcd of 7 and 34, we could write 34 = 7(4) = 6(1) + 1, to see that the gcd is 1 and that 1 = 7 6 = 7 (34 4(7)) = (7), or we could see directly that 34 = 7(5) 1. A more complicated example is the following, to find the gcd of 1367 and 298: 1367 = (298)(5) = 123(2) = 52(2) = 19(3) 5 19 = 5(4) 1. Thus the gcd is 1, and a little patience shows that Exercises 1 = 5(4) 19 = 11(19) 4(52) = 11(123) 26(52) = = (63)(123) (26)(298) = ( 63)(1367) + (289)(298). Exercise 1. Let d be an integer. Show that, if d is an integer dividing a and b, then d divides a + b, d divides ka for every integer k, and in fact d divides every linear combination ax + by, where a and b are integers. Exercise 2. Use the Euclidean algorithm to find the gcd d of a and b and to write d as a linear combination of a and b, where (i) a = 40, b = 100; (ii) a = 105, b = 101; (iii) a = 238, b = 709; (iv) a = 391, b = Exercise 3. Do there exist integers x and y such that 57x + 93y = 2? Why or why not? If such do exist, find at least one pair. Do the same with the equation 57x + 93y = 6. Exercise 4. Explain how you could use the Euclidean algorithm in the case of Q[x], i.e. of polynomials with rational coefficients. Use this to find the gcd of a(x) and b(x) and to write the gcd as a linear combination of a(x) and b(x), for (i) a(x) = x 3 4x 2 + 5x 2, b(x) = x 2 + x 2; (ii) a(x) = x 2 + 4x + 8, b(x) = x 2 + 3x + 6. (For (ii), you should find that 1 = 1 4 (x + 1)a(x) (x + 2)b(x).) 9
10 Exercise 5. Given integers a, b, n such that the equation ax + by = n has a solution in integers x and y, we can ask whether or not the solutions x and y are unique. If ax 1 + by 1 = ax 2 + by 2 = n, show that u = x 2 x 1 and v = y 2 y 1 are solutions to the equation au + bv = 0. Conversely, given solutions u and v to the equation au + bv = 0 and x 1, y 1 such that ax 1 + by 1 = n, show that, if we set x 2 = x 1 + u, y 2 = y 1 + v, then x 2, y 2 are also such that ax 2 + by 2 = n. Show that u = b, v = a is a solution to the equation au + bv = 0. More generally, for every integer t, u = tb, v = ta is also a solution to the equation au + bv = 0. If a and b are relatively prime, show that every solution to the equation au + bv = 0 is of this form (first show that b divides u). What happens if a and b are not relatively prime? Exercise 6. Suppose that a and b are both positive integers. In real life, for a positive integer n, we might want to solve the equation ax + by = n for integers x and y which are required to be nonnegative. Clearly this is not always possible, even if a and b are relatively prime. For example, n must be at least the smaller of a and b, and in general there will be a certain number of gaps. However, under the assumption that a and b are relatively prime, show: (i) The integer n = ab a b = a(b 1) + b( 1) = a( 1) + b(a 1) cannot be written as ax + by where both x and y are nonnegative integers. (ii) Every integer n which is strictly bigger than ab a b can be written as ax + by where both x and y are nonnegative integers. (Hint: the idea is to use the preceding exercise to see how it is possible, given one solution to n = ax + by, to change x and y and still get a solution to the equation.) 10
Polynomial Rings If R is a ring, then R[x], the ring of polynomials in x with coefficients in R, consists of all formal
Polynomial Rings 8172009 If R is a ring, then R[x], the ring of polynomials in x with coefficients in R, consists of all formal sums a i x i, where a i = 0 for all but finitely many values of i. If a
More informationTheorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.
Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,
More informationGiven two integers a, b with a 0. We say that a divides b, written
1 Divisibility Given two integers a, b with a 0. We say that a divides b, written a b, if there exists an integer q such that b = qa. When this is true, we say that a is a factor (or divisor) of b, and
More informationTopics in Number Theory
Chapter 8 Topics in Number Theory 8.1 The Greatest Common Divisor Preview Activity 1 (The Greatest Common Divisor) 1. Explain what it means to say that a nonzero integer m divides an integer n. Recall
More information1. The Natural Numbers Denition 1.1. Given sets a and b, the order pair of a and b is dened as the set
1. The Natural Numbers Denition 1.1. Given sets a and b, the order pair of a and b is dened as the set (a, b) = {{a}, {a, b}}. For two sets A and B we dene the Cartesian product of A and B as We often
More information2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers
2. INTEGERS AND ALGORITHMS 155 2. Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b.
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationDefinition For a set F, a polynomial over F with variable x is of the form
*7. Polynomials Definition For a set F, a polynomial over F with variable x is of the form a n x n + a n 1 x n 1 + a n 2 x n 2 +... + a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
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
More informationBasic Properties of Rings
LECTURE 15 Basic Properties of Rings Theorem 15.1. For any element a in a ring R, the equation a + x 0 R has a unique solution. We know that a + x 0 R has at least one solution u R by Axiom (5) in the
More information12 Greatest Common Divisors. The Euclidean Algorithm
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
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
More informationBasic Number Theory 1
Basic Number Theory 1 Divisibility Basic number theory uncovers the multiplicative structure of the integers. As such, the most important relation between integers is divisibility: the nonzero integer
More information1.2 Properties of Integers
10 CHAPTER 1. PRELIMINARIES 1.2 Properties of Integers 1.2.1 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
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationPROBLEM SET 6: POLYNOMIALS
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
More informationGREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
More informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationDefinition 1 Let a and b be positive integers. A linear combination of a and b is any number n = ax + by, (1) where x and y are whole numbers.
Greatest Common Divisors and Linear Combinations Let a and b be positive integers The greatest common divisor of a and b ( gcd(a, b) ) has a close and very useful connection to things called linear combinations
More informationNOTES ON BASIC NUMBER THEORY
NOTES ON BASIC NUMBER THEORY 1. DIVISORS AND GREATEST COMMON DIVISORS Definition 1.1. Let a,b be nonzero integers. We say b is divisible by a (or a divides b) if there is an integer x such that a x =
More informationSect 3.3 Zeros of Polynomials Functions
101 Sect 3.3 Zeros of Polynomials Functions Objective 1: Using the Factor Theorem. Recall that a zero of a polynomial P(x) is a number c such that P(c) = 0. If the remainder of P(x) (x c) is zero, then
More informationContents. 1 The Integers. 1.1 The Integers, Axiomatically. Number Theory (part 1): The Integers (by Evan Dummit, 2014, v. 1.00)
Number Theory (part 1): The Integers (by Evan Dummit, 2014, v. 1.00) Contents 1 The Integers 1 1.1 The Integers, Axiomatically......................................... 1 1.2 Basic Arithmetic and Induction.......................................
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
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,
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2011 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationEUCLID 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
More informationCongruences. Robert Friedman
Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition
More informationAbstract Algebra. Ch 0: Preliminaries. Properties of Integers
Abstract Algebra Ch 0: Preliminaries Properties of Integers Note: Solutions to many of the examples are found at the end of this booklet, but try working them out for yourself first. 1. Fundamental Theorem
More informationMODULAR ARITHMETIC STEVEN DALE CUTKOSKY
MODULAR ARITHMETIC STEVEN DALE CUTKOSKY 1. Relations, Rational Numbers and Modular Arithmetic 1.1. Relations. Suppose that X is a set. a relation on X is a subset R X X = {(a, b) a, b X}. Write a b if
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More information6.6. Unique Factorization Domains
book 2005/2/6 14:15 page 289 #303 6.6. UNIQUE FACTORIZATION DOMAINS 289 6.5.24. Fix a prime number p and consider the set Q p of rational numbers a/b, where b is not divisible by p. (The notation Q p is
More informationCLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010
CLASS 3, GIVEN ON 9/27/2010, FOR MATH 25, FALL 2010 1. Greatest common divisor Suppose a, b are two integers. If another integer d satisfies d a, d b, we call d a common divisor of a, b. Notice that as
More informationMATH Algebra for High School Teachers Integral Domains
MATH 57091  Algebra for High School Teachers Integral Domains Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 8 Cancellation
More informationBasic Notation and Properties of Integers
Basic Notation and Properties of Integers Denote the set of natural numbers N = {1, 2, 3,...} and the set of integers Z = {..., 3, 2, 1, 0, 1, 2, 3,...}. Let a and b be integers. We say that a divides
More informationDivides. Note a b is a statement, a/b is a number.
Divides Given integers a and b we say a divides b and write a b provided there exists and integer q such that aq = b. Examples Does 3 divide 6? Does 3 divide 6? Does 7 divide 15? Does 5 divide 0? Does
More informationMATH 523 LECTURE NOTES Summer 2008
MATH 523 LECTURE NOTES Summer 2008 These notes are intended to provide additional background from abstract algebra that is necessary to provide a good context for the study of algebraic coding theory.
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationDIVISIBILITY AND GREATEST COMMON DIVISORS
DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More information4. Number Theory (Part 2)
4. Number Theory (Part 2) Terence Sim Mathematics is the queen of the sciences and number theory is the queen of mathematics. Reading Sections 4.8, 5.2 5.4 of Epp. Carl Friedrich Gauss, 1777 1855 4.3.
More informationExtension Fields. Throughout these notes, the letters F, E, K denote fields.
Extension Fields Throughout these notes, the letters F, E, K denote fields. 1 Introduction to extension fields Let F, E be fields and suppose that F E, i.e. that F is a subfield of E. We will often view
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2  Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers  {1,2,3,4,...}
More informationAlgebraic Systems, Fall 2013, September 1, 2013 Edition. Todd Cochrane
Algebraic Systems, Fall 2013, September 1, 2013 Edition Todd Cochrane Contents Notation 5 Chapter 0. Axioms for the set of Integers Z. 7 Chapter 1. Algebraic Properties of the Integers 9 1.1. Background
More informationHave two operations addition and multiplication. Multiplication is associative, commutative, has identity
The integers Have two operations addition and multiplication Addition is associative, commutative, has identity and each element has an additive inverse Multiplication is associative, commutative, has
More informationChapter 6. Number Theory. 6.1 The Division Algorithm
Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationAlgebra Interactive. Reader. Arjeh M. Cohen, Hans Cuypers, Hans Sterk. Eindhoven University of Technology
Algebra Interactive Reader Arjeh M. Cohen, Hans Cuypers, Hans Sterk Eindhoven University of Technology iii Preface Algebra Interactive is designed as modern course material for undergraduate courses in
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationComputing Science 272 The Integers
Computing Science 272 The Integers Properties of the Integers The set of all integers is the set Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, and the subset of Z given by N = {0, 1, 2, 3, 4, }, is the set
More informationit is easy to see that α = a
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
More informationDefinition: Twin Primes.
4.5.. Definition: Twin Primes. If p and p + are both prime numbers, then p and p + are called twin primes Examples: Find all twin primes between 5 and 50. The primes 5 50 are: 7, 9, 3, 9, 3, 37, 4, 43,
More informationNumber Theory Homework.
Number Theory Homework. 1. The greatest common divisor and Bezout s Theorem Definition 1. If a and b are integers, not both zero, then c is a common divisor of a and b iff c a and c b. More generally if
More informationLecture 13: Abstract algebra and Number theory
Lecture 13: Abstract algebra and Number theory Thomas Johansson T. Johansson (Lund University) 1 / 61 a divides b {..., 2, 1, 0, 1, 2,...} = Z. Definition a, b Z. We say that a divides b (written a b)
More informationUnique Factorization
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
More informationMA Number Theory Spring Semester Prof. Meuser MIDTERM EXAM  March 1, 2013
MA 341  Number Theory Spring Semester  13  Prof. Meuser MIDTERM EXAM  March 1, 2013 1) (16 points) Let a, b N. a) (4 points) Give the definition of gcd(a, b). b) (6 points) Use the definition of gcd(a,
More informationAlgebra for Digital Communication
EPFL  Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain
More informationIntroduction to polynomials
Worksheet 4.5 Polynomials Section 1 Introduction to polynomials A polynomial is an expression of the form p(x) = p 0 + p 1 x + p 2 x 2 + + p n x n, (n N) where p 0, p 1,..., p n are constants and x os
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: November 8, 2016) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationAlgebraic Structures II
MAS 305 Algebraic Structures II Notes 10 Autumn 2006 Ring Theory A ring is a set R with two binary operations + and satisfying (a) (R,+) is an Abelian group; (b) R is closed under ; (c) is associative;
More information9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.
9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n1 x n1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationMath 135 Algebra Midterm Solutions
Math 135  Midterm Examination 1 Math 135 Algebra Midterm Solutions Question 1. (a) [4 marks] Consider the following two statements: x y(p (x) = Q(y)), and ( x P (x)) = ( y Q(y)) Give an example of a universe
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationMath 31  Homework 1 Solutions
Math 31  Homework 1 Solutions 1. Find gcd(a, b) and express gcd(a, b) as ma + nb for: (a) (116, 84) Solution. Use the Euclidean algorithm: 116 = ( 1)( 84) + 32 84 = ( 3)(32) + 12 32 = (2)(12) + 8 12 =
More informationASS.PROF.DR Thamer Information Theory 4th Class in Communication. Finite Field Arithmetic. (Galois field)
Finite Field Arithmetic (Galois field) Introduction: A finite field is also often known as a Galois field, after the French mathematician Pierre Galois. A Galois field in which the elements can take q
More informationPractice Problems for First Test
Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.
More informationMATH 113 HOMEWORK 1: SOLUTIONS
MATH 3 HOMEWORK : SOLUTIONS Problems From the Book: Axler Chapter, problems, 4, 8, 9, and 3. Solution to. Multiplying the numerator by its congruence directly gives a simplified expression of the ratio
More information1.1 Divisors. 1.1 J.A.Beachy 1. from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair
1.1 J.A.Beachy 1 1.1 Divisors from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 25. Let a be an integer. Show that if 2 a and 3 a, then 6 a. Solution:
More information2215 Solution Problem Sheet 4 1. Irreducibility and Factorization of Polynomials
2215 Solution Problem Sheet 4 1 Irreducibility and Factorization of Polynomials 1. Show that p(x) is irreducible in R[X], R any ring, if and only if p(x a) is irreducible in R[x] for any a R. Solution:
More information1 Algebra  Partial Fractions
1 Algebra  Partial Fractions Definition 1.1 A polynomial P (x) in x is a function that may be written in the form P (x) a n x n + a n 1 x n 1 +... + a 1 x + a 0. a n 0 and n is the degree of the polynomial,
More informationFurther linear algebra. Chapter I. Integers.
Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides
More information13. Suppose that a and b are integers, a 4 (mod 13), and. b 3 (mod 19). Find the integer c with 0 c 18 such
244 4 / Number Theory and Cryptography Remark: Because Z m with the operations of addition and multiplication modulo m satisfies the properties listed, Z m with modular addition is said to be a commutative
More informationFunctions and Equations
Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c
More informationIntegers and Rational Numbers
Chapter 6 Integers and Rational Numbers In this chapter, we will see constructions of the integers and the rational numbers; and we will see that our number system still has gaps (equations we can t solve)
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information(4) (identity element for +) There is an element e in R such that. (5) (inverse element for +) For all a R there exists x R so that.
Chapter 12  Introduction to Rings We now study of an algebraic structure called a ring This is in some sense a minimal list of characteristics of the system of integers We will see that many other systems
More informationPolynomial Equations Carnegie Learning, Inc. Chapter 10 l Polynomial Equations
C H A P T ER Polynomial Equations The Fundamental Theorem of Algebra, which states that any polynomial equation of degree n must have exactly n complex roots or solutions, was first proposed by Peter Rothe
More informationBasic properties of the integers
Basic properties of the integers MA 341 Spring 2011 1 Definitions The natural numbers are the numbers 1, 2, 3,... (some authors include zero, as well), and for shorthand, we will denote the collection
More informationChapter 1. What is a Ring? 1.1 Some Examples. Consider the following sets : 2. Q = { a b
Chapter 1 What is a Ring? 1.1 Some Examples Consider the following sets : 1. Z = {..., 1, 0, 1, 2,... } the set of integers. 2. Q = { a b a, b Z, b 0} the set of rational numbers. 3. M 2 (R) the set of
More informationReal numbers. Constants, variables, and mathematical modeling.
Lecture 1. Real numbers. Constants, variables, and mathematical modeling. In this lecture we briefly sketch the structure of Real numbers and recall properties of addition and subtraction. Then we will
More informationStrong Induction. Joseph R. Mileti. February 13, 2015
Strong Induction Joseph R. Mileti February 13, 2015 1 Strong Induction Remember our original model for induction: Prove that the statement is true for 0. Prove that if the statement is true for 0, then
More informationALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS. 1. Ideals in Commutative Rings In this section all groups and rings will be commutative.
ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS PETE L. CLARK 1. Ideals in Commutative Rings In this section all groups and rings will be commutative. 1.1. Basic definitions and examples. Let R be a (commutative!)
More informationLinear Algebra II. Notes 1 September a(b + c) = ab + ac
MTH6140 Linear Algebra II Notes 1 September 2010 1 Vector spaces This course is about linear maps and bilinear forms on vector spaces, how we represent them by matrices, how we manipulate them, and what
More informationModule MA1S11 (Calculus) Michaelmas Term 2016 Section 2: Polynomials
Module MAS (Calculus) Michaelmas Term 206 Section 2: Polynomials D. R. Wilkins Copyright c David R. Wilkins 206 Contents 2 Polynomials 30 2. Completing the Square in Quadratic Polynomials....... 30 2.2
More informationINTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS
INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28
More informationLecture 1: Elementary Number Theory
Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers
More informationBASIC CONCEPTS ON NUMBER THEORY
BASIC CONCEPTS ON NUMBER THEORY This is a brief introduction to number theory. The concepts to cover will enable us to answer questions like: How many integers between 50 and 150 are divisible by 4? How
More informationChapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.
Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to
More informationClock Arithmetic and Euclid s Algorithm
Clock Arithmetic and Euclid s Algorithm Lecture notes for Access 2006 by Erin Chamberlain. Earlier we discussed Caesar Shifts and other substitution ciphers, and we saw how easy it was to break these ciphers
More information1.1 The Natural Numbers
2 CHAPTER 1. NUMBERS 1.1 The Natural Numbers The elements of the set of natural numbers: N = {1, 2, 3, 4, 5,...} are the numbers we use for counting. They come equipped with an ordering: and they also
More informationPrime Numbers. p 1 p 2 p n + 1.
Prime Numbers 7192006 A prime number is an integer n > 1 whose only positive divisors are 1 and n. An integer greater than 1 which is not prime is composite. Euclid showed that there are infinitely many
More informationReading 7 : Program Correctness
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 7 : Program Correctness 7.1 Program Correctness Showing that a program is correct means that
More informationCHAPTER 5: MODULAR ARITHMETIC
CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called
More informationPolynomials Justin Stevens Page 1. ARML: Polynomials. Authors Justin Stevens
Polynomials Justin Stevens Page 1 ARML: Polynomials Authors Justin Stevens 1 Polynomials 1.1 Lecture A polynomial P (x) is defined as being of the form P (x) = a n x n + a n 1 x n 1 + + a i x i + a 1 x
More informationMath Number Theory & Abstract & Linear Algebra. 1st Semester 2010
CHAPTER 1. CONTENTS 2301 Notes Math 2301 Number Theory & Abstract & Linear Algebra 1st Semester 2010 The course is split into three parts: Number Theory Abstract Algebra: groups, rings & fields. Linear
More information62 CHAPTER 2. POLYNOMIALS. Roots are the key to a deeper understanding of polynomials. Definition: Any value r F that solves: f(r) = 0
6 CHAPTER. POLYNOMIALS.3 Roots Roots are the key to a deeper understanding of polynomials. Definition: Any value r F that solves: f(r) = 0 is called a root of the polynomial f(x) F [x]. Examples: (a) Every
More information6.4 The Remainder Theorem
6.4. THE REMAINDER THEOREM 6.3.2 Check the two divisions we performed in Problem 6.12 by multiplying the quotient by the divisor, then adding the remainder. 6.3.3 Find the quotient and remainder when x
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationCS103X: Discrete Structures Homework Assignment 2: Solutions
CS103X: Discrete Structures Homework Assignment 2: Solutions Due February 1, 2008 Exercise 1 (10 Points). Prove or give a counterexample for the following: Use the Fundamental Theorem of Arithmetic to
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 6
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 6 Polynomials Recall from your high school math that a polynomial in a single variable is of the form p(x) a d x d
More information