totaleclipse2 said:
Find the roots and set those equal to 0 and solve, place the points on the graph. I think I may have figured it out. Is it that you take the sum of the coefficients, and that is a factor. Then you use that factor to synthetically divide the cubic, to get it into the quadratic. Afterwards, you solve the quadratic by either factoring it our or with the quadratic formula, giving you the remaining two roots? If that is right, how do you determine the shape of the graph with those points? Doesn't the leading coefficient determine the number of turns?
Whoa.
f(x) = ax[sup:3p0ib92i]n[/sup:3p0ib92i] + bx[sup:3p0ib92i](n-1)[/sup:3p0ib92i] + ... z.
The leading coefficient of a polynomial in conjunction with the leading power tells you about the sign of the slope and the sign of the value of the polynomial far from zero. The reason is that, when the absolute value of x is large, the term in the largest power of x dominates all the rest of the terms. If |x| >> 0, then [f(x) / ax[sup:3p0ib92i]n[/sup:3p0ib92i]] is approximately 1 so f(x) looks very similar to ax[sup:3p0ib92i]n[/sup:3p0ib92i].
The sum of the coefficients of a cubic is neither a factor nor a root of the cubic.
Example: the roots of x[sup:3p0ib92i]3[/sup:3p0ib92i] - 7x - 6 are - 2, - 1, and 3.
1 - 7 = - 6, which is not a root.
1 - 7 - 6 = - 12, which is not a root.
The MAXIMUM number of turns is (n - 1), 1 less than the highest power in the polynomial. There may be fewer.
If the highest power is odd, 1 <= the number of roots <= n, and 0 <= the number of turns <= (n - 1).
If the highest power is even, 0 <= the number of roots 0 <= n <= n, and 1<= the number of turns <= (n - 1).