Chapter 5 Polynomial and Rational Functions
- A polynomial function with real coeffcients of odd degree must have at least one real zero. In fact, such a polynomial function must have an odd number of real zeros.
- A polynomial function with real coeffcients of even degree must have either an even number of real zero or no real zero at all.
- The number of positive real zeros of $P$ either is equal to the number of variations in sign of $P(x)$ or is less than this number by an even number.
- The number of negative real zeros of $P$ either is equal to the number of variations in sign of $P(-x)$ or is less than this number by an even number.
- If $P(x)$ is divided synthetically by $x-r,$ where $r\gt0,$ and all numbers in the final row of the synthetic division are nonegative, then $r$ is an upper bound for the real zeros of $P.$
- If $P(x)$ is divided synthetically by $x-r,$ where $r\lt0,$ and the numbers in the final row of the synthetic division alternate sign (are alternately nonpositive and nonegative), then $r$ is a lower bound for the real zero $P.$
- Use the rational zero theorem to list all possible rational zeros.
- Use Descartes' rule of signs to determine the number of positve and negative real zeros.
- Use synthetic division along with the upper and lower cound rule to find a rational zero $r$ from the possible zeros listed in step $1$.
- Use the rational zero from step $3$ to write.
- Divide the interval $[a,b]$ into ten parts to form ten equal subintervals.
- Determine the subintercal in step $1$ where $P(x)$ changes sign.
- Divide the interval found in step $2$ into ten equal parts to form ten sub-intervals.
- Determine the subinterval in step $3$ where $P(x)$ changes sign.
- Continue the process until the desired accuracy is achieved.
- Find all the rational zeros $r_1\ldots r_k$ by using the procedure outline in Section 5.3.
- Use the rational zeros from step 1 to write \[ P(x)=(x-r_1)(x-r_2)\\ \cdots(x-r_k)Q(x) \] then use Descartes' rule of signs to determine if $Q(x)$ has any positive or negative irrartional zeros.
- Use synthetic divison along with the opposite sign property to determine an interval on which each irrational zero is located.
- Use the method of successive approximations or a calculator with graphing capabilities to approximate the irrational zeros to the desired degree of accuracy.
- the sign of its leading coefficient $a_n$, and
- whether $n$ is even or odd
- Determine the left and right behavior of the graph. Then determine the possible shapes for the middle of the gragh by considering relative extrema.
-
Determine the
$y$-intercept by evaluating $P(0).$ -
Determine the real zeros of the
function $P$. These real zeros are the
$x$-intercepts for the graph of $P.$ -
Determine the intervals into which the
$x$-intercepts divide the $x$-axis. Then select a few values of $x$ from each of these intervals and determine their corresponding outputs, $P(x).$ - Plot the points gathered in steps 2-4, and connect the points to form a smooth curve.
- \[ x\rightarrow\infty,\ f(x)\rightarrow b^+ \]
- \[ x\rightarrow\infty,\ f(x)\rightarrow b^- \]
- \[ x\rightarrow\infty,\ f(x)\rightarrow b^+ \]
- \[ x\rightarrow\infty,\ f(x)\rightarrow b^- \]
- One horizontal asymptote if the degree of $P(x)$ is less than or equal to the degree of $D(x).$
- No horizontal asymptote if the degree of $P(x)$ is greater than the degree of $D(x).$
- Step 1. Find the vertical asymptote(s) of the graph of $f$ and determine the appearance of the graph of $f$ as $x$ approaches each vertical asymptote from the left and from the right.
- Step 2. Find the horizontal asymptote of the graph of $f$ and determine the appearance of the graph of $f$ as $|x|\rightarrow\infty.$
-
Step 3.
- a. Find the $x$-intercept for the graph of $f.$
- b. Find the $y$-intercept for the graph of $f.$
- c. Determine whether the graph crosses its horizontal asymptote.
- Step 4. Plot the points from step 3 and, if necessary, plot a few additional points. Then sketch the graph.
- Distinct linear factors in the denominator
- Repeated linear facotrs in the denominator
- Distinct irreducible quadratic factors in the denominator
- Repeated irreducible quadratic factors in the denominator
Notes
Division Algorithm (Theorem)
For any polynomials $D$ and $P$ such that $D\left(x\right)\neq0$ and the degree of $D$ is less than the degree of $P,$ there exist unique polynomials $Q$ and $R$ such that the degree of $R$ is less than the degree of $D$ but greater than or equal to 0 and $P(x)=Q(x)D(x)+R(x).$
Remainder Theorem
For any number $x$ and $c$ such that $x\neq c$ and any polynomial $P,$ $P(x)=Q(x)(x-c)+P(c).$
Factorable polynomial
A polynomial $P\left(x\right)$ is factorable if there exist at least two polynomials $Q\left(x\right)$ and $D\left(x\right)$ such that $P\left(x\right)=Q\left(x\right)D\left(x\right).$
Prime polynomial
A polynomial is prime if and only if it is not factorable using integer coefficients.
Prime factorization, completely factored, polynomial
A polynomial is completely factored if and only if it is written as the product of prime polynomials with integer coefficients, except that monomial factors need not be factored. For instance, $6x^3$ doesn't have to be written out as $2\cdot3\cdot xxx.$
Note that a polynomial need not have integer coefficients to be prime. Thus, the stipulation that the prime factors have integer coefficients is not redundant.
Note that neither $(x-2)\left(x-\frac{1}{2}\right)$ nor $\frac{1}{2}(4x^2-5x+2)$ is a prime factorization of the polynomial $2x^2-\frac{5}{2}x+1,$ since $\frac{1}{2}$ is not an integer coefficient.
Some questions:
- Does the trinomial just mentioned have a prime factorization?
- Is every prime factorization of a polynomial unique, e.g. if $ab$ is a prime factorization of $p$ and $cd$ is a prime factorization of $p,$ then either $a=c$ and $b=d,$ or $a=d$ and $b=c$?
- Does every polynomial have a prime factorization, or do polynomials exist that do not have one?
Factor Theorem
For any numbers $x$ and $c,$ and any polynomial $P,$ $x-c$ is a factor of $P(x)$ if and only if $P(c)=0.$
Factor Definition
For any real numbers $a$ and $b,$ $b$ is a factor of $a$ if and only if there is a number $c$ such that $a=bc.$
Factor Theorem; Remainder Theorem; Factors; Polynomials
Consider functions $y_1$ and $y_2$ shown below:
fig. 1. Two Polynomials
Notice in particular the following facts about these functions:
Two different factorizations for each polynomial, $y_1(x)$ and $y_2(x),$ are given. Two factors are common to both $y_1(x)$ and $y_2(x),$ namely, $(x-2)$ and $\left(x-\frac{1}{2}\right).$ $y_1$ and $y_2$ have the same zeros, namely, 2 and $\frac{1}{2}.$ This can be seen on the graphs where $y_1$ and $y_2$ intersect.
Now, suppose you were given the polynomial $y_2(x)$ to factor completely, and you were told its two zeros to help you. By the Fundamental theorem of Algebra, you would know that there were no other zeros, and by the Factor Theorem you would know that $(x-2)$ and $\left(x-\frac{1}{2}\right)$ were factors of $y_2(x).$
From this information, you might conclude that for all $x,$ $y_2(x)=(x-2)\left(x-\frac{1}{2}\right).$ Yet, if that were true, then for all $x,$ $y_2(x)=y_1(x),$ since $y_1(x)$ has an identical factorization (see graph above). This cannot be, since $y_1$ and $y_2$ are not equal, as can be seen from their graphs which do not coincide except at their zeros.
The reason for the error is that neither the Factor Theorem nor the Fundamental Theorem says that a polynomial of $n$ degree has n unique factors, or that a polynomial with n roots has $n$ unique factors. (Is this not true precisely when any of the zeros are not integers?)
The very example of $y_1(x)$ and $y_2(x)$ above defies these notions, since two factorizations are displayed for each polynomial. Furthermore, notice that $y_1(x)$ has no prime factorization. (Is this true? Neither factorizations given are prime, but does the polynomial have no prime factorization?) Still, the following sentences are equivalent:
- $x-c$ is a factor of the polynomial $P.$
- $c$ is a zero of the function $P.$
- $c$ is a root of the equation $P(x)=0.$
The moral of the story is that given some or all of the zeros of a polynomial, one must use the Division Algorithm to find the complete factorization of the polynomial if either a) not all the zeros are given, or b) any of the zeros are not integers.
For each $c$ that is an integer and a zero of a polynomial, it is certain that the factor $x-c$ is part of the prime factorization. (Why? Since the prime factorization of a polynomial is unique? You haven’t read that claim anywhere, would need proof.) Therefore, any factor of the form $x-c,$ where $c$ is a zero and integer, could be used as the divisor in the division of the polynomial to find the remaining factors of its prime factorization.