A polynomial function consists of either zero or the sum of a finite number of non-zero terms, each of which is a product of a number, called the coefficient of the term, and a variable raised to a non-negative integer power. More precisely, a function f of one argument from a given domain is a polynomial function if there exists a polynomial + − − + ⋯ + + + that evaluates to () for all x in the domain of f (here, n is a non-negative integer and a 0, a 1, a 2, ..., a n are constant coefficients). For example: x 2 + 3x 2 = 4x 2, but x + x 2 cannot be written in a simpler form. If a function has a local minimum at a, then [latex]f\left(a\right)\le f\left(x\right)[/latex] for all x in an open interval around x = a. Because a polynomial function written in factored form will have an x-intercept where each factor is equal to zero, we can form a function that will pass through a set of x-intercepts by introducing a corresponding set of factors. If a polynomial doesn’t factor, it’s called prime because its only factors are 1 and itself. The same is true for very small inputs, say –100 or –1,000. When you are comfortable with a function, turn it off by clicking on the button to the left of the equation and move … Recall that we call this behavior the end behavior of a function. If a function has a local maximum at a, then [latex]f\left(a\right)\ge f\left(x\right)[/latex] for all x in an open interval around x = a. This means we will restrict the domain of this function to [latex]0
2020 polynomial function formula