Definition For a set F, a polynomial over F with variable x is of the form
|
|
- Nigel Holmes
- 5 years ago
- Views:
Transcription
1 *6. 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 a 1 x + a 0, where a n, a n 1,..., a 1, a 0 F. The a i, 0 i n are the coefficients of the polynomial. If x n is the largest power of x appearing in the polynomial then n is the degree of the polynomial, a n x n is the leading term and a n is the leading coefficient. The collection of all polynomials with one variable x and with coefficients from F will be denoted by F [x]. Note the square brackets.) Note that 0 F [x], being x 2 + 0x + 0, but it is not said to have a degree, though some books give it degree 1 or even. Part of the aim of this section is to show how similar are the properties of F [x] and Z. Examples x 2 + 5x 1 Z [x], 7 x 5 12 x2 + x Q [x], x 2 π R [x]. We could also look at polynomials in Z m [x] or C [x]. If we can add and multiply numbers in the set F then we can add and multiply the polynomials in F [x]. Examples i) In Z [x] the sum of x 2 + 5x 1 and 5x x 2 + 2x + 1 is x 2 + 5x 1 ) + 5x x 2 + 2x + 1 ) = 5x + 7x. ii) In Z [x] the difference of x and 9x + 7 is x ) 9x + 7 ) = x 2 9x 6. Notice how subtraction is easier than for integers. For example is complicated by the fact that we can subtract 7 from 1 and put 6 in the units place, we have to instead borrow 10 from the next column. iii) In 1
2 Z [x] the product of x 2 + 2x + and x is x 2 + 2x + ) x ) = x x + 8x +x 4 + 4x 2 = x 4 + 2x + 7x 2 + 8x + 12 We can do all the above again in more interesting sets. i) Addition in Z [x]. The sum of 2x + 2x 2 + x + 1 and x + 2x is + 2x + 2x 2 + x + 1 x + 2x ) = x 2 + x, using 0 mod and 4 1 mod. ii) Subtraction in Z 5 [x]. The difference of 4x + x 2 + x + and 2x + x + 4 is 4x + x 2 + x + ) 2x + x + 4 ) = 2x + x 2 + x + 4 using 2 mod 5 and 1 4 mod 5. iii) Multiplication in Z 2 [x]. The product of x + x + 1 and x 2 + x + 1 is x + x + 1 ) x 2 + x + 1 ) = x 5 + x 4 + x using 2 0 mod 2. + x + x 2 + x + x 2 + x + 1 = x 5 + x Note that in Z [x], Q [x], R [x], C [x] or Z p [x], with p prime, we have deg fg = deg f + deg g. This may not hold in Z m [x] with m composite. Example In Z 6 [x] multiply f x) = 2x and g x) = x to get 2x ) x ) = 6x 6 + x 4 + 2x = x 4 + 2x Hence, in this example, deg fg < deg f + deg g. 2
3 Subtle point. Recall that two functions f and g are equal on a set X if, and only if, f x) = g x) for all x X. Consider f x) = x 4 + 2x + 1 and g x) = 1 + x) 2 over Z. There are only three elements in Z and for these, f 0) = 1 = g 0), f 1) = 1 = g 1), f 2) = 0 = g 2). So as functions over Z these are equal though as polynomials they are different. Question If we can multiply polynomials can we factor them? Assumption From now on F will be one of Q, R, C or Z p, with p prime because, to look at factorization, or dividing, it is best to restrict to sets F in which we can find inverses. We can talk of dividing in Q, R or C but not in Z p. Instead we have to remember that to divide by something is to multiply by it s inverse.) Aside: In Z 6 does [] 6 have an inverse? i.e. does there exist an element with [] 6 [x] 6 = [1] 6. If there did, we could multiply both sides by [2] 6 to get [6] 6 [x] 6 = [2] 6, i.e. [0] 6 = [2] 6, contradiction. So not every element in Z 6 has an inverse. The same argument works in general for Z m with m composite.) The first step to answering this question about factoring is to look at long division for polynomials. Example In Q [x] divide x 2 x 1 into x 4 + 2x + x 2 + 4x + 5. Solution x 2 + x + 7 x 2 x 1 ) x 4 + 2x + x 2 + 4x + 5 x 4 + x + x 2 x + 4x 2 + 4x x + x 2 + x 7x 2 + 7x + 5 7x 2 + 7x x + 12 Hence x 4 + 2x + x 2 + 4x + 5 = x 2 + x + 7) x 2 x 1) + 14x + 12). Always, always check by multiplying out. You should never end with an incorrect answer.
4 Thus given f and g Q [x] we have found q, r Q [x] such that f = qg+r and deg r < deg g. This is very reminiscent of the division theorem for integers and we have exactly the same result for polynomials. Definition If f, g F [x] we say that g x) divides f x), and write g f, if there exists q x) F [x] such that f x) = g x) q x). We also say that f if a multiple of g. Note that if g f then either g 0 or deg g deg f. Careful If m, n Z, then m n and n m imply m = ±n. If we then demand that both m and n are positive we get m = n. But if we have polynomials f, g F [x] then f g implies deg f deg g. Similarly, g f implies deg g deg f. Hence deg f = deg g. But f g also means f = gu for some polynomial u. Then deg f = deg g means deg u = 0, and so u is a non-zero constant. Hence f g and g f imply only that f = cg for some constant c. Example In Z [x] x 2 + 2x + 1 x 2 + x + 1 ) x 4 + x x 4 + x + x 2 2x + 1 2x + 2x 2 + 2x x 2 + x + 1 x 2 + x Often using 2 = 1, 1 = 2 modulo.) Hence x 4 + x = x 2 + 2x + 1) x 2 + x + 1) and so x 2 + x + 1 divides x 4 + x Theorem Division Theorem for Polynomials. H.P p. 264) Let F be as above. Let f x), g x) F [x] with g x) 0. Then there exist unique polynomials q x), r x) F [x] such that f x) = q x) g x) + r x) and either r x) 0 or r is non-zero and has a lower degree than g. Proof Not given in course. Existence) If f x) 0 we can write 0 = 0g x) + 0, so we can assume that f x) 0. If g f then f x) = g x) q x) for some q x) and the result follows with r x) 0. In particular if deg g = 0, i.e. g x) c a non-zero constant, we can take q x) = c 1 f x). 4
5 Hence we can assume that g f and n = deg g 1. Consider the set S = {f qg : q F [x]}. Because g f this set does not contain 0 so every element in this set has a degree. This set is non-empty, since it contains f 0g. If we look at D, the set of degrees of the polynomials in S, we have a non-empty set of nonnegative integers so, by the well-ordering principle, it contains a minimum element. Choose a q F [x] such that f qg takes this minimum value and set r = f qg. Since g f we have r x) 0 and so we have to show that deg r < deg g. Assume for the sake of contradiction that deg r deg g. Let m = deg r and write r x) = a m x m + a m 1 x m a 1 x + a 0, along with g x) = b n x n + b n 1 x n b 1 x + b 0. So m n, a m 0 and b n 0. Consider the polynomial r x) a m b 1 n x m n g x) = f x) q x) g x)) a m b 1 n x m n g x) = f x) q + a m b 1 n x m n) g x) S. It is in S but the degree of this polynomial is m 1, i.e. it is < deg r, contradicting the choice of r as having minimum degree. Hence our assumption is false and deg r < deg g as required. Uniqueness) Assume for contradiction that, for some f and g, the division is not unique. For this pair we can find distinct divisions f = qg + r and f = qǵ + r with either r 0 or deg r < deg g and either r 0 or deg r < deg g. Then qg + r = qǵ + r, or r r = q q) g. Thus g divides r r. This means either r r 0, i.e. r = r, and thus q = q, contradicting the fact that we started with distinct divisions, or deg g deg r r ) max deg r, deg r ) < deg g, again a contradiction. Hence our assumption is false and the division is unique. An important deduction connects the roots of a polynomial with factorization. Corollary Let F be as above. Let p x) F [x]. Then p a) = 0 if, and only if, x a) p x). Proof ) Assume p a) = 0. Apply the Theorem with f = p and g = x a to find q, r F [x] with p x) = q x) x a) + r x), and either r 0 or 5
6 deg r < deg g. If r 0 we are finished. Otherwise deg r < deg g = 1 and so deg r = 0, i.e. r is a constant, c say. Thus p x) = q x) x a) + c. Put x = a to see that c = 0. So again x a divides p x). ) Assume x a) p x). But this means p x) = q x) x a) for some q x) F [x]. Putting x = a and we see that p a) = 0. Since a polynomial in F [x] of degree n can be the product of at most n linear factors x a, it can have at most n roots in F. But will it have exactly n roots? Example 2x 1 Z [x] but it has no root is Z. Its root, 1/2 Q. But x 2 2 Q [x] yet it has no root is Q. Its roots are ± 2 R. Further x R [x] but it has no root is R. Its roots are ±i C. Something different happens for C. Theorem Fundamental Theorem of Algebra. If f C [x] has deg f 1 then f has a root in C. Thus f factorizes completely into n linear factors. Proof Not given in this course. So a polynomial in C [x] of degree n has exactly n roots in C. The Corollary can help us factorize polynomials; to find linear factors it suffices to find roots. Examples i) Factorize p x) = x 4 + x 2x 2 6x 4 over R. Solution Look at p a) for small a. So p 0) = 4, p 1) = 8, p 1) = 0. Thus x + 1 divides p x). x + 1 x 2x 4 ) x 4 + x 2x 2 6x 4 x 4 2x 2 4x x 2x 4 x 2x 4 0 x 4 + x 2x 2 6x 4 = x + 1) x 2x 4 ). Writing q x) = x 2x 4 we see that q 2) = 0 so x 2 divides q x). x 2 x 2 + 2x + 2 ) x 2x 4 x + 2x 2 + 2x 2x 2 4x 4 2x 2 4x 4 0 6
7 x 2x 4 = x 2) x 2 + 2x + 2 ). Does x 2 +2x+2 factorize over R? Note that x 2 +2x+2 = x + 1) and so can never be zero for real x. Thus x 2 + 2x + 2 has no linear factors. Hence we finish with x 4 + x 2x 2 6x 4 = x + 1) x 2) x 2 + 2x + 2 ). ii) Factorize p x) = x 4 + x + x 2 + x + 4 over Z 5. Solution We need only check x = 0, 1, 2, 2 or 4 1 mod 5. In turn, p 0) = 4, p 1) = 0, p 2) = while p 2) = 0 and p 1) = 2, all calculation modulo 5. Thus x 1 and x + 2 divide p x). So for some q x) we have p x) = x 1) x + 2) q x) = x 2 + x 2) q x), i.e. x 2 + x 2 + x 2 ) x 4 + x + x 2 + x + 4 x 4 + x 2x 2 x 2 + x + 4 x 2 + x x 4 + x + x 2 + x + 4 = x 1) x + 2) x 2 + ). You should check that x 2 + has no zeros, it could have 1 or 2 as zeros, just as p x) did. The division Theorem above is very similar to a result in integers. Other ideas can be generalized to polynomials such as Definition Let F be one of Q, R, C or Z p, with p prime. Let f, g F [x] be polynomials not both identically zero. Then a greatest common divisor is a polynomial d F [x] such that i) d x) divides both f x) and g x), ii) if c x) divides both f x) and g x) then c x) divides d x). Note that if the gcd exists it is not unique. For if d satisfies i) and ii) and λ F is non-zero then λd also satisfies the two properties. A particular gcd is often picked out take λ = c 1 where c is the leading coefficient of d. Then c 1 d has leading coefficient 1, and is called a monic polynomial. We need to justify that such a gcd exists. argument as used for the gcd of integers. We do not use the same Theorem Let F be as above. Let f, g F [x] be polynomials not both identically zero. Then there exists d F [x] such that 7
8 i) d x) divides both f x) and g x), ii) if c x) divides both f x) and g x) then c x) divides d x). Proof Not given in course. Let S = {f x) K x) + g x) L x) : K x), L x) Q [x]} {0}. Let D be the set of degrees of polynomials in S. W.l.o.g. assume f is not identically zero and take K 1 and L 0 to see that f = 1.f +0.g S. Thus S, and and in turn D, are non-empty. D is a set of non-negative integers so, by the well-ordering principle it has a least element. Take K x), L x) F [x] so that d x) = f x) K x) + g x) L x) has this minimum degree. We have to show that i) and ii) of the definition both hold. i) Use the division Theorem to write f x) = q x) d x) + r x) for some q x), r x) F [x] with either r 0 or deg r < deg d. Then r x) = f x) q x) d x) = f x) q x) f x) F x) + g x) L x)) = f x) 1 q x) K x)) + q x) L x)) g x) which is either 0 or in S. If it is not identically zero then we have r x) S and deg r < deg d, which contradicts the minimality of deg d. Hence r 0 and f x) = q x) d x), i.e. d f. Similarly you can show that d g. ii) Assume that c x) divides both f x) and g x), so f x) = c x) u x) and g x) = c x) v x) for some u x), v x) F [x]. Then d x) = f x) K x) + g x) L x) = c x) u x) K x) + c x) v x) L x) = c x) u x) K x) + v x) L x)) and so c x) divides d x). In any given problem we construct a gcd using repeated use of the Division Theorem. And if we formalize this method we get Theorem The Euclidean Algorithm for Polynomials. Let F be as above. Let f, g F [x] be polynomials. If g divides f then g is a gcd of f and g. Otherwise apply the Division Theorem to obtain a series of equations f = gq 1 + r 1, 0 < deg r 1 < deg g, g = r 1 q 2 + r 2, 0 < deg r 2 < deg r 1, r 1 = r 2 q + r, 0 < deg r < deg r 2,. r j 2 = r j 1 q j + r j, 0 < deg r j < deg r j 1, r j 1 = r j q j+1. 8
9 Then r j, the last non-zero remainder, is a greatest common divisor of f and g. Further, by working back up this list we can find p x), q x) F [x] such that gcd f x), g x)) = p x) f x) + q x) g x). Proof Left to student. Examples i) Over Q [x] find a greatest common divisor of f x) = 2x 5 + 6x x + x 2 14x 12 and g x) = 2x 4 + x + 4x 2 8x 8 and write the answer as a linear combination of f and g. Solution x + 2 2x 4 + x + 4x 2 8x 8 ) 2x 5 + 6x x + x 2 14x 12 2x 5 + x 4 + 4x 8x 2 8x x 4 + 6x + 9x 2 6x 12 x x + 6x 2 12x 12 2 x + x 2 + 6x So f x) = x + ) g x) + r 1 x) 2 where r 1 x) = 2 x + x 2 + 6x. We need to now divide r 1 x) into g x). So 4 x 2 2 x + x 2 + 6x ) 2x 4 + x + 4x 2 8x 8 2x 4 + 4x + 8x 2 x 4x 2 8x 8 x 2x 2 4x 2x 2 4x 8 g x) = 4 x 2 ) r 1 x) + r 2 x) where r 2 x) = 2x 2 4x 8. We need to now divide r 2 x) into r 1 x). x 4 2x 2 4x 8 ) 2 x + x 2 + 6x 2 x + x 2 + 6x 0 So we have found a zero remainder. The greatest common divisor is the last non-zero remainder, r 2 x) = 2x 2 4x 8. 9
10 We can work back and write the gcd as a linear multiple of f and g. So 4 r 2 x) = g x) x 2 ) r 1 x) 4 = g x) x 2 ) f x) x + ) ) g x) 2 4 = 1 + x 2 ) x + )) 4 g x) 2 x 2 ) f x) ) ) 4x 2 + 4x 4x 2 = g x) f x). ii) Over Q [x] find a greatest common divisor of f x) = x 4 + x + 6x 2 + 6x + 4 and g x) = x 4 x 2 6x 2 and express your answer as a linear combination of the original polynomials. Solution Firstly x 4 + x + 6x 2 + 6x + 4 = 1 x 4 x 2 6x 2 ) + x + 9x x + 6. Next x 4 x 2 6x 2 = 1 x x + 9x x + 6 ) + x 7x 2 8x 2 ) ) 1 x = x 1 + 9x x + 6 ) + 2x 2 + 4x + 4. Then i.e x + 9x x + 6 = 2 x 2x 2 + 4x + 4 ) + x 2 + 6x + 6 = 2 x + ) 2x 2 + 4x + 4 ). 2 There is no remainder here, and so a gcd is the last non-zero remainder, gcd x 4 x 2 6x 2, x 4 + x + 6x 2 + 6x + 4 ) = 2x 2 + 4x + 4 and 2x 2 + 4x + 4 = x 4 x 2 6x 2 ) ) 1 x x 1 + 9x x + 6 ) ) 1 = g x) x 1 f x) g x)) ) 1 = x 1 f x) + 1 xg x). 10
11 Always, always check your answer.) ii) Over Z [x] find a greatest common divisor of x + 2x 2 + 2x + 1 and x and express your answer as a linear combination of the original polynomials. Solution Firstly Next x = x x + 2x 2 + 2x + 1 ) + x + x 2 + 2x + 2 = x + 1) x + 2x 2 + 2x + 1 ) + 2x x + 2x 2 + 2x + 1 = 2x 2x ) + 2x = 2x + 1) 2x ). So gcd x + 2x 2 + 2x + 1, x 4 + 2) = 2x And, quite simply, 2x = x ) x + 1) x + 2x 2 + 2x + 1 ). 11
Homework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationFurther linear algebra. Chapter II. Polynomials.
Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is
More informationg(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
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationa = qb + r where 0 r < b. Proof. We first prove this result under the additional assumption that b > 0 is a natural number. Let
2. Induction and the division algorithm The main method to prove results about the natural numbers is to use induction. We recall some of the details and at the same time present the material in a different
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More information2 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
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Factorise each polynomial: a) x 2 6x + 5 b) x 2 16 c) 9x 2 25 2) Simplify the following algebraic fractions fully: a) x 2
More informationRINGS: 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
More informationChapter 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
More informationAn Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Science, Chennai. Unit - I Polynomials Lecture 1B Long Division
An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Science, Chennai Unit - I Polynomials Lecture 1B Long Division (Refer Slide Time: 00:19) We have looked at three things
More informationThis is a recursive algorithm. The procedure is guaranteed to terminate, since the second argument decreases each time.
8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only
More informationMTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1
MTH 310, Section 001 Abstract Algebra I and Number Theory Sample Midterm 1 Instructions: You have 50 minutes to complete the exam. There are five problems, worth a total of fifty points. You may not use
More informationQ 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?
2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 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 informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
More informationDivision Algorithm B1 Introduction to the Division Algorithm (Procedure) quotient remainder
A Survey of Divisibility Page 1 SECTION B Division Algorithm By the end of this section you will be able to apply the division algorithm or procedure Our aim in this section is to show that for any given
More informationFinite 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
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationSECTION 2.3: LONG AND SYNTHETIC POLYNOMIAL DIVISION
2.25 SECTION 2.3: LONG AND SYNTHETIC POLYNOMIAL DIVISION PART A: LONG DIVISION Ancient Example with Integers 2 4 9 8 1 In general: dividend, f divisor, d We can say: 9 4 = 2 + 1 4 By multiplying both sides
More informationNOTES 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,
More informationMTH 346: The Chinese Remainder Theorem
MTH 346: The Chinese Remainder Theorem March 3, 2014 1 Introduction In this lab we are studying the Chinese Remainder Theorem. We are going to study how to solve two congruences, find what conditions are
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: December 11, 2017) 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 informationMathematics of Cryptography Part I
CHAPTER 2 Mathematics of Crptograph Part I (Solution to Practice Set) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinit to positive infinit. The set of
More information4 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)
More informationPolynomial Rings. i=0
Polynomial Rings 4-15-2018 If R is a ring, the ring of polynomials in x with coefficients in R is denoted R[x]. It consists of all formal sums a i x i. Here a i = 0 for all but finitely many values of
More information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More informationSummary: Divisibility and Factorization
Summary: Divisibility and Factorization One of the main subjects considered in this chapter is divisibility of integers, and in particular the definition of the greatest common divisor Recall that we have
More informationLECTURE 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
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest
More informationNumber 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
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationOn the polynomial x(x + 1)(x + 2)(x + 3)
On the polynomial x(x + 1)(x + 2)(x + 3) Warren Sinnott, Steven J Miller, Cosmin Roman February 27th, 2004 Abstract We show that x(x + 1)(x + 2)(x + 3) is never a perfect square or cube for x a positive
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationSolutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00
Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d
More information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationCh 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:
More informationLecture 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
More information1 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
More informationChapter 1 A Survey of Divisibility 14
Chapter 1 A Survey of Divisibility 14 SECTION C Euclidean Algorithm By the end of this section you will be able to use properties of the greatest common divisor (gcd) obtain the gcd using the Euclidean
More informationAlgebra Year 10. Language
Algebra Year 10 Introduction In Algebra we do Maths with numbers, but some of those numbers are not known. They are represented with letters, and called unknowns, variables or, most formally, literals.
More informationCool Results on Primes
Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why
More information3.2 Solving linear congruences. v3
3.2 Solving linear congruences. v3 Solving equations of the form ax b (mod m), where x is an unknown integer. Example (i) Find an integer x for which 56x 1 mod 93. Solution We have already solved this
More informationAN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION
AN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION Recall that RSA works as follows. A wants B to communicate with A, but without E understanding the transmitted message. To do so: A broadcasts RSA method,
More informationSolution Sheet (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = (i) gcd (97, 157) = 1 = ,
Solution Sheet 2 1. (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = 3. 2. (i) gcd (97, 157) = 1 = 34 97 21 157, (ii) gcd (527, 697) = 17 = 4 527 3 697, (iii) gcd (2323, 1679) =
More informationINTEGERS. 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
More informationLecture 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
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationChinese Remainder Theorem
Chinese Remainder Theorem Theorem Let R be a Euclidean domain with m 1, m 2,..., m k R. If gcd(m i, m j ) = 1 for 1 i < j k then m = m 1 m 2 m k = lcm(m 1, m 2,..., m k ) and R/m = R/m 1 R/m 2 R/m k ;
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More information6 Permutations Very little of this section comes from PJE.
6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action
More informationIRREDUCIBILITY TESTS IN Q[T ]
IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case
More informationLecture 2. The Euclidean Algorithm and Numbers in Other Bases
Lecture 2. The Euclidean Algorithm and Numbers in Other Bases At the end of Lecture 1, we gave formulas for the greatest common divisor GCD (a, b), and the least common multiple LCM (a, b) of two integers
More informationAlgebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.
Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. A1.1.1 Compare real number expressions. A1.1.2 Simplify square
More informationLecture 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)
More informationALGEBRA. 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
More informationNUMBER THEORY AND CODES. Álvaro Pelayo WUSTL
NUMBER THEORY AND CODES Álvaro Pelayo WUSTL Talk Goal To develop codes of the sort can tell the world how to put messages in code (public key cryptography) only you can decode them Structure of Talk Part
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationMAT 243 Test 2 SOLUTIONS, FORM A
MAT Test SOLUTIONS, FORM A 1. [10 points] Give a recursive definition for the set of all ordered pairs of integers (x, y) such that x < y. Solution: Let S be the set described above. Note that if (x, y)
More informationLecture 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
More informationThe set of integers will be denoted by Z = {, -3, -2, -1, 0, 1, 2, 3, 4, }
Integers and Division 1 The Integers and Division This area of discrete mathematics belongs to the area of Number Theory. Some applications of the concepts in this section include generating pseudorandom
More informationHOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS
HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS 1. Chapter 3, Problem 18 (Graded) Let H and K be subgroups of G. Then e, the identity, must be in H and K, so it must be in H K. Thus, H K is nonempty, so we can
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationAlgebra Summer Review Packet
Name: Algebra Summer Review Packet About Algebra 1: Algebra 1 teaches students to think, reason, and communicate mathematically. Students use variables to determine solutions to real world problems. Skills
More information11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic
11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic Bezout s Lemma Let's look at the values of 4x + 6y when x and y are integers. If x is -6 and y is 4 we
More informationMath 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
More informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationDivisibility of Natural Numbers
10-19-2009 Divisibility of Natural Numbers We now return to our discussion of the natural numbers. We have built up much of the mathematical foundation for the natural numbers (N = 1, 2, 3,...). We used
More informationP-adic numbers. Rich Schwartz. October 24, 2014
P-adic numbers Rich Schwartz October 24, 2014 1 The Arithmetic of Remainders In class we have talked a fair amount about doing arithmetic with remainders and now I m going to explain what it means in a
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationChapter 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
More information4. Congruence Classes
4 Congruence Classes Definition (p21) The congruence class mod m of a Z is Example With m = 3 we have Theorem For a b Z Proof p22 = {b Z : b a mod m} [0] 3 = { 6 3 0 3 6 } [1] 3 = { 2 1 4 7 } [2] 3 = {
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationDivisibility. Chapter Divisors and Residues
Chapter 1 Divisibility Number theory is concerned with the properties of the integers. By the word integers we mean the counting numbers 1, 2, 3,..., together with their negatives and zero. Accordingly
More informationAlgorithmic number theory. Questions/Complaints About Homework? The division algorithm. Division
Questions/Complaints About Homework? Here s the procedure for homework questions/complaints: 1. Read the solutions first. 2. Talk to the person who graded it (check initials) 3. If (1) and (2) don t work,
More informationComputations/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
More informationNotes 6: Polynomials in One Variable
Notes 6: Polynomials in One Variable Definition. Let f(x) = b 0 x n + b x n + + b n be a polynomial of degree n, so b 0 0. The leading term of f is LT (f) = b 0 x n. We begin by analyzing the long division
More informationPrimes and Modular Arithmetic! CSCI 2824, Fall 2014!!
Primes and Modular Arithmetic! CSCI 2824, Fall 2014!!! Scheme version of the algorithm! for finding the GCD (define (gcd a b)! (if!(= b 0)!!!!a!!!!(gcd b (remainder a b))))!! gcd (812, 17) = gcd(17, 13)
More information