enow.com Web Search

  1. Ads

    related to: solving quadratic using the formula

Search results

  1. Results from the WOW.Com Content Network
  2. Solving quadratic equations with continued fractions

    en.wikipedia.org/wiki/Solving_quadratic...

    The quadratic equation on a number can be solved using the well-known quadratic formula, which can be derived by completing the square. That formula always gives the roots of the quadratic equation, but the solutions are expressed in a form that often involves a quadratic irrational number, which is an algebraic fraction that can be evaluated ...

  3. Quadratic formula - Wikipedia

    en.wikipedia.org/wiki/Quadratic_formula

    A similar but more complicated method works for cubic equations, which have three resolvents and a quadratic equation (the "resolving polynomial") relating ⁠ ⁠ and ⁠ ⁠, which one can solve by the quadratic equation, and similarly for a quartic equation (degree 4), whose resolving polynomial is a cubic, which can in turn be solved. [14]

  4. Quadratic equation - Wikipedia

    en.wikipedia.org/wiki/Quadratic_equation

    The amount of effort involved in solving quadratic equations using this mixed trigonometric and logarithmic table look-up strategy was two-thirds the effort using logarithmic tables alone. [36] Calculating complex roots would require using a different trigonometric form.

  5. Completing the square - Wikipedia

    en.wikipedia.org/wiki/Completing_the_square

    Completing the square is the oldest method of solving general quadratic equations, used in Old Babylonian clay tablets dating from 1800–1600 BCE, and is still taught in elementary algebra courses today.

  6. Chakravala method - Wikipedia

    en.wikipedia.org/wiki/Chakravala_method

    The chakravala method (Sanskrit: चक्रवाल विधि) is a cyclic algorithm to solve indeterminate quadratic equations, including Pell's equation.It is commonly attributed to Bhāskara II, (c. 1114 – 1185 CE) [1] [2] although some attribute it to Jayadeva (c. 950 ~ 1000 CE). [3]

  7. Quadratic programming - Wikipedia

    en.wikipedia.org/wiki/Quadratic_programming

    Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables.

  8. Quartic function - Wikipedia

    en.wikipedia.org/wiki/Quartic_function

    The four roots of the depressed quartic x 4 + px 2 + qx + r = 0 may also be expressed as the x coordinates of the intersections of the two quadratic equations y 2 + py + qx + r = 0 and y − x 2 = 0 i.e., using the substitution y = x 2 that two quadratics intersect in four points is an instance of Bézout's theorem.

  9. Quadratic function - Wikipedia

    en.wikipedia.org/wiki/Quadratic_function

    If a quadratic function is equated with zero, then the result is a quadratic equation. The solutions of a quadratic equation are the zeros (or roots) of the corresponding quadratic function, of which there can be two, one, or zero. The solutions are described by the quadratic formula. A quadratic polynomial or quadratic function can involve ...

  1. Ads

    related to: solving quadratic using the formula