Lagrange s polynomial

Size: px
Start display at page:

Download "Lagrange s polynomial"

Transcription

1 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 polynomial 2 2 Examples 3 3 Problems 10 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 N ) 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 49 + x 25 + 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) 2 = 5x. 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 x 27 + x 17 + x 9 + x 3 + x = (x 3 ) 9 + (x 3 ) 5 x 2 + (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. Use Lagrange s interpolation polynomial at nodes 0, 1,, n 3

4 we have P (x) = = = P (k) j k k k + 1 j k x j k j x j k j ( 1) n k k (k + 1)!(n k)! (x j). j k Therefore P (n + 1) = = ( 1) n k k (k + 1)!(n k)! ( 1) n k k (k + 1)!(n k)! = 1 = 1 = 1 (n + 1 j) j k k( 1) n k C k+1 n+2. (n + 1)! n + 1 k [ ] (k + 1)( 1) n k Cn+2 k+1 + ( 1) n k+1 Cn+2 k+1 ( ) n+1 ( 1) n k ()Cn+1 k + ( 1) n+2 i Cn+2 i = 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)! 4

5 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 (x 2 ),..., 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 = F (x k ) j k x x j x k x j, see the coefficient of x n we have F (x k ) 1 = x k x j j k F (x k ) x k x j < j k j k j k n! 2 n x k x j n! 2 n k j = 1 C k 2 n n = 1, a contradiction, and therefore at least one of the numbers F (x 0 ), F (x 1 ), F (x 2 ),..., F (x n ) is greater than or equal to n! 2 n. 5

