Difference between revisions of "Remainder and Factor Theorem"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
Line 1: Line 1:
The polynomial division algorithm is as follows: suppose d(x) and p(x) are nonzero polynomials where the degree of p(x) is greater than or equal to the degree of d(x). Then there exist two unique polynomials, q(x) and r(x), such that  <math> p(x) = d(x)q(x) + r(x) </math>, where either r(x) = 0 or the degree of r(x) is strictly less than the degree of d(x).
+
The polynomial division algorithm is as follows: suppose <math> d(x) </math> and <math> p(x) </math> are nonzero polynomials where the degree of <math> p(x) </math> is greater than or equal to the degree of <math> d(x) </math>. Then there exist two unique polynomials, <math> q(x) </math> and <math> r(x) </math>, such that  <math> p(x) = d(x)q(x) + r(x) </math>, where either <math> r(x) = 0 </math> or the degree of <math> r(x) </math> is strictly less than the degree of <math> d(x) </math>.
  
Remainder Theorem: Suppose p(x) is a polynomial of degree at least 1 and c is a real number. When p(x) is divided by x − c the remainder is p(c).
+
Remainder Theorem: Suppose <math> p(x) </math> is a polynomial of degree at least 1 and c is a real number. When <math> p(x) </math> is divided by <math> x − c </math> the remainder is <math> p(c) </math>.
: Proof: By the division algorithm, <math> p(x) = (x - c)q(x) + r </math>, where r must be a constant since d(x) = x - c has a degree of 1. p(x) = (x - c)q(x) + r must hold for all values of x, so we can set x = c and get that <math> p(c) = (c - c)q(x) + r = r </math>. Thus the remainder r = p(c).
+
: Proof: By the division algorithm, <math> p(x) = (x - c)q(x) + r </math>, where r must be a constant since <math> d(x) = x - c </math> has a degree of 1. <math> p(x) = (x - c)q(x) + r </math> must hold for all values of <math> x </math>, so we can set <math> x = c </math> and get that <math> p(c) = (c - c)q(x) + r = r </math>. Thus the remainder <math> r = p(c) </math>.
  
Factor Theorem: Suppose p(x) is a nonzero polynomial. The real number c is a zero of p if and only if (x − c) is a factor of p(x).
+
Factor Theorem: Suppose <math> p(x) </math> is a nonzero polynomial. The real number <math> c </math> is a zero of <math> p(x) </math> if and only if <math> (x − c) </math> is a factor of <math> p(x) </math>.
: By the division algorithm, x - c is a factor of p(x) if and only if r = 0. So, since p(c) = r when p(x) is divided by x - c, x - c is a factor of p(x) if and only if p(c) = 0; that is, if c is a zero of p(x).
+
: By the division algorithm, <math> x - c </math> is a factor of <math> p(x) </math> if and only if <math> r = 0 </math>. So, since <math> p(c) = r </math> when <math> p(x) </math> is divided by <math> x - c </math>, <math> x - c </math> is a factor of <math> p(x) </math> if and only if <math> p(c) = 0 </math>; that is, if <math> c </math> is a zero of <math> p(x) </math>.
  
 
==Resources==
 
==Resources==
 
* [https://math.libretexts.org/Bookshelves/Precalculus/Book%3A_Precalculus_(StitzZeager)/03%3A_Polynomial_Functions/3.02%3A_The_Factor_Theorem_and_the_Remainder_Theorem The Factor Theorem and Remainder Theorem], Mathematics LibreTexts
 
* [https://math.libretexts.org/Bookshelves/Precalculus/Book%3A_Precalculus_(StitzZeager)/03%3A_Polynomial_Functions/3.02%3A_The_Factor_Theorem_and_the_Remainder_Theorem The Factor Theorem and Remainder Theorem], Mathematics LibreTexts
 
* [https://tutorial.math.lamar.edu/classes/alg/dividingpolynomials.aspx Dividing Polynomials], Paul's Online Notes
 
* [https://tutorial.math.lamar.edu/classes/alg/dividingpolynomials.aspx Dividing Polynomials], Paul's Online Notes

Revision as of 13:30, 22 September 2021

The polynomial division algorithm is as follows: suppose and are nonzero polynomials where the degree of is greater than or equal to the degree of . Then there exist two unique polynomials, and , such that , where either or the degree of is strictly less than the degree of .

Remainder Theorem: Suppose is a polynomial of degree at least 1 and c is a real number. When is divided by Failed to parse (syntax error): {\displaystyle x − c } the remainder is .

Proof: By the division algorithm, , where r must be a constant since has a degree of 1. must hold for all values of , so we can set and get that . Thus the remainder .

Factor Theorem: Suppose is a nonzero polynomial. The real number is a zero of if and only if Failed to parse (syntax error): {\displaystyle (x − c) } is a factor of .

By the division algorithm, is a factor of if and only if . So, since when is divided by , is a factor of if and only if ; that is, if is a zero of .

Resources