Difference between revisions of "Remainder and Factor Theorem"
Jump to navigation
Jump to search
Line 1: | Line 1: | ||
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>. | 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 | + | ===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 d===ivided 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 <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>. | : 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 | + | ===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, <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>. | : 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>. | ||
Revision as of 11:20, 4 October 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 d===ivided by 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 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
- The Factor Theorem and Remainder Theorem, Mathematics LibreTexts
- Dividing Polynomials, Paul's Online Notes