6 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 P (x) 1 = 2 (P (k) 1) j k x j 2 k j = ( 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 ( ). k=1 i k Now, in ( ), setting x = 0 we have ( 1) n+1 n! = k=1 k n 1 k ( 1) n 1 n! (k 1)! (n k)! ( 1), n k and we are done. 6

7 Example 6. Let x, y, z and t be real numbers satisfying x 2 + y2 + z2 + t2 = x 2 + y2 + z2 + t2 = x y2 + z2 + t2 = x 2 + y2 + z2 + t2 = Determine x 2 + y 2 + z 2 + t 2. Solution 1. Setting l i = (2i 1) 2, c i = (2i) 2 i = 1, 4 and f(x) = 4 (x l i ) 4 (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 f(x) = 4 f(l i ) j i x l j l i l j. (1) From (1) and f(c j ) = 4 (c j l i ) j = 1, 4 we have 4 (c j l i ) = 4 f(l i ) k i c j l k l i l k j = 1, 4, and hence where α i = α 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 and therefore x 2 + y 2 + z 2 + t 2 = 4 α i = 36. Solution 2. From hypothesis we have x 2 w y2 w z2 w α i = 4 (c i l i ) = 36, t2 = 1 w {4, 16, 36, 64}, w 72 7

8 and therefore 4, 16, 36 and 64 are roots of the polynomial P (w) = 4 (w (2i 1) 2 ) x 2 (w 3 2 )(w 5 2 )(w 7 2 ) = w 4 (x 2 + 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 (x 2 + y 2 + z 2 + t ) = ( ), so x 2 + 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 = x 2, C = x 3, P = p, Q = q. By Lagrange s Interpolation polynomial at nodes x 1, x 2, 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 x 2 in the both sides we obtain (x 1 p)(x 1 q) (x 1 x 2 )(x 1 x 3 ) + (x 2 p)(x 2 q) (x 2 x 3 )(x 2 x 1 ) + (x 3 p)(x 3 q) (x 3 x 1 )(x 3 x 2 ) = 1, and therefore 1 x 1 p. x 1 q x 1 x 2. x 1 x 3 + x 2 p. x 2 q x 2 x 3. x 2 x 1 + x 3 p. x 3 q x 3 x 1. x 3 x 2, but x 2 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, 8

9 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. 9

10 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). Problem 9. Let t and n be fixed integers each at least 2. Find the largest positive integer m for which there exists a polynomial P, of degree n and 10

11 with rational coefficients, such that the following property holds: exactly one of P (k) and P (k) t k t k+1 is an integer for each k = 0, 1,..., m. Problem 10. Let f (x) = x n + a n 2 x n 2 + a n 3 x n a 1 x + a 0 be a polynomial. Prove that we have an i {1, 2,..., n} f (i) n! ( n i). Problem 11. Let (F n ) n 1 be the Fibonacci sequence F 1 = F 2 = 1, F n+2 = F n+1 + F n (n 1), and P (x) the polynomial of degree 990 satisfying Prove that P (1983) = F P (k) = F k, for k = 992,..., Problem 12. Let P (x) be a polynomial of degree n with real coefficients and let a 3. Prove that max a j P (j) 1. 0 j n+1 Problem 13. Let P (x) be a polynomial of degree n 10 with integral coefficients such that for every k {1, 2,..., 10} there is an integer m with P (m) = k. Furthermore, it is given that P (10) P (0) < Prove that for every integer k there is an integer m such that P (m) = k. Problem 14. Given is a natural number n 3. What is the smallest possible value of k if the following statements are true. For every n points A i = (x i, y i ) on a plane, where no three points are collinear, and for any real numbers c i (1 i n) there exists such polynomial P (x, y), the degree of which is no more than k, where P (x i, y i ) = c i for every i = 1,..., n. (The degree of a nonzero monomial a i,j x i y j is i + j, while the degree of polynomial P (x, y) is the greatest degree of the degrees of its monomials.) Problem 15. Find all P (x) R[x] such that r Q x Q : P (x) = r. Problem 16. Is it true that for any two increasing sequences a 1 < a 2 < < a n and b 1 < b 2 < < b n we can find a strictly increasing polynomial P [X] R[X] s.t. P (a i ) = b i for i = 1, 2,, n? Problem 17. Prove that, for infinitely many positive integers n, there exists a polynomial P of degree n with real coefficients such that P (1), P (2),, P (n+ 11

12 2) are different whole powers of 2. Problem 18. Suppose q 0, q 1, q 2,... is an infinite sequence of integers satisfying the following two conditions: (i) m n divides q m q n for m > n 0, (ii) there is a polynomial P such that q n < P (n) for all n Prove that there is a polynomial Q such that q n = Q(n) for all n. Problem 19. Let P R[x] such that for infty of integer number c : Equation P (x) = c has more than one integer root. Prove that P (x) = Q((x a) 2 ), where a R and Q is a polynomial. Problem 20. Find all the polynomials P(x) with odd degree such that P (x 2 2) = P 2 (x) 2. Problem Suppose p(x) is a polynomial with integer coefficients assumes at n distinct integral values of x that are different form 0 and in absolute value less than (n [ n 2 ])! 2 n [ n 2 ] Prove that p(x) is irreducible. Prove that the bound may be replaced by ( d 2 )n [ n 2 ] (n [ n 2 ])! where d is minimum distance between any two of the n integral values of x where p(x) assumes the integral values considered. Problem 22. Six members of the team of Fatalia for the IMO are selected from 13 candidates. At the TST the candidates got a 1, a 2,..., a 13 points with a i a j if i j. The team leader has already 6 candidates and now wants to see them and nobody other in the team. With that end in view he constructs a polynomial P (x) and finds the creative potential of each candidate by the formula c i = P (a i ). For what minimum n can he always find a polynomial P (x) of degree not exceeding n such that the creative potential of all 6 candidates is strictly more than that of the 7 others? Nguyen Trung Tuan tuan.nguyentrung@gmail.com 12

Lagrange s polynomial

Lagrange s polynomial 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

More information

Mathematical Olympiad Training Polynomials

Mathematical 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 information

Homework 8 Solutions to Selected Problems

Homework 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 information

Polynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:

Polynomials. 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 information

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

A 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 information

Chapter 2.7 and 7.3. Lecture 5

Chapter 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 information

Simplifying Rational Expressions and Functions

Simplifying 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 information

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

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 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 information

A Few Elementary Properties of Polynomials. Adeel Khan June 21, 2006

A 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 information

Coding Theory ( Mathematical Background I)

Coding 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 information

MTH310 EXAM 2 REVIEW

MTH310 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 information

Ch 7 Summary - POLYNOMIAL FUNCTIONS

Ch 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 information

PROBLEMS ON CONGRUENCES AND DIVISIBILITY

PROBLEMS ON CONGRUENCES AND DIVISIBILITY PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

PUTNAM 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 information

Rings. EE 387, Notes 7, Handout #10

Rings. 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 information

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Finite 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 information

Polynomial Review Problems

Polynomial 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 information

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 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 information

NORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST

NORTHWESTERN 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 information

MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6

MATH 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 information

This class will demonstrate the use of bijections to solve certain combinatorial problems simply and effectively.

This 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 information

May 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.

May 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 information

Math 4310 Solutions to homework 7 Due 10/27/16

Math 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 information

Polynomial Functions

Polynomial 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 information

g(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.

g(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 information

Polynomials. Henry Liu, 25 November 2004

Polynomials. 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 information

Polynomial Rings. (Last Updated: December 8, 2017)

Polynomial 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 information

Section III.6. Factorization in Polynomial Rings

Section III.6. Factorization in Polynomial Rings III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)

More information

Olympiad Number Theory Through Challenging Problems

Olympiad 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 information

IMO Training Camp Mock Olympiad #2 Solutions

IMO 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 information

7.4: Integration of rational functions

7.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 information

PEN Problems Book Extended. Version 0.9 (25th June, 2008)

PEN Problems Book Extended. Version 0.9 (25th June, 2008) PEN Problems Book Extended Version 0.9 (25th June, 2008) OVERTURE Welcome to PEN Problems Book Extended! The main purpose of Project PEN is to share an extensive collection of challenging problems with

More information

Homework 9 Solutions to Selected Problems

Homework 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 information

Polynomial Rings. i=0

Polynomial 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 information

Wilson s Theorem and Fermat s Little Theorem

Wilson 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 information

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings. i=0. i=0. n+m. i=0. k=0 Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

More information

Lecture 7: Polynomial rings

Lecture 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 information

15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012

15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012 1 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 01 1. Let f be the function such that f(x) = { x if x 1 x if x > 1 What is the total length of the graph of f(f(...f(x)...)) from x =

More information

Today. Polynomials. Secret Sharing.

Today. 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 information

Mathematical Foundations of Cryptography

Mathematical 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 information

Student: 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 information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

PUTNAM 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 information

King Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)

King 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 information

Prime Rational Functions and Integral Polynomials. Jesse Larone, Bachelor of Science. Mathematics and Statistics

Prime Rational Functions and Integral Polynomials. Jesse Larone, Bachelor of Science. Mathematics and Statistics Prime Rational Functions and Integral Polynomials Jesse Larone, Bachelor of Science Mathematics and Statistics Submitted in partial fulfillment of the requirements for the degree of Master of Science Faculty

More information

Algebra 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. 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

PUTNAM TRAINING PROBLEMS

PUTNAM 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 information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

1. Algebra 1.5. Polynomial Rings

1. 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 information

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes

PUTNAM 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

Twitter: @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 information

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MATH 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 information

Functions and Equations

Functions 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 information

Solutions, 2004 NCS/MAA TEAM COMPETITION

Solutions, 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 information

Handout - Algebra Review

Handout - Algebra Review Algebraic Geometry Instructor: Mohamed Omar Handout - Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much

More information

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 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 information

How might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5

How 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 information

MAT116 Final Review Session Chapter 3: Polynomial and Rational Functions

MAT116 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

Polynomials. Chapter 4

Polynomials. 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 information

Math 547, Exam 2 Information.

Math 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 information

Mathematics for Cryptography

Mathematics for Cryptography Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

More information

Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains

Contents. 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 information

Algebra Homework, Edition 2 9 September 2010

Algebra Homework, Edition 2 9 September 2010 Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.

More information

Winter Camp 2009 Number Theory Tips and Tricks

Winter 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 information

18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS

18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS 18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS Note. The terms root and zero of a polynomial are synonyms. Those problems which appeared on the Putnam Exam are stated as they appeared verbatim (except

More information

, a 1. , a 2. ,..., a n

, 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 information

Downloaded from

Downloaded 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 information

Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note

Reading 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 information

Commutative Rings and Fields

Commutative 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 information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18

More information

Rings. 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.

Rings. 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 information

RINGS: SUMMARY OF MATERIAL

RINGS: 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 information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

A Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks:

A Level. A Level Mathematics. Proof by Contradiction (Answers) AQA, Edexcel, OCR. Name: Total Marks: AQA, Edexcel, OCR A Level A Level Mathematics Proof by Contradiction (Answers) Name: Total Marks: A1 Proof Answers AQA, Edexcel, OCR 1) Prove that there is an infinite amount of prime numbers. Assume there

More information

MATH 150 Pre-Calculus

MATH 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 information

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?

x 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 information

Elementary Properties of Cyclotomic Polynomials

Elementary 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 information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

EASY PUTNAM PROBLEMS

EASY PUTNAM PROBLEMS EASY PUTNAM PROBLEMS (Last updated: December 11, 2017) Remark. The problems in the Putnam Competition are usually very hard, but practically every session contains at least one problem very easy to solve

More information

On a Theorem of Dedekind

On a Theorem of Dedekind On a Theorem of Dedekind Sudesh K. Khanduja, Munish Kumar Department of Mathematics, Panjab University, Chandigarh-160014, India. E-mail: skhand@pu.ac.in, msingla79@yahoo.com Abstract Let K = Q(θ) be an

More information

1. Group Theory Permutations.

1. Group Theory Permutations. 1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7

More information

Mathathon Round 1 (2 points each)

Mathathon Round 1 (2 points each) Mathathon Round ( points each). A circle is inscribed inside a square such that the cube of the radius of the circle is numerically equal to the perimeter of the square. What is the area of the circle?

More information

COMMUTATIVE RINGS. Definition 3: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

COMMUTATIVE RINGS. Definition 3: A domain is a commutative ring R that satisfies the cancellation law for multiplication: COMMUTATIVE RINGS Definition 1: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative

More information

Solutions for November. f(x + f(y)) = f(x) + y

Solutions for November. f(x + f(y)) = f(x) + y Solutions for November 647. Find all continuous functions f : R R such that for every x, y R. f(x + f(y)) = f(x) + y Solution 1. Setting (x, y) = (t, 0) yields f(t + f(0)) = f(t) for all real t. Setting

More information

Review all the activities leading to Midterm 3. Review all the problems in the previous online homework sets (8+9+10).

Review 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 information

Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours

Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Name: Please read the questions carefully. You will not be given partial credit on the basis of having misunderstood a question, and please

More information

Problems in Algebra. 2 4ac. 2a

Problems 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 information

Maths Extension 2 - Polynomials. Polynomials

Maths 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 information

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

φ(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

Algebra. Pang-Cheng, Wu. January 22, 2016

Algebra. 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 information

Chapter 4. Remember: F will always stand for a field.

Chapter 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 information

Skills Practice Skills Practice for Lesson 10.1

Skills 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

HANOI OPEN MATHEMATICAL COMPETITON PROBLEMS

HANOI OPEN MATHEMATICAL COMPETITON PROBLEMS HANOI MATHEMATICAL SOCIETY NGUYEN VAN MAU HANOI OPEN MATHEMATICAL COMPETITON PROBLEMS HANOI - 2013 Contents 1 Hanoi Open Mathematical Competition 3 1.1 Hanoi Open Mathematical Competition 2006... 3 1.1.1

More information

Twitter: @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 information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

More information

(2) Dividing both sides of the equation in (1) by the divisor, 3, gives: =

(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 information

6.1 Polynomial Functions

6.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 information

8.4 Partial Fractions

8.4 Partial Fractions 8.4 1 8.4 Partial Fractions Consider the following integral. (1) 13 2x x 2 x 2 dx How might we evaluate this? Suppose that, by some good luck, we knew that (2) 13 2x x 2 x 2 = 3 x 2 5 x+1 We could then

More information