What is the standard form of a quadratic function?
A quadratic function has the form , where . Its graph is a parabola.
Study 07/14 7. Quadratic Functions and Equations with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is the standard form of a quadratic function?
A quadratic function has the form f(x)=ax2+bx+c, where a=0. Its graph is a parabola.
How does the sign of a affect a parabola?
If a>0, the parabola opens upward and has a minimum; if a<0, it opens downward and has a maximum.
What does vertex form reveal immediately?
For f(x)=a(x−h)2+k, the vertex is (h,k) and the axis of symmetry is x=h.
What do the factors reveal in factored form?
For f(x)=a(x−r1)(x−r2), the zeros are x=r1 and x=r2, giving the x-intercepts.
How do you find the vertex from standard form?
For f(x)=ax2+bx+c, the axis of symmetry is x=−2ab. Evaluate the function there to find the vertex's y-coordinate.
Find the vertex of f(x)=x2−6x+5.
The vertex is (3,−4), because the axis is x=3 and f(3)=−4.
What is the zero-product property?
If uv=0, then u=0 or v=0. This lets you solve a factored quadratic by setting each factor equal to zero.
Solve x2−7x+12=0 by factoring.
Factor: x2−7x+12=(x−3)(x−4). Therefore, x=3 or x=4.
What quantity completes the square in x2+bx?
For x2+bx, add (2b)2 to complete the square. Add the same quantity to both sides of an equation.
Solve x2+6x−7=0 by completing the square.
Rewrite as (x+3)2=16, then use both square roots: x+3=±4. Thus, x=1 or x=−7.
What is the quadratic formula?
For ax2+bx+c=0, use x=2a−b±b2−4ac. It solves every quadratic equation in standard form.
How does the discriminant classify solutions?
The discriminant is Δ=b2−4ac. If Δ>0, there are two distinct real solutions; if Δ=0, one repeated real solution; if Δ<0, no real solutions.
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.