Lagrange s polynomial
|
|
- Drusilla Byrd
- 6 years ago
- Views:
Transcription
1 Lagrange s polynomial Nguyen Trung Tuan November 13, 2016 Abstract...In numerical analysis, Lagrange polynomials are used for polynomial interpolation. For a given set of distinct points x j and numbers y j, the Lagrange polynomial is the polynomial of the least degree that at each point x j assumes the corresponding value y j (i.e. the functions coincide at each point). The interpolating polynomial of the least degree is unique, however, and it is therefore more appropriate to speak of the Lagrange form of that unique polynomial rather than the Lagrange interpolation polynomial, since the same polynomial can be arrived at through multiple methods. Although named after Joseph Louis Lagrange, who published it in 1795, it was first discovered in 1779 by Edward Waring and it is also an easy consequence of a formula published in 1783 by Leonhard Euler... Wikipedia. In this article, I will use Lagrange polynomial to solve some polynomial problems from Mathematical Olympiads. Contents 1 Lagrange s interpolation polynomial 2 2 Examples 3 3 Problems 9 1
2 1 Lagrange s interpolation polynomial Theorem. Let n be a positive integer and x 0, x 1,, x n ; y 0, y 1,, y n are complex numbers such that x i x j if i j. Then there exists precisely one polynomial P (x) of degree not greater than n such that P (x i ) = y i i = 0, n. Proof. If P and Q are polynomials of degree not greater than n such that P (x i ) = Q(x i ) = y i i = 0, n then the polynomial P Q of degree not greater than n and has at least n + 1 distinct roots, therefore P Q is the zero polynomial and hence P = Q. x x j Now if P (x) = y i then P (x) is a polynomial of degree not x i x j i=0 j i greater than n and P (x i ) = y i i = 0, n. x x j The polynomial y i is called Lagrange s interpolation polynomial or Lagrange s polynomial at nodes x 0, x 1,, x n x i=0 i x j j i. Corollary. If P (x) is a polynomial of degree not greater than n (n Z, n > 0) and x 0, x 1,, x n are complex numbers such that x i x j if i j then P (x) = P (x i ) x x j. x i=0 i x j j i 2
3 2 Examples Example 1. Let A(x) = x 81 + x x 9 + x and B(x) = x 3 x be polynomials. Find the remainder in the division of A(x) by B(x). Solution 1. Asume Q(x) and R(x) are the quotient and remainder in the division of A(x) by B(x), respectively. We have A(x) = B(x)Q(x) + R(x), and deg R < 3. (1) Because B(0) = B(1) = B( 1) = 0 and (1) we have R(0) = 0, R(1) = 5 and R( 1) = 5, therefore use Lagrange s interpolation polynomial at nodes 0; 1 and 1 we have (x 1)(x + 1) 0)(x + 1) R(x) = R(0). +R(1).(x (0 1)(0 + 1) (1 0)(1 + 1) +R( 1). (x 0)(x 1) ( 1 0)( 1 1) = 5 2 x(x + 1) 5 x(x 1) = 5x. 2 Solution 2. We have x 3 x (mod B(x)) and therefore A(x) = (x 3 ) 27 + (x 3 ) 16 x + (x 3 ) 8 x + (x 3 ) 3 + x 7 + x 17 + x 9 + x 3 + x = (x 3 ) 9 + (x 3 ) 5 + (x 3 ) 3 + x 3 + x x 9 + x 7 + 2x 3 + x = (x 3 ) 3 + (x 3 ) 2 x + 2x 3 + x 4x 3 + x 5x (mod B(x)). Because deg(5x) = 1 < deg B(x), we have 5x is the remainder in the division of A(x) by B(x). Example 2. (USAMO 1975) Let P be a polynomial of degree n (n Z, n > 0) satisfying P (k) = k k = 0, n. Determine P (n + 1). k + 1 Solution 1. we have P (x) = Use Lagrange s interpolation polynomial at nodes 0, 1,, n P (k) j k x j k j = k x j k + 1 k j = j k ( 1) n k k (k + 1)!(n k)! (x j). j k Therefore P (n+1) = ( 1) n k k (k + 1)!(n k)! (n+1 j) = j k 3 ( 1) n k k (n + 1)!. (k + 1)!(n k)! n + 1 k
4 = 1 = 1 k( 1) n k C k+1 n+2 = 1 ( ) n+1 ( 1) n k ()Cn+1 k + ( 1) n+2 i Cn+2 i [ ] (k + 1)( 1) n k Cn+2 k+1 + ( 1) n k+1 Cn+2 k+1 = n ( 1)n+1. Solution 2. We have the polynomial Q(x) = (x + 1)P (x) x of degree n + 1 and 0, 1, 2,, n are its roots, therefore for some constant C. Because Q( 1) = 1, we have Q(x) = Cx(x 1)(x 2) (x n), C( 1)( 2)( 3) ( n 1) = ( 1) n+1 (n + 1)!C = 1, therefore C = ( 1)n+1 (n + 1)! and Q(x) = ( 1)n+1 x(x 1)(x 2) (x n). (n + 1)! Hence Q(n + 1) = ( 1)n+1 (n + 1)! (n + 1)! = ( 1)n+1. Q(n + 1) + n + 1 Note that P (n + 1) = = ( 1)n+1 + n + 1. n Therefore P (n + 1) is equal to 1 if n is odd and equal to if n is even. Example 3. (IMO Longlist 1977) Let n be a positive integer. Suppose x 0, x 1,..., x n are integers and x 0 > x 1 > > x n. Prove that at least one of the numbers F (x 0 ), F (x 1 ), F ( ),..., F (x n ), where F (x) = x n + a 1 x n a n ( a i R, i = 1,..., n) is greater than or equal to n! 2. n Solution. Assume that F (x i ) < n! i = 0, n. Use Lagrange s interpolation polynomial at nodes x 0, x 1,, x n we 2n have x n + a 1 x n a n = 4 F (x k ) j k x x j x k x j,
5 see the coefficient of x n we have F (x k ) 1 = x k x j j k j k n! 2 n k j = 1 2 n j k F (x k ) x k x j < Cn k = 1, j k n! 2 n x k x j a contradiction, and therefore at least one of the numbers F (x 0 ), F (x 1 ), F ( ),..., F (x n ) is greater than or equal to n! 2 n. Example 4. P (x) is a polynomial of degree 2n (n N) such that P (0) = P (2) = = P (2n) = 0, P (1) = P (3) = = P (2n 1) = 2, and P (2n + 1) = 30. Determine n. Solution. we have Use Lagrange s interpolation polynomial at nodes 0, 1, 2, 2n 2 P (x) 1 = (k) 1) (P x j 2 k j = j k ( 1) k+1 x j k j, j k and therefore P (2n + 1) 1 = 2 C k 2n+1 = 1 2 2n+1, but by hypothesis P (2n + 1) = 30, hence we have 31 = 1 2 2n+1, so n = 2. Example 5. (Tepper s identity) Prove that for any real number a we have the following identity ( ) n ( 1) k (a k) n = n! n N. k Solution. Assume that a = 0 and n 3, then we need to prove ( ) n ( 1) n+k (k) n = n! ( ). k By Lagrange s Interpolation polynomial at nodes 1, 2,, n we have x n (x 1)(x 2) (x n) = k n x i k i ( ). 5 k=1 i k
6 Now, in ( ), setting x = 0 we have and we are done. ( 1) n+1 n! = k=1 k n 1 k ( 1) n 1 n! (k 1)! (n k)! ( 1), n k Example 6. Let x, y, z and t be real numbers satisfying + y2 + z2 + t2 = y2 + z2 + t2 = y2 + z2 + t2 = y2 + z2 + t2 = Determine + y 2 + z 2 + t 2. Solution 1. Setting l i = (2i 1) 2, c i = (2i) 2 i = 1, 4 and f(x) = (x l i ) (x c i ). We have deg f 3, and therefore by Lagrange s Interpolation polynomial at nodes l 1, l 2, l 3, l 4 we obtain From (1) and f(c j ) = and hence where α i = f(x) = f(l i ) j i x l j l i l j. (1) (c j l i ) j = 1, 4 we have (c j l i ) = f(l i ) k i c j l k l i l k j = 1, 4, α 1 c j l 1 + α 2 c j l 2 + α 3 c j l 3 + α 4 c j l 4 = 1 j = 1, 4, f(l i ) j i (l i l j ) i = 1, 4. See coeficients of x 3 in both sides of (1) we have 6 α i = (c i l i ) = 36,
7 and therefore + y 2 + z 2 + t 2 = α i = 36. Solution 2. From hypothesis we have w y2 w z2 w t2 = 1 w {4, 16, 36, 64}, w 72 and therefore 4, 16, 36 and 64 are roots of the polynomial P (w) = (w (2i 1) 2 ) (w 3 2 )(w 5 2 )(w 7 2 ) = w 4 ( + y 2 + z 2 + t )w 3 + hence P (w) = (w 4)(w 16)(w 36)(w 64). By see coeficients of w 3 we have ( + y 2 + z 2 + t ) = ( ), so + y 2 + z 2 + t 2 = 36. Example 7. Let ABC be a triangle with BC = a, CA = b and AB = c. Prove that for any points P, Q in the plane (ABC) we have a.p A.QA + b.p B.QB + c.p C.QC abc. Solution. In the complex plane (ABC) we assume that A = x 1, B =, C = x 3, P = p, Q = q. By Lagrange s Interpolation polynomial at nodes x 1,, x 3 we have (x p)(x q) = 3 (x i p)(x i q) j i x x j x i x j, see coeficients of in the both sides we obtain (x 1 p)(x 1 q) (x 1 )(x 1 x 3 ) + ( p)( q) ( x 3 )( x 1 ) + (x 3 p)(x 3 q) (x 3 x 1 )(x 3 ) = 1, and therefore 1 x 1 p. x 1 q x 1. x 1 x 3 + p. q x 3. x 1 + x 3 p. x 3 q x 3 x 1. x 3, 7
8 but x 1 = AB, and x 1 p = AP,, therefore and we are done. 1 P A.QA AB.AC + P B.QB BC.BA + P C.QC CA.CB, Example 8. Find all polynomials P (x) with real coefficients such that for every positive integer n there exists a rational r with P (r) = n. Solution on AoPS. Assume that P (x) R[x] is a polynomial satisfying for every positive integer n there exists a rational r with P (r) = n. Clearly P (x) can t be constant, so d := deg P 1. For all n N take r n Q such that P (r n ) = n. P (r 1 ) = 1, P (r 2 ) = 2,..., P (r d+1 ) = d + 1 gives P (x) Q[x] using the Lagrange s interpolation polynomial at nodes r 1, r 2,, r d+1. Then for some t N we have tp (x) Z[x] with leading coefficient m Z \ {0}. But then tp (x) tn Z[x] has rational root r n and also leading coefficient m. So the denominator of r n divides m, i.e. r n 1 Z for all m n N. Now assume d = deg P 2. Then P (x) x + for x +, and we find N N large enough with P (x) x > 2 m for all x N. But 1 Z ( N, N) contains exactly 2 m N 1 elements. So among the m 2 m N different numbers r 1, r 2,..., r 2 m N 1 m Z we must find r k N for some k = 1,..., 2 m N. This gives 2 m < P (r k ) r k = k r k 2 m N N = 2 m, a contradiction. So we must have P (x) Q[x] with deg P = 1, which is indeed a solution for the problem. 8
9 3 Problems Problem 1. Let P be a polynomial of degree at most n satisfying P (k) = 1 k = 0, n. Determine P (n + 1). C k n+1 Problem 2. A polynomial P (x) has degree at most 2k, where k = 0, 1, 2,. Given that for an integer i, the inequality k i k implies P (i) 1, prove that for all real numbers x, with k x k, the following inequality holds: P (x) 2 2k. Problems 3. Prove that at least one of the numbers f(1), f(2),, f(n + 1) is greater than or equal to n! 2n. Where f(x) = x n + a 1 x n a n ( a i R, i = 1,..., n, n N.) Problem 4. Prove that any monic polynomial (a polynomial with leading coefficient 1) of degree n with real coefficients is the average of two monic polynomials of degree n with n real roots. Problem 5. Let p be a prime number and f an integer polynomial of degree d such that f(0) = 0, f(1) = 1 and f(n) is congruent to 0 or 1 modulo p for every integer n. Prove that d p 1. Problem 6. Let P be a polynomial of degree n N satisfying P (k) = 2 k k = 0, n. Prove that P (n + 1) = 2 n+1 1. Problem 7. P (x) is a polynomial of degree 3n (n N) such that P (0) = P (3) = = P (3n) = 2, P (1) = P (4) = = P (3n 2) = 1, Determine n. P (2) = P (5) = = P (3n 1) = 0, and P (3n + 1) = 730. Problem 8. Let S = {s 1, s 2, s 3,..., s n } be a set of n distinct complex numbers n 9, exactly n 3 of which are real. Prove that there are at most two quadratic polynomials f(z) with complex coefficients such that f(s) = S (that is, f permutes the elements of S). 9
Lagrange s polynomial
Lagrange s polynomial Nguyen Trung Tuan November 16, 2016 Abstract In this article, I will use Lagrange polynomial to solve some problems from Mathematical Olympiads. Contents 1 Lagrange s interpolation
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationPolynomial Review Problems
Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on
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 informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationA Few Elementary Properties of Polynomials. Adeel Khan June 21, 2006
A Few Elementary Properties of Polynomials Adeel Khan June 21, 2006 Page i CONTENTS Contents 1 Introduction 1 2 Vieta s Formulas 2 3 Tools for Finding the Roots of a Polynomial 4 4 Transforming Polynomials
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 informationChapter 2.7 and 7.3. Lecture 5
Chapter 2.7 and 7.3 Chapter 2 Polynomial and Rational Functions 2.1 Complex Numbers 2.2 Quadratic Functions 2.3 Polynomial Functions and Their Graphs 2.4 Dividing Polynomials; Remainder and Factor Theorems
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationCoding Theory ( Mathematical Background I)
N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures
More informationToday. Polynomials. Secret Sharing.
Today. Polynomials. Secret Sharing. A secret! I have a secret! A number from 0 to 10. What is it? Any one of you knows nothing! Any two of you can figure it out! Example Applications: Nuclear launch: need
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
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 informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
More informationPolynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:
Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a
More informationFunctions and Equations
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario Euclid eworkshop # Functions and Equations c 006 CANADIAN
More informationCh 7 Summary - POLYNOMIAL FUNCTIONS
Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)
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 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 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 informationDownloaded from
Question 1: Exercise 2.1 The graphs of y = p(x) are given in following figure, for some polynomials p(x). Find the number of zeroes of p(x), in each case. (i) (ii) (iii) Page 1 of 24 (iv) (v) (v) Page
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
More informationMATH 150 Pre-Calculus
MATH 150 Pre-Calculus Fall, 2014, WEEK 2 JoungDong Kim Week 2: 1D, 1E, 2A Chapter 1D. Rational Expression. Definition of a Rational Expression A rational expression is an expression of the form p, where
More informationx 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?
1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number
More information7.4: Integration of rational functions
A rational function is a function of the form: f (x) = P(x) Q(x), where P(x) and Q(x) are polynomials in x. P(x) = a n x n + a n 1 x n 1 + + a 0. Q(x) = b m x m + b m 1 x m 1 + + b 0. How to express a
More informationReview all the activities leading to Midterm 3. Review all the problems in the previous online homework sets (8+9+10).
MA109, Activity 34: Review (Sections 3.6+3.7+4.1+4.2+4.3) Date: Objective: Additional Assignments: To prepare for Midterm 3, make sure that you can solve the types of problems listed in Activities 33 and
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 informationStudent: Date: Instructor: kumnit nong Course: MATH 105 by Nong https://xlitemprodpearsoncmgcom/api/v1/print/math Assignment: CH test review 1 Find the transformation form of the quadratic function graphed
More informationMaths Extension 2 - Polynomials. Polynomials
Maths Extension - Polynomials Polynomials! Definitions and properties of polynomials! Factors & Roots! Fields ~ Q Rational ~ R Real ~ C Complex! Finding zeros over the complex field! Factorization & Division
More informationProblems in Algebra. 2 4ac. 2a
Problems in Algebra Section Polynomial Equations For a polynomial equation P (x) = c 0 x n + c 1 x n 1 + + c n = 0, where c 0, c 1,, c n are complex numbers, we know from the Fundamental Theorem of Algebra
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationPolynomials. Henry Liu, 25 November 2004
Introduction Polynomials Henry Liu, 25 November 2004 henryliu@memphis.edu This brief set of notes contains some basic ideas and the most well-known theorems about polynomials. I have not gone into deep
More informationSkills Practice Skills Practice for Lesson 10.1
Skills Practice Skills Practice for Lesson.1 Name Date Higher Order Polynomials and Factoring Roots of Polynomial Equations Problem Set Solve each polynomial equation using factoring. Then check your solution(s).
More information(2) Dividing both sides of the equation in (1) by the divisor, 3, gives: =
Dividing Polynomials Prepared by: Sa diyya Hendrickson Name: Date: Let s begin by recalling the process of long division for numbers. Consider the following fraction: Recall that fractions are just division
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationReading Mathematical Expressions & Arithmetic Operations Expression Reads Note
Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ
More informationMEMORIAL UNIVERSITY OF NEWFOUNDLAND
MEMORIAL UNIVERSITY OF NEWFOUNDLAND DEPARTMENT OF MATHEMATICS AND STATISTICS Section 5. Math 090 Fall 009 SOLUTIONS. a) Using long division of polynomials, we have x + x x x + ) x 4 4x + x + 0x x 4 6x
More information6.1 Polynomial Functions
6.1 Polynomial Functions Definition. A polynomial function is any function p(x) of the form p(x) = p n x n + p n 1 x n 1 + + p 2 x 2 + p 1 x + p 0 where all of the exponents are non-negative integers and
More informationSolutions, 2004 NCS/MAA TEAM COMPETITION
Solutions, 004 NCS/MAA TEAM COMPETITION Each problem number is followed by an 11-tuple (a 10, a 9, a 8, a 7, a 6, a 5, a 4, a 3, a, a 1, a 0 ), where a k is the number of teams that scored k points on
More informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
More informationChapter 4. Remember: F will always stand for a field.
Chapter 4 Remember: F will always stand for a field. 4.1 10. Take f(x) = x F [x]. Could there be a polynomial g(x) F [x] such that f(x)g(x) = 1 F? Could f(x) be a unit? 19. Compare with Problem #21(c).
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 informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
More informationThis class will demonstrate the use of bijections to solve certain combinatorial problems simply and effectively.
. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationQuestion 1: The graphs of y = p(x) are given in following figure, for some Polynomials p(x). Find the number of zeroes of p(x), in each case.
Class X - NCERT Maths EXERCISE NO:.1 Question 1: The graphs of y = p(x) are given in following figure, for some Polynomials p(x). Find the number of zeroes of p(x), in each case. (i) (ii) (iii) (iv) (v)
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 informationIMO Training Camp Mock Olympiad #2 Solutions
IMO Training Camp Mock Olympiad #2 Solutions July 3, 2008 1. Given an isosceles triangle ABC with AB = AC. The midpoint of side BC is denoted by M. Let X be a variable point on the shorter arc MA of the
More informationPartial Fractions. Calculus 2 Lia Vas
Calculus Lia Vas Partial Fractions rational function is a quotient of two polynomial functions The method of partial fractions is a general method for evaluating integrals of rational function The idea
More information3 Polynomial and Rational Functions
3 Polynomial and Rational Functions 3.1 Polynomial Functions and their Graphs So far, we have learned how to graph polynomials of degree 0, 1, and. Degree 0 polynomial functions are things like f(x) =,
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
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 informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationPARTIAL FRACTIONS AND POLYNOMIAL LONG DIVISION. The basic aim of this note is to describe how to break rational functions into pieces.
PARTIAL FRACTIONS AND POLYNOMIAL LONG DIVISION NOAH WHITE The basic aim of this note is to describe how to break rational functions into pieces. For example 2x + 3 1 = 1 + 1 x 1 3 x + 1. The point is that
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More informationGreat Theoretical Ideas in Computer Science
15-251 Great Theoretical Ideas in Computer Science Polynomials, Lagrange, and Error-correction Lecture 23 (November 10, 2009) P(X) = X 3 X 2 + + X 1 + Definition: Recall: Fields A field F is a set together
More informationXX Asian Pacific Mathematics Olympiad
XX Asian Pacific Mathematics Olympiad March, 008 Problem 1. Let ABC be a triangle with A < 60. Let X and Y be the points on the sides AB and AC, respectively, such that CA + AX = CB + BX and BA + AY =
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
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 informationx 2 + 6x 18 x + 2 Name: Class: Date: 1. Find the coordinates of the local extreme of the function y = x 2 4 x.
1. Find the coordinates of the local extreme of the function y = x 2 4 x. 2. How many local maxima and minima does the polynomial y = 8 x 2 + 7 x + 7 have? 3. How many local maxima and minima does the
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 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 information4 Unit Math Homework for Year 12
Yimin Math Centre 4 Unit Math Homework for Year 12 Student Name: Grade: Date: Score: Table of contents 3 Topic 3 Polynomials Part 2 1 3.2 Factorisation of polynomials and fundamental theorem of algebra...........
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 informationPolynomial Functions and Models
1 CA-Fall 2011-Jordan College Algebra, 4 th edition, Beecher/Penna/Bittinger, Pearson/Addison Wesley, 2012 Chapter 4: Polynomial Functions and Rational Functions Section 4.1 Polynomial Functions and Models
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 information9.5. Polynomial and Rational Inequalities. Objectives. Solve quadratic inequalities. Solve polynomial inequalities of degree 3 or greater.
Chapter 9 Section 5 9.5 Polynomial and Rational Inequalities Objectives 1 3 Solve quadratic inequalities. Solve polynomial inequalities of degree 3 or greater. Solve rational inequalities. Objective 1
More informationPARTIAL FRACTIONS AND POLYNOMIAL LONG DIVISION. The basic aim of this note is to describe how to break rational functions into pieces.
PARTIAL FRACTIONS AND POLYNOMIAL LONG DIVISION NOAH WHITE The basic aim of this note is to describe how to break rational functions into pieces. For example 2x + 3 = + x 3 x +. The point is that we don
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a
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 informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More informationSB CH 2 answers.notebook. November 05, Warm Up. Oct 8 10:36 AM. Oct 5 2:22 PM. Oct 8 9:22 AM. Oct 8 9:19 AM. Oct 8 9:26 AM.
Warm Up Oct 8 10:36 AM Oct 5 2:22 PM Linear Function Qualities Oct 8 9:22 AM Oct 8 9:19 AM Quadratic Function Qualities Oct 8 9:26 AM Oct 8 9:25 AM 1 Oct 8 9:28 AM Oct 8 9:25 AM Given vertex (-1,4) and
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 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 informationSpring Nikos Apostolakis
Spring 07 Nikos Apostolakis Review of fractions Rational expressions are fractions with numerator and denominator polynomials. We need to remember how we work with fractions (a.k.a. rational numbers) before
More informationElementary Properties of Cyclotomic Polynomials
Elementary Properties of Cyclotomic Polynomials Yimin Ge Abstract Elementary properties of cyclotomic polynomials is a topic that has become very popular in Olympiad mathematics. The purpose of this article
More informationarithmetic properties of weighted catalan numbers
arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers
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 informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
More informationLesson 7.1 Polynomial Degree and Finite Differences
Lesson 7.1 Polynomial Degree and Finite Differences 1. Identify the degree of each polynomial. a. 3x 4 2x 3 3x 2 x 7 b. x 1 c. 0.2x 1.x 2 3.2x 3 d. 20 16x 2 20x e. x x 2 x 3 x 4 x f. x 2 6x 2x 6 3x 4 8
More informationDRAFT (Justin Stevens) Updated December 29, 2017
Intermediate Number Theory Justin Stevens FOURTH EDITION Mathematics is the queen of sciences and number theory is the queen of mathematics. Carl Friedrich Gauss c 017 Justin Stevens. All rights reserved.
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More information3 What is the degree of the polynomial function that generates the data shown below?
hapter 04 Test Name: ate: 1 For the polynomial function, describe the end behavior of its graph. The leading term is down. The leading term is and down.. Since n is 1 and a is positive, the end behavior
More informationHow might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5
8.4 1 8.4 Partial Fractions Consider the following integral. 13 2x (1) x 2 x 2 dx How might we evaluate this? Suppose that, by some good luck, we knew that 13 2x (2) x 2 x 2 = 3 x 2 5 x + 1 We could then
More informationAlgebra. Pang-Cheng, Wu. January 22, 2016
Algebra Pang-Cheng, Wu January 22, 2016 Abstract For preparing competitions, one should focus on some techniques and important theorems. This time, I want to talk about a method for solving inequality
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More information