What exponents are allowed in a polynomial term ?
The exponent must be a nonnegative integer, such as , and so on.
Study 06/14 6. Polynomial Expressions and Functions with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What exponents are allowed in a polynomial term axn?
The exponent n must be a nonnegative integer, such as 0,1,2,3, and so on.
What is the degree of f(x)=4x5−3x2+7?
The degree is 5, because 5 is the largest exponent with a nonzero coefficient.
How are polynomials added or subtracted?
Combine like terms: terms with the same variable raised to the same power.
How are two polynomials multiplied?
Use the distributive property: multiply every term in one polynomial by every term in the other, then combine like terms.
How can 9x2−25 be factored?
Apply the difference-of-squares identity: a2−b2=(a−b)(a+b). Thus, 9x2−25=(3x−5)(3x+5).
What does the Polynomial Division Algorithm state?
f(x)=d(x)q(x)+r(x), where the degree of r(x) is less than the degree of the nonzero divisor d(x).
Divide 2x3+3x2−5x+6 by x+2.
The quotient is 2x2−x−3, and the remainder is 12.
When is synthetic division used?
Synthetic division is a shortened method for division by a linear polynomial x−c; it uses only the dividend's coefficients.
What is the remainder when x3−4x2+2x+7 is divided by x−3?
By the Remainder Theorem, the remainder is f(3)=4.
State the Factor Theorem.
x−c is a factor of f(x) if and only if f(c)=0.
What is a zero of a polynomial function?
A zero is an input c for which f(c)=0; it is also the x-coordinate of an x-intercept.
What are the zero multiplicities of (x−2)3(x+1)2?
The zero x=2 has multiplicity 3, and x=−1 has multiplicity 2. Odd multiplicity generally crosses the axis; even multiplicity generally touches and turns.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.