LeLing13: Polynomials and complex numbers. Division of polynomials. Euclides s algorithm and multiple roots. R ecommended exercises: Geoling 15.
|
|
- Phyllis O’Brien’
- 6 years ago
- Views:
Transcription
1 LeLing13: Polynomials and complex numbers. C ontents: Polynomials and non-polynomial expressions. The roots of x + 1 = 0: the complex numbers. The inverse 1 and the conjugate. z Roots of polynomials. Conjugate roots. The formula b± b 4ac. a Euclides s algorithm and the golden ratio Division of polynomials. Euclides s algorithm and multiple roots. R ecommended exercises: Geoling 15. Polynomials A polynomial p(x) in X is an expression p(x) = a 0 + a 1 X + + a n X n, where a 1, a,, a n are numbers. If a n 0 the number n is called the degree of the polynomial p(x), and we write deg(p(x)) = n. When all a 1, a,, a n are real numbers, p(x) is called a real polynomial. When instead a 1, a,, a n belong to a field K then p is said to have coefficients in K, so we write p(x) K[X]. Clearly, p(x) R[X] means p(x) is a real polynomial. Usually one thinks of a polynomial as a function and one writes P (x), where the x means we have substituted the number x where X was. Classical examples are the line p(x) = ax + b and the parabola p(x) = ax + bx + c. There are naturally maps f(x) that do not arise from substituting x to X in a polynomial. The typical examples include cos(x) and sin(x). In fact, this follows from the fact that sin(x) and cos(x) have infinitely many roots, whereas a polynomial p(x) has not more than deg(p(x)) roots 1. Sometimes we could want to substitute to X a matrix or any other object that is possible to add and multiply. ( For ) example, if p(x) = X 3 + X + 1, putting in the place 0 1 of X the matrix J = we may compute p(j), which will be a matrix This is proven using the division algorithm (or Ruffini s theorem). Ingegneria dell Autoveicolo, LeLing13 1 Geometria
2 From J 3 = J in fact, ( we) have p(j) = J + ( J + 1 = ) J + 1. Since 1 represents X 0, it follows J 0 = Id = and thus p(j) = Hence the matrix J is a root of the equation X + 1 = 0. Complex numbers It is completely obvious that the equation x + 1 = 0 canot be solved using the real numbers. Mathematicians have therefore invented the imaginary number i. In other words one declares i = 1, and naturally also ( i) = 1. Once i is defined as a number, we must make sure we can compute i, 4 i, 1, i i 5, 4 i + i 3 5 and the like. So mathematicians have invented the number i, but this in turn immediately generates many other numbers, namely those that can be written as a 0 +a 1 i +a i + +a n i n b 0 +b 1 i +b i + +b m i m with a 1,, a n, b 1,, b m real. Once i is born, a whole set C, called set of complex numbers a 0+a 1 i +a i + +a n i n b 0 +b 1 i +b i + +b m i m with a 1,, a n, b 1,, b m comes along. Notice R is a subset of C, for if a R then a = a i C, and R C. An important theorem is the following. Theorem 0.1. If z C, i.e. z = a 0+a 1 i +a i + +a n i n b 0 +b 1 i +b i + +b m i m, a 1,, a n, b 1,, b m, then z can be written uniquely as: z = x + i y with x, y R. The real number x is called the real part of z, Re(z) := x, while the real number y is the imaginary part and we write Im(z), so that z = Re(z) + i Im(z). proof. From i = 1 it follows that z = a 0+a 1 i +a i + +a n i n b 0 +b 1 i +b i + +b m i m R. Besides, z = ( A+B i C+D i x = AC+BD and y = BC AD C +D C +D z = x + y i = x + y i and y y, we would have = A+B i, where A, B, C, D C+D i C +D. Therefore z = x + y i, with C D i )( ) = (AC+BD)+(BC AD) i C D i. Uniqueness is easy to prove. If there were z such that i = x x y y which implies i is real! Contradiction. Hence y = y and necessarily x = x. Sometimes the symbol 1 is used to indicate i, but be careful because ( 1)( 1) is not the same as 1 1. Ingegneria dell Autoveicolo, LeLing13 Geometria
3 With this result in the bag we may think of a complex number as a pair z = x + y i of real numbers. We can then imagine the complex number as being represented by the point (x, y) of the plane R. The inverse 1 z and the conjugate z Let z denote a complex number z = x + i y. The previous proof provides us with the idea of how to find the inverse 1 of a complex number. It is convenient to define first the z conjugate z = x y i of z as the complex number whose imaginary part is opposite to the imaginary part of z. Geometrically the conjugate is the symmetric point to z with respect to the x-axis. Two important properties are: Proposition 0.. Let z, w be complex numbers. Then: zw = zw z + w = z + w Using the first property repeatedly we have z n = z n. Observe z = z iff Im(z) = 0, i.e. iff z is real. Now the important remark: z.z = x + y The product of a number by its conjugate equals the distance squared of the point from the origin, i.e.the square of the modulus of the vector z. Since the modulus is z, z.z = z. From this the inverse is easy. Ingegneria dell Autoveicolo, LeLing13 3 Geometria
4 Proposition 0.3. The inverse 1 z of z 0 is 1 z = z z = x x + y y x + y i Proof. From the product z z z = zz z = z z = 1 we see that 1 z = z z, by definition. Example 0.4. The inverse of i is 1 i = i The inverse 1, together with the sum and the product allows to see C as a number z field 3. Two complex numbers z = x + y i, w = a + b i are multiplied as follows: z.w = (x + y i)(a + b i) = xa + xb i +ya i +yb i = xa + (xb + ya) i +yb( 1) so z.w = (xa yb) + (xb + ya) i. A famous formula: z w = (x + y )(a + b ) = (xa yb) + (xb + ya) = zw. This was Euler s starting point for proving Fermat s theorem 4, which states that the natural numbers of the form 4k + 1 are the sum of two squares. Notice at last that the real and imaginary parts can be found using conjugates: Re(z) = z + z Im(z) = z z i The number z is said purely imaginary if Re(z) = 0. Thus z is purely imaginary iff z = y i, y R. The condition z = z is necessary and sufficient for z to be purely imaginary. 3 First noticed by the mathematician Raffaele Bombelli from Bologna, in di Fermat sulle somme di due quadrati Ingegneria dell Autoveicolo, LeLing13 4 Geometria
5 Roots of real polynomials, conjugate roots &c. Although the polynomial p(x) = x + 1 is real, it has two complex roots i and i. Notice i is (by definition) the conjugate of i. This occurs to any real polynomial; if z is a complex root of the real equation a 0 + a 1 x + a x + + a n x n = 0, also its conjugate z is a root. In fact, because a 0, a 1,, a n are real we have so: a 0 + a 1 z + a z + + a n z n = 0 = 0 a 0 + a 1 z + a z + + a n z n = 0, a 0 + a 1 z + a z + + a n z n = 0, a 0 + a 1 z + a z + + a n z n = 0 and the conjugate z is a root of the same equation. Proposition 0.5. Let p(x) R[X] be a polynomial. If the complex number z C satisfies p(z) = 0, then the conjugate z satisfies p(z) = 0. Moreover, if Im(z) 0 the quadratic polynomial q(x) = (X z)(x z) = X (z+z)x +zz = X Re(z)X + z is real, i.e. q(x) R[X], and q(x) divides p(z). This result is a generalised theorem of Ruffini of sorts. As complex roots come in pairs, the proposition tells us that an odd-degree polynomial will always admit a real root. This can be proven in the Calculus (Mathematical Analysis) course by observing that the limits at infinity have different signs. The above result does not prove this fact because we do not (yet) know that all roots of a polynomial are complex numbers... At any rate, with complex numbers we are always capable of solving the quadratic equation with real coefficients a, b, c: ax + bx + c = 0. The formula b± b 4ac a will always spit out two numbers: real ones if b 4ac 0, complex if b 4ac < 0, i.e. b±i 4ac b a. Example 0.6. The roots of x + x + 1 = 0 are 1 ± 1 4 = 1 ± 3 = 1 ± 3 i Ingegneria dell Autoveicolo, LeLing13 5 Geometria
6 Euclides s algorithm. Already 300 years B.C. Euclides could easily compute the greatest common divisor gcd(a, b) 5 of a, b using this simple observation: Suppose a < b: (i) we may subtract a from b an integer number of times q, with a remainder r: b = a.q + r, 0 r < a (ii) gcd(a, b) is equal to gcd(r, a). To find gcd(a, b) it suffices to determine gcd(r, a); then we can go back to point (i) and find gcd(r, a), which is intuitively easier because r is smaller than a. Example 0.7. Using Euclides s observation over and over we can determine gcd(5341, 315). Now, gcd(5341, 315) = gcd(315, 1801) because 1801 is the remainder of the division between 5341 and 315. Then again, gcd(315, 1801) = gcd(1801, 1414), and again gcd(1414, 387) = gcd(387, 53). The idea is clear by now, so gcd(5341, 315) = gcd(315, 1801) = gcd(1801, 1414) = gcd(1414, 387) = = gcd(387, 53) = gcd(53, 134) = gcd(134, 119) = gcd(119, 15) = gcd(15, 14) = 1 Thus gcd(5341, 314) is 1, making 5341 and 314 relatively prime. Ancient Greeks were computing gcd(a, b) for a, b not even integer: given a, b, they were seeking a common unit d, i.e. a number d such that a, b became integer multiples of d. But if a, b are no longer integers, the algorithm does not necessarily end. one could continue subtracting the remainder indefinitely, without ever arriving at a zero remainder. Take for instance a = 1 and x larger than a = 1 and satisfying x 1 = 1 x 1. 5 Think of d = gcd(a, b) as a unit for measuring both a, b: a, b are integer multiples of d, and the latter is the largest number with such property. Ingegneria dell Autoveicolo, LeLing13 6 Geometria
7 0.1 Factorisation Geometria Lingotto. Since x > 1, 0 < x 1 < 1 so the remainder r of the division between a = 1 and x is r = 1 x: x 1 = 1 r. the ratio x over 1 equals the ratio 1 over the remainder r. But { b = b, a a b = q.a + r, 0 r < a = { a = a, r r b = q.a + r, 0 r < a so the division will go on forever, always having to divide 1 by a remainder standing in the same initial ratio x = 1 ; The example itself was conceived so that the procedure 1 r would not stop. Solving x x 1 = 0 we have x = 1 + 5, which represents the length od a regular pentagon of side length 1 6. The remainder r of the division between x and 1 is the diagonal of the inner pentagon drawn by the diagonals, whose side is 1 r. This proves that the division doesn t end, because there will always be a smaller pentagon (formed by the larger pentagon s diagonals). As the algorithm of Euclides applied to 1 and a rational number p q we have the following: definitely ends, Theorem 0.8. The numbers 1 and 1+ 5 are not commensurable, i.e is irrational Factorisation When a, b are integers, to find gcd(a, b) one must factorise a and b and then take the common prime factors raised to the minimum power. Mathematically, 6 The number x = 1+ 5 is called the golden ratio. 7 Discovered by Hippasus of Metapontum, disciple of the Pythagorean school; the legend has it that he was drowned at sea for breaking the pledge to secrecy about this fact. Ingegneria dell Autoveicolo, LeLing13 7 Geometria
8 0.1 Factorisation Geometria Lingotto. if a = i p a i i and b = i p b i i then 8 gcd(a, b) = i p min{a i,b i } i where p i is the sequence of prime numbers, p 1 =, p = 3, p 4 = 5, &c. Hence if the numbers a, b are easy to factorise the foregoing formula is useful to find gcd(a, b). But factorising a number is, generally speaking, hard, so we need a more efficient method to compute the gcd(a, b). Greatest common divisor of polynomials. The idea of Euclides can be employed to find gcd(p (X), Q(X)) for two given polynomials P (X), Q(X) 9 ; assuming deg(p (x)) deg(q(x)), if R(X) denotes the remander of the division P (X)/Q(X) we have: gcd(p (X), Q(X)) = gcd(q(x), R(X)). Since the degree of R(X) is smaller than the degree of P (X), after a finite number of steps the gcd(p (X), Q(X)) will be attained. Example 0.9. gcd(x 5 3X + 1, X 3 + X ) = gcd(x 3 + X, X + 4X 3) = = gcd( X + 4X 3, 15X 14) = gcd(15x 14, 31 5 ) = 1, making X 5 3X + 1 and X 3 + X relatively prime. 8 the power 0 indicates that the prime does not divide the given number, so that no factorisation is possible. 9 This goes back to the Persian mathematician Omar Khayyam ( ). Ingegneria dell Autoveicolo, LeLing13 8 Geometria
9 0.1 Factorisation Geometria Lingotto. Multiple roots of P (X) and gcd(p (X), P (X)). Let P (X) = a 0 + a 1 X + + a n X n = 0 be an algebraic equation of degree n. Ruffini s theorem 10 says that if one knows λ is a root of the previous equation, P (λ) = 0, then X λ divides P (X), and the other way around. Suppose then that for some reason we already know a root λ of P (X), and we need to find a second root. Ruffini s theorem reduces the problem to an equation of degree n 1. Its moral is, in fact, that if λ solvs the algebraic equation P (X) = 0, we may factorise P (X) = (X λ)q(x), so we are left with Q(X) = 0. The latter Q(X) is the quotient of P (X) by X λ. That s all. A root λ of P (X) = 0 is called multiple if λ annihilates, apart from P (X), also Q(X); this means (X λ) divides P (X). The largest exponent r such that (X λ) r divides P (X) is known as multiplicity of the root. A root of multiplicity one is called simple. It is striking that deciding whether P (X) has or not multiple roots does not requite the determination of said roots. Theorem A polynomial P (X) has one multiple root iff P (X) and its derivative P (X) are not relatively prime, i.e. gcd(p (X), P (X)) 1. Moreover, the multiple roots of P (X) are precisely the roots of gcd(p (X), P (X)). The next two examples explain the relevance of the theorem. Example Does the polynomial P (X) = X 5 5X 3 + 4X 1 admit multiple roots? The answer is no. After a few divisions one sees that gcd(x 5 5X 3 + 4X 1, 5X 4 15X + 4) = 1. On the other hand, Example 0.1. The polynomial P (X) = 4 + 8X + X 5X 3 X 4 + X 5 has multiple roots, for gcd(p (X), P (X)) is 3X + X 3, hence P (X) and P (X) are not coprime polynomials. The multiple roots are 1,, as one can easily check. 10 Contrary to conventional wisdom, Ruffini s theorem does not tell how to find a root of the algebraic equation P (X) = a 0 + a 1 X + + a n X n = 0. Ingegneria dell Autoveicolo, LeLing13 9 Geometria
1 Complex numbers and the complex plane
L1: Complex numbers and complex-valued functions. Contents: The field of complex numbers. Real and imaginary part. Conjugation and modulus or absolute valued. Inequalities: The triangular and the Cauchy.
More informationComplex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i
Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i 2 = 1 Sometimes we like to think of i = 1 We can treat
More information6x 3 12x 2 7x 2 +16x 7x 2 +14x 2x 4
2.3 Real Zeros of Polynomial Functions Name: Pre-calculus. Date: Block: 1. Long Division of Polynomials. We have factored polynomials of degree 2 and some specific types of polynomials of degree 3 using
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 information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
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 informationMultiplication of Polynomials
Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationAs the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic
Chapter 4 Three Famous Theorems As the title suggests, we tackle three famous theorems in this chapter. 4.1 The Fundamental Theorem of Arithmetic The goal of this section is to prove The Fundamental Theorem
More informationNotes on Polynomials from Barry Monson, UNB
Notes on Polynomials from Barry Monson, UNB 1. Here are some polynomials and their degrees: polynomial degree note 6x 4 8x 3 +21x 2 +7x 2 4 quartic 2x 3 +0x 2 + 3x + 2 3 cubic 2 2x 3 + 3x + 2 3 the same
More informationChapter Five Notes N P U2C5
Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have
More informationDeepening Mathematics Instruction for Secondary Teachers: Algebraic Structures
Deepening Mathematics Instruction for Secondary Teachers: Algebraic Structures Lance Burger Fresno State Preliminary Edition Contents Preface ix 1 Z The Integers 1 1.1 What are the Integers?......................
More information10.1 Complex Arithmetic Argand Diagrams and the Polar Form The Exponential Form of a Complex Number De Moivre s Theorem 29
10 Contents Complex Numbers 10.1 Complex Arithmetic 2 10.2 Argand Diagrams and the Polar Form 12 10.3 The Exponential Form of a Complex Number 20 10.4 De Moivre s Theorem 29 Learning outcomes In this Workbook
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 information1 Inhomogeneous linear systems.
Geometry at Lingotto. LeLing: Inhomogeneous linear systems. C ontents: Inhomogeneous linear systems. Gauß-Jordan for inhomogeneous systems. The general solution. General solution as sum of the homogeneous
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 informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationChapter 2. Divisibility. 2.1 Common Divisors
Chapter 2 Divisibility 2.1 Common Divisors Definition 2.1.1. Let a and b be integers. A common divisor of a and b is any integer that divides both a and b. Suppose that a and b are not both zero. By Proposition
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS
ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationChapter 3: Polynomial and Rational Functions
Chapter 3: Polynomial and Rational Functions 3.1 Polynomial Functions A polynomial on degree n is a function of the form P(x) = a n x n + a n 1 x n 1 + + a 1 x 1 + a 0, where n is a nonnegative integer
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 informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime
More informationComplex Numbers Introduction. Number Systems. Natural Numbers ℵ Integer Z Rational Q Real Complex C
Number Systems Natural Numbers ℵ Integer Z Rational Q R Real Complex C Number Systems Natural Numbers ℵ Integer Z Rational Q R Real Complex C The Natural Number System All whole numbers greater then zero
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More information1 Row elimination and row-equivalent matrices.
Geometria Lingotto LeLing: Echelon form and solutions C ontents: Row elimination and row-equivalent matrices Echelon form and solved systems Gauß-Jordan elimination and echelon form The general solution
More informationa + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:
5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.
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 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 informationChapter 8. Exploring Polynomial Functions. Jennifer Huss
Chapter 8 Exploring Polynomial Functions Jennifer Huss 8-1 Polynomial Functions The degree of a polynomial is determined by the greatest exponent when there is only one variable (x) in the polynomial Polynomial
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationChapter 2 Formulas and Definitions:
Chapter 2 Formulas and Definitions: (from 2.1) Definition of Polynomial Function: Let n be a nonnegative integer and let a n,a n 1,...,a 2,a 1,a 0 be real numbers with a n 0. The function given by f (x)
More informationComplex Numbers. Essential Question What are the subsets of the set of complex numbers? Integers. Whole Numbers. Natural Numbers
3.4 Complex Numbers Essential Question What are the subsets of the set of complex numbers? In your study of mathematics, you have probably worked with only real numbers, which can be represented graphically
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationPower and Polynomial Functions. College Algebra
Power and Polynomial Functions College Algebra Power Function A power function is a function that can be represented in the form f x = kx % where k and p are real numbers, and k is known as the coefficient.
More informationMath 261 Exercise sheet 5
Math 261 Exercise sheet 5 http://staff.aub.edu.lb/~nm116/teaching/2018/math261/index.html Version: October 24, 2018 Answers are due for Wednesday 24 October, 11AM. The use of calculators is allowed. Exercise
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 5-1 Chapter 5 Number Theory and the Real Number System 5.1 Number Theory Number Theory The study of numbers and their properties. The numbers we use to
More informationDividing Polynomials: Remainder and Factor Theorems
Dividing Polynomials: Remainder and Factor Theorems When we divide one polynomial by another, we obtain a quotient and a remainder. If the remainder is zero, then the divisor is a factor of the dividend.
More informationLeLing11: Determinants.
Geometria Lingotto LeLing11: Determinants C ontents: The erminant of a matrix: basic properties Computing erminats Multilinearity of the erminat Cramer s formulas R ecommended exercises: Geoling 11 Determinants
More informationIntroduction to Abstract Mathematics
Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of
More informationComplex Numbers. Rich Schwartz. September 25, 2014
Complex Numbers Rich Schwartz September 25, 2014 1 From Natural Numbers to Reals You can think of each successive number system as arising so as to fill some deficits associated with the previous one.
More informationPolynomial Functions
Polynomial Functions Polynomials A Polynomial in one variable, x, is an expression of the form a n x 0 a 1 x n 1... a n 2 x 2 a n 1 x a n The coefficients represent complex numbers (real or imaginary),
More informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
More information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More informationThe product of matrices
Geometria Lingotto LeLing9: Matrix multiplication C ontents: The product of two matrices Proof of the Rank theorem The algebra of square matrices: the product is not commutative Rotations and elementary
More informationAlgebra I Unit Report Summary
Algebra I Unit Report Summary No. Objective Code NCTM Standards Objective Title Real Numbers and Variables Unit - ( Ascend Default unit) 1. A01_01_01 H-A-B.1 Word Phrases As Algebraic Expressions 2. A01_01_02
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
More information3 COMPLEX NUMBERS. 3.0 Introduction. Objectives
3 COMPLEX NUMBERS Objectives After studying this chapter you should understand how quadratic equations lead to complex numbers and how to plot complex numbers on an Argand diagram; be able to relate graphs
More informationSolving Quadratic Equations by Formula
Algebra Unit: 05 Lesson: 0 Complex Numbers All the quadratic equations solved to this point have had two real solutions or roots. In some cases, solutions involved a double root, but there were always
More information( 3) ( ) ( ) ( ) ( ) ( )
81 Instruction: Determining the Possible Rational Roots using the Rational Root Theorem Consider the theorem stated below. Rational Root Theorem: If the rational number b / c, in lowest terms, is a root
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0)
More informationR1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member
Chapter R Review of basic concepts * R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member Ex: Write the set of counting numbers
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
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 informationIn Z: x + 3 = 2 3x = 2 x = 1 No solution In Q: 3x = 2 x 2 = 2. x = 2 No solution. In R: x 2 = 2 x = 0 x = ± 2 No solution Z Q.
THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF MATHEMATICS AND STATISTICS MATH 1141 HIGHER MATHEMATICS 1A ALGEBRA. Section 1: - Complex Numbers. 1. The Number Systems. Let us begin by trying to solve various
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
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 informationPOLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1
POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
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 informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationWe say that a polynomial is in the standard form if it is written in the order of decreasing exponents of x. Operations on polynomials:
R.4 Polynomials in one variable A monomial: an algebraic expression of the form ax n, where a is a real number, x is a variable and n is a nonnegative integer. : x,, 7 A binomial is the sum (or difference)
More informationMath Circles Complex Numbers, Lesson 2 Solutions Wednesday, March 28, Rich Dlin. Rich Dlin Math Circles / 24
Math Circles 018 Complex Numbers, Lesson Solutions Wednesday, March 8, 018 Rich Dlin Rich Dlin Math Circles 018 1 / 4 Warmup and Review Here are the key things we discussed last week: The numbers 1 and
More informationChapter 2 Polynomial and Rational Functions
Chapter 2 Polynomial and Rational Functions Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Quadratic Functions Polynomial Functions of Higher Degree Real Zeros of Polynomial Functions
More informationDivisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.
Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3
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 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 informationCoach Stones Expanded Standard Pre-Calculus Algorithm Packet Page 1 Section: P.1 Algebraic Expressions, Mathematical Models and Real Numbers
Coach Stones Expanded Standard Pre-Calculus Algorithm Packet Page 1 Section: P.1 Algebraic Expressions, Mathematical Models and Real Numbers CLASSIFICATIONS OF NUMBERS NATURAL NUMBERS = N = {1,2,3,4,...}
More informationChapter 3: Polynomial and Rational Functions
Chapter 3: Polynomial and Rational Functions 3.1 Polynomial Functions and Their Graphs A polynomial function of degree n is a function of the form P (x) = a n x n + a n 1 x n 1 + + a 1 x + a 0 The numbers
More information2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.
More informationL1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen
L1 2.1 Long Division of Polynomials and The Remainder Theorem Lesson MHF4U Jensen In this section you will apply the method of long division to divide a polynomial by a binomial. You will also learn to
More informationRadical Expressions and Graphs 8.1 Find roots of numbers. squaring square Objectives root cube roots fourth roots
8. Radical Expressions and Graphs Objectives Find roots of numbers. Find roots of numbers. The opposite (or inverse) of squaring a number is taking its square root. Find principal roots. Graph functions
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationLines, parabolas, distances and inequalities an enrichment class
Lines, parabolas, distances and inequalities an enrichment class Finbarr Holland 1. Lines in the plane A line is a particular kind of subset of the plane R 2 = R R, and can be described as the set of ordered
More informationNumber Theory. Henry Liu, 6 July 2007
Number Theory Henry Liu, 6 July 007 1. Introduction In one sentence, number theory is the area of mathematics which studies the properties of integers. Some of the most studied subareas are the theories
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationMath 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6
Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine
More informationKing Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)
Math 001 - Term 161 Recitation (R1, R) Question 1: How many rational and irrational numbers are possible between 0 and 1? (a) 1 (b) Finite (c) 0 (d) Infinite (e) Question : A will contain how many elements
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
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 informationAlgebraic. techniques1
techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them
More information, a 1. , a 2. ,..., a n
CHAPTER Points to Remember :. Let x be a variable, n be a positive integer and a 0, a, a,..., a n be constants. Then n f ( x) a x a x... a x a, is called a polynomial in variable x. n n n 0 POLNOMIALS.
More informationSMT 2013 Power Round Solutions February 2, 2013
Introduction This Power Round is an exploration of numerical semigroups, mathematical structures which appear very naturally out of answers to simple questions. For example, suppose McDonald s sells Chicken
More informationSection 1.3 Review of Complex Numbers
1 Section 1. Review of Complex Numbers Objective 1: Imaginary and Complex Numbers In Science and Engineering, such quantities like the 5 occur all the time. So, we need to develop a number system that
More informationAlgebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions
Algebra III Chapter 2 Note Packet Name Essential Question: Section 2.1: Polynomial Functions Polynomials -Have nonnegative exponents -Variables ONLY in -General Form n ax + a x +... + ax + ax+ a n n 1
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationThe minimal polynomial
The minimal polynomial Michael H Mertens October 22, 2015 Introduction In these short notes we explain some of the important features of the minimal polynomial of a square matrix A and recall some basic
More informationMAT116 Final Review Session Chapter 3: Polynomial and Rational Functions
MAT116 Final Review Session Chapter 3: Polynomial and Rational Functions Quadratic Function A quadratic function is defined by a quadratic or second-degree polynomial. Standard Form f x = ax 2 + bx + c,
More informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
More informationGCSE AQA Mathematics. Numbers
GCSE Mathematics Numbers Md Marufur Rahman Msc Sustainable Energy Systems Beng (Hons) Mechanical Engineering Bsc (Hons) Computer science & engineering GCSE AQA Mathematics 215/16 Table of Contents Introduction:...
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationBeautiful Mathematics
Beautiful Mathematics 1. Principle of Mathematical Induction The set of natural numbers is the set of positive integers {1, 2, 3,... } and is denoted by N. The Principle of Mathematical Induction is a
More informationPolynomial and Rational Functions. Chapter 3
Polynomial and Rational Functions Chapter 3 Quadratic Functions and Models Section 3.1 Quadratic Functions Quadratic function: Function of the form f(x) = ax 2 + bx + c (a, b and c real numbers, a 0) -30
More information