Quadratic equation
In mathematics, a quadratic equation is a univariate polynomial equation of the second degree. A general quadratic equation can be written in the form
where x represents a variable or an unknown, and a, b, and c are constants with a ≠ 0. (If a = 0, the equation is a linear equation.)
The constants a, b, and c are called respectively, the quadratic coefficient, the linear coefficient and the constant term or free term. The term "quadratic" comes from quadratus, which is the Latin word for "square". Quadratic equations can be solved by factoring, completing the square, graphing, Newton's method, and using the quadratic formula (given below).
![](http://upload.wikimedia.org/wikipedia/commons/thumb/d/d1/Quadratic_equation_coefficients.png/300px-Quadratic_equation_coefficients.png)
Quadratic formula
A quadratic equation with real or complex coefficients has two solutions, called roots. These two solutions may or may not be distinct, and they may or may not be real.
The roots are given by the quadratic formula
where the symbol "±" indicates that both
are solutions of the quadratic equation.
Discriminant
![](http://upload.wikimedia.org/wikipedia/commons/thumb/e/e9/Quadratic_equation_discriminant.png/220px-Quadratic_equation_discriminant.png)
■ <0: x2+1⁄2
■ =0: −4⁄3x2+4⁄3x−1⁄3
■ >0: 3⁄2x2+1⁄2x−4⁄3
In the above formula, the expression underneath the square root sign is called the discriminant of the quadratic equation, and is often represented using an upper case D or an upper case Greek delta, the initial of the Greek word Διακρίνουσα, Diakrínousa, discriminant:
A quadratic equation with real coefficients can have either one or two distinct real roots, or two distinct complex roots. In this case the discriminant determines the number and nature of the roots. There are three cases:
- If the discriminant is positive, then there are two distinct roots, both of which are real numbers:
- For quadratic equations with integer coefficients, if the discriminant is a perfect square, then the roots are rational numbers—in other cases they may be quadratic irrationals.
- If the discriminant is zero, then there is exactly one distinct real root, sometimes called a double root:
- If the discriminant is negative, then there are no real roots. Rather, there are two distinct (non-real) complex roots, which are complex conjugates of each other:
- where i is the imaginary unit.
Thus the roots are distinct if and only if the discriminant is non-zero, and the roots are real if and only if the discriminant is non-negative.
Monic form
Dividing the quadratic equation by the quadratic coefficient a gives the simplified monic form of
where p = b/a and q = c/a. This in turn simplifies the root and discriminant equations somewhat to
and
bob
![]() |
The Babylonian mathematicians, as early as 2000 BC (displayed on Old Babylonian clay tablets) could solve a pair of simultaneous equations of the form:
which are equivalent to the equation:[1]
The original pair of equations were solved as follows:
- Form
- Form
- Form
- Form (where x ≥ y is assumed)
- Find x and y by inspection of the values in (1) and (4).[2]
There is evidence pushing this back as far as the Ur III dynasty.[3]
In the Sulba Sutras in ancient India circa 8th century BC quadratic equations of the form ax2 = c and ax2 + bx = c were explored using geometric methods. Babylonian mathematicians from circa 400 BC and Chinese mathematicians from circa 200 BC used the method of completing the square to solve quadratic equations with positive roots, but did not have a general formula.[citation needed]
Euclid, the Greek mathematician, produced a more abstract geometrical method around 300 BC. Pythagoras and Euclid used a strictly geometric approach, and found a general procedure to solve the quadratic equation. In his work Arithmetica, the Greek mathematician Diophantus solved the quadratic equation, but giving only one root, even when both roots were positive.[4]
In 628 AD, Brahmagupta, an Indian mathematician, gave the first explicit (although still not completely general) solution of the quadratic equation
as follows:
To the absolute number multiplied by four times the [coefficient of the] square, add the square of the [coefficient of the] middle term; the square root of the same, less the [coefficient of the] middle term, being divided by twice the [coefficient of the] square is the value. (Brahmasphutasiddhanta (Colebrook translation, 1817, page 346)[2]
This is equivalent to:
The Bakhshali Manuscript written in India in the 7th century AD contained an algebraic formula for solving quadratic equations, as well as quadratic indeterminate equations (originally of type ax/c = y).
Muhammad ibn Musa al-Khwarizmi (Persia, 9th century), inspired by Brahmagupta, developed a set of formulas that worked for positive solutions. Al-Khwarizmi goes further in providing a full solution to the general quadratic equation, accepting one or two numerical answers for every quadratic equation, while providing geometric proofs in the process.[5] He also described the method of completing the square and recognized that the discriminant must be positive,[6] which was proven by his contemporary 'Abd al-Hamīd ibn Turk (Central Asia, 9th century) who gave geometric figures to prove that if the discriminant is negative, a quadratic equation has no solution.[7] While al-Khwarizmi himself did not accept negative solutions, later Islamic mathematicians that succeeded him accepted negative solutions,[8] as well as irrational numbers as solutions.[9] Abū Kāmil Shujā ibn Aslam (Egypt, 10th century) in particular was the first to accept irrational numbers (often in the form of a square root, cube root or fourth root) as solutions to quadratic equations or as coefficients in an equation.[10]
The Jewish mathematician Abraham bar Hiyya Ha-Nasi (12th century, Spain) authored the first European book to include the full solution to the general quadratic equation.[11] His solution was largely based on Al-Khwarizmi's work.[12] The writing of the Chinese mathematician Yang Hui (1238-1298 AD) represents the first in which quadratic equations with negative coefficients of 'x' appear, although he attributes this to the earlier Liu Yi.
By 1545 Gerolamo Cardano compiled the works related to the quadratic equations. The quadratic formula covering all cases was first obtained by Simon Stevin in 1594.[13] In 1637 René Descartes published La Géométrie containing the quadratic formula in the form we know today. The first appearance of the general solution in the modern mathematical literature appeared in a 1896 paper by Henry Heaton.[14]
Examples of use
Geometry
![](http://upload.wikimedia.org/wikipedia/commons/thumb/f/f8/Polynomialdeg2.svg/200px-Polynomialdeg2.svg.png)
f (x) = x2 − x − 2 = (x + 1)(x − 2) of a real variable x, the x-coordinates of the points where the graph intersects the x-axis, x = −1 and x = 2, are the solutions of the quadratic equation: x2 − x − 2 = 0.
The solutions of the quadratic equation
are also the roots of the quadratic function:
since they are the values of x for which
If a, b, and c are real numbers and the domain of f is the set of real numbers, then the roots of f are exactly the x-coordinates of the points where the graph touches the x-axis.
It follows from the above that, if the discriminant is positive, the graph touches the x-axis at two points, if zero, the graph touches at one point, and if negative, the graph does not touch the x-axis.
Quadratic factorization
The term
is a factor of the polynomial
if and only if r is a root of the quadratic equation
It follows from the quadratic formula that
In the special case () where the quadratic has only one distinct root (i.e. the discriminant is zero), the quadratic polynomial can be factored as
Application to higher-degree equations
Certain higher-degree equations can be brought into quadratic form and solved that way. For example, the 6th-degree equation in x:
can be rewritten as:
or, equivalently, as a quadratic equation in a new variable u:
where
Solving the quadratic equation for u results in the two solutions:
Thus
Concentrating on finding the three cube roots of 2 + 2i – the other three solutions for x (the three cube roots of 2 - 2i ) will be their complex conjugates – rewriting the right-hand side using Euler's formula:
(since e2kπi = 1), gives the three solutions:
Using Eulers' formula again together with trigonometric identities such as cos(π/12) = (√2 + √6) / 4, and adding the complex conjugates, gives the complete collection of solutions as:
and
Derivations of the quadratic formula
By completing the square
The quadratic formula can be derived by the method of completing the square,[15] so as to make use of the algebraic identity:
Dividing the quadratic equation
by a (which is allowed because a is non-zero), gives:
or
The quadratic equation is now in a form to which the method of completing the square can be applied. To "complete the square" is to add a constant to both sides of the equation such that the left hand side becomes a complete square:
which produces
The right side can be written as a single fraction, with common denominator 4a2. This gives
Taking the square root of both sides yields
Isolating x, gives
By shifting ax2
![](http://upload.wikimedia.org/wikipedia/commons/thumb/7/70/Ax2_shift.svg/300px-Ax2_shift.svg.png)
The quadratic formula can be derived by starting with equation
which describes the parabola as ax2 with the vertex shifted from the origin to (xV, yV).
Solving this equation for x is straightforward and results in
Using Vieta's formulas for the vertex coordinates
the values of x can be written as
Note. The formulas for xV and yV can be derived by comparing the coefficients in
and
Rewriting the latter equation as
and comparing with the former results in
from which Vieta's expressions for xV and yV can be derived.
By Lagrange resolvents
An alternative way of deriving the quadratic formula is via the method of Lagrange resolvents, which is an early part of Galois theory.[16] A benefit of this method is that it generalizes to give the solution of cubic polynomials and quartic polynomials, and leads to Galois theory, which allows one to understand the solution of polynomials of any degree in terms of the symmetry group of their roots, the Galois group.
This approach focuses on the roots more than on rearranging the original equation. Given a monic quadratic polynomial
assume that it factors as
Expanding yields
where
and
Since the order of multiplication does not matter, one can switch α and β and the values of p and q will not change: one says that p and q are symmetric polynomials in α and β. In fact, they are the elementary symmetric polynomials – any symmetric polynomial in α and β can be expressed in terms of and αβ. The Galois theory approach to analyzing and solving polynomials is: given the coefficients of a polynomial, which are symmetric functions in the roots, can one "break the symmetry" and recover the roots? Thus solving a polynomial of degree n is related to the ways of rearranging ("permuting") n terms, which is called the symmetric group on n letters, and denoted For the quadratic polynomial, the only way to rearrange two terms is to swap them ("transpose" them), and thus solving a quadratic polynomial is simple.
To find the roots α and β, consider their sum and difference:
These are called the Lagrange resolvents of the polynomial; notice that these depend on the order of the roots, which is the key point. One can recover the roots from the resolvents by inverting the above equations:
Thus, solving for the resolvents gives the original roots.
Formally, the resolvents are called the discrete Fourier transform (DFT) of order 2, and the transform can be expressed by the matrix with inverse matrix The transform matrix is also called the DFT matrix or Vandermonde matrix.
Now is a symmetric function in α and β, so it can be expressed in terms of p and q, and in fact as noted above. Contrariwise, is not symmetric, since switching α and β yields (formally, this is termed a group action of the symmetric group of the roots). Since is not symmetric, it cannot be expressed in terms of the polynomials p and q, as these are symmetric in the roots and thus so is any polynomial expression involving them. However, changing the order of the roots only changes by a factor of and thus the square is symmetric in the roots, and thus expressible in terms of p and q. Using the equation
yields
and thus
- .
If one takes the positive root, breaking symmetry, one obtains:
and thus
Thus the roots are
which is the quadratic formula. Substituting yields the usual form for when a quadratic is not monic. The resolvents can be recognized as being the vertex, and is the discriminant (of a monic polynomial).
A similar but more complicated method works for cubic equations, where one has three resolvents and a quadratic equation (the "resolving polynomial") relating and which one can solve by the quadratic equation, and similarly for a quartic (degree 4) equation, whose resolving polynomial is a cubic, which can in turn be solved. However, the same method for a quintic equation yields a polynomial of degree 24, which does not simplify the problem, and in fact solutions to quintic equations in general cannot be expressed using only roots.
Other methods of root calculation
Alternative quadratic formula
In some situations it is preferable to express the roots in an alternative form.
This alternative requires c to be nonzero; for, if c is zero, the formula correctly gives zero as one root, but fails to give any second, non-zero root. Instead, one of the two choices for ∓ produces the indeterminate form 0/0, which is undefined. However, the alternative form works when a is zero (giving the unique solution as one root and division by zero again for the other), which the normal form does not (instead producing division by zero both times).
The roots are the same regardless of which expression we use; the alternative form is merely an algebraic variation of the common form:
The alternative formula can reduce loss of precision in the numerical evaluation of the roots, which may be a problem if one of the roots is much smaller than the other in absolute magnitude. In this case, b is very close to , and the subtraction in the numerator causes loss of significance.
A mixed approach avoids both all cancellation problems (only numbers of the same sign are added), and the problem of c being zero:
Here sgn denotes the sign function.
Floating point implementation
A careful floating point computer implementation differs a little from both forms to produce a robust result. Assuming the discriminant, b2 − 4ac, is positive and b is nonzero, the code will be something like the following:[17]
Here sgn(b) is the sign function, where sgn(b) is 1 if b is positive and −1 if b is negative; its use ensures that the quantities added are of the same sign, avoiding catastrophic cancellation. The computation of x2 uses the fact that the product of the roots is c/a. Note that while the above formulation avoids catastrophic cancellation between b and , there remains a form of cancellation between the terms b2 and −4ac of the discriminant, which can still lead to loss of up to half of correct significant figures.[18][19] The discriminant b2−4ac needs to be computed in arithmetic of twice the precision of the result to avoid this (e.g. quad precision if the final result is to be accurate to full double precision).[20]
Vieta's formulas
Vieta's formulas give a simple relation between the roots of a polynomial and its coefficients. In the case of the quadratic polynomial, they take the following form:
and
These results follow immediately from the relation:
which can be compared term by term with:
The first formula above yields a convenient expression when graphing a quadratic function. Since the graph is symmetric with respect to a vertical line through the vertex, when there are two real roots the vertex’s x-coordinate is located at the average of the roots (or intercepts). Thus the x-coordinate of the vertex is given by the expression:
The y-coordinate can be obtained by substituting the above result into the given quadratic equation, giving
As a practical matter, Vieta's formulas provide a useful method for finding the roots of a quadratic in the case where one root is much smaller than the other. If |x 2| << |x 1|, then x 1 + x 2 ≈ x 1, and we have the estimate:
The second Vieta's formula then provides:
These formulas are much easier to evaluate than the quadratic formula under the condition of one large and one small root, because the quadratic formula evaluates the small root as the difference of two very nearly equal numbers (the case of large b), which causes round-off error in a numerical evaluation. The figure shows the difference between (i) a direct evaluation using the quadratic formula (accurate when the roots are near each other in value) and (ii) an evaluation based upon the above approximation of Vieta's formulas (accurate when the roots are widely spaced). As the linear coefficient b increases, initially the quadratic formula is accurate, and the approximate formula improves in accuracy, leading to a smaller difference between the methods as b increases. However, at some point the quadratic formula begins to lose accuracy because of round off error, while the approximate method continues to improve. Consequently the difference between the methods begins to increase as the quadratic formula becomes worse and worse.
This situation arises commonly in amplifier design, where widely separated roots are desired to insure a stable operation (see step response).
Trigonometric solution for complex roots
In the case of complex roots the roots can also be found trigonometrically.[21]
Geometric Solution
![](http://upload.wikimedia.org/wikipedia/commons/thumb/d/d5/LillsQuadratic.svg/180px-LillsQuadratic.svg.png)
The quadratic equation may be solved geometrically in a number of ways. One way is via Lill's method. The three coefficients a, b, c are drawn with right angles between them as in SA, AB, and BC in the accompanying diagram. A circle is drawn with the start and end point SC as a diameter. If this cuts the middle line AB of the three then the equation has a solution, and the solutions are given by negative of the distance along this line from A divided by the first coefficient a or SA. If a is 1 the coefficients may be read off directly. Thus the solutions in the diagram are −AX1/SA and −AX2/SA.[22]
Generalization of quadratic equation
The formula and its derivation remain correct if the coefficients a, b and c are complex numbers, or more generally members of any field whose characteristic is not 2. (In a field of characteristic 2, the element 2a is zero and it is impossible to divide by it.)
The symbol
in the formula should be understood as "either of the two elements whose square is b2 − 4ac, if such elements exist". In some fields, some elements have no square roots and some have two; only zero has just one square root, except in fields of characteristic 2. Note that even if a field does not contain a square root of some number, there is always a quadratic extension field which does, so the quadratic formula will always make sense as a formula in that extension field.
Characteristic 2
In a field of characteristic 2, the quadratic formula, which relies on 2 being a unit, does not hold. Consider the monic quadratic polynomial
over a field of characteristic 2. If b = 0, then the solution reduces to extracting a square root, so the solution is
and note that there is only one root since
In summary,
See quadratic residue for more information about extracting square roots in finite fields.
In the case that b ≠ 0, there are two distinct roots, but if the polynomial is irreducible, they cannot be expressed in terms of square roots of numbers in the coefficient field. Instead, define the 2-root R(c) of c to be a root of the polynomial x2 + x + c, an element of the splitting field of that polynomial. One verifies that R(c) + 1 is also a root. In terms of the 2-root operation, the two roots of the (non-monic) quadratic ax2 + bx + c are
and
For example, let a denote a multiplicative generator of the group of units of F4, the Galois field of order four (thus a and a + 1 are roots of x2 + x + 1 over F4). Because (a + 1)2 = a, a + 1 is the unique solution of the quadratic equation x2 + a = 0. On the other hand, the polynomial x2 + ax + 1 is irreducible over F4, but it splits over F16, where it has the two roots ab and ab + a, where b is a root of x2 + x + a in F16.
This is a special case of Artin-Schreier theory.
See also
References
- ^ Stillwell 2004, p. 86
- ^ a b Stillwell 2004, p. 87
- ^ [1] Jöran Friberg, A Geometric Algorithm with Solutions to Quadratic Equations in a Sumerian Juridical Document from Ur III Umma, CDLI, 2009.
- ^ David Eugene Smith (1958). "History of mathematics". Courier Dover Publications. p.134. ISBN 0486204294
- ^ Katz & Barton 2007, pp. 190–191
- ^ (Boyer & Merzbach 1991, p. 230) "Al-Khwarizmi here calls attention to the fact that what we designate as the discriminant must be positive: "You ought to understand also that when you take the half of the roots in this form of equation and then multiply the half by itself; if that which proceeds or results from the multiplication is less than the units above mentioned as accompanying the square, you have an equation." [...] Once more the steps in completing the square are meticulously indicated, without justification,"
- ^ (Boyer & Merzbach 1991, p. 234) "The Algebra of al-Khwarizmi usually is regarded as the first work on the subject, but a recent publication in Turkey raises some questions about this. A manuscript of a work by 'Abd-al-Hamid ibn-Turk, entitled "Logical Necessities in Mixed Equations," was part of a book on Al-jabr wa'l muqabalah which was evidently very much the same as that by al-Khwarizmi and was published at about the same time - possibly even earlier. The surviving chapters on "Logical Necessities" give precisely the same type of geometric demonstration as al-Khwarizmi's Algebra and in one case the same illustrative example x2 + 21 = 10x. In one respect 'Abd-al-Hamad's exposition is more thorough than that of al-Khwarizmi for he gives geometric figures to prove that if the discriminant is negative, a quadratic equation has no solution. Similarities in the works of the two men and the systematic organization found in them seem to indicate that algebra in their day was not so recent a development as has usually been assumed. When textbooks with a conventional and well-ordered exposition appear simultaneously, a subject is likely to be considerably beyond the formative stage. [...] Note the omission of Diophantus and Pappus, authors who evidently were not at first known in Arabia, although the Diophantine Arithmetica became familiar before the end of the tenth century."
- ^ Katz & Barton 2007, p. 191
- ^ O'Connor, John J.; Robertson, Edmund F. (1999), "Arabic mathematics: forgotten brilliance?", MacTutor History of Mathematics Archive, University of St Andrews "Algebra was a unifying theory which allowed rational numbers, irrational numbers, geometrical magnitudes, etc., to all be treated as "algebraic objects"."
- ^ Jacques Sesiano, "Islamic mathematics", p. 148, in Selin, Helaine; D'Ambrosio, Ubiratan (2000), Mathematics Across Cultures: The History of Non-Western Mathematics, Springer, ISBN 1402002602
- ^ The Equation that Couldn't be Solved
- ^ Katz & Barton 2007, pp. 190–193
- ^ Struik, D. J.; Stevin, Simon (1958), The Principal Works of Simon Stevin, vol. II–B, C. V. Swets & Zeitlinger, p. 470, Extract page 470
- ^ Heaton, H. (1896) A Method of Solving Quadratic Equations, American Mathematical Monthly 3(10), 236–237.
- ^ Rich, Barnett; Schmidt, Philip (2004), Schaum's Outline of Theory and Problems of ELEMENTARY ALGEBRA, The McGraw-Hill Companies, ISBN 0-07-141083-X, Chapter 13 §4.4, p. 291
- ^ Prasolov, Viktor; Solovyev, Yuri (1997), Elliptic functions and elliptic integrals, AMS Bookstore, ISBN 978 0 82180587 9, §6.2, p. 134
- ^ Press, William H.; Flannery, Brian P.; Teukolsky, Saul A.; Vetterling, William T. (1992), Numerical Recipes in C (Second ed.), Section 5.6: "Quadratic and Cubic Equations.
- ^ W. Kahan (20 November 2004). "On the Cost of Floating-Point Computation Without Extra-Precise Arithmetic" (PDF).
- ^ Higham, Nicholas (2002). Accuracy and Stability of Numerical Algorithms (2nd ed.). SIAM. p. 10. ISBN 978-0898715217.
- ^ Hough, David. "Applications of the proposed IEEE 754 standard for floating point arithmetic". IEEE Computer. 14 (3): 70–74.
{{cite journal}}
: Text "Date March 1981" ignored (help) - ^ Simons, Stuart, "Alternative approach to complex roots of real quadratic equations", Mathematical Gazette 93, March 2009, 91-92.
- ^ Bixby, William Herbert (1879). Graphical Method for finding readily the Real Roots of Numerical Equations of Any Degree. West Point N. Y.
- Boyer, Carl B.; Merzbach, Uta C. (1991), "The Arabic Hegemony", A History of Mathematics (2nd ed.), Wiley, ISBN 0471543977
- Katz, Victor J.; Barton, Bill (October 2007), "Stages in the History of Algebra with Implications for Teaching", Educational Studies in Mathematics, 66 (2), Springer Netherlands: 185–201, doi:10.1007/s10649-006-9023-7
- Stillwell, John (January 27, 2004), Mathematics and Its History (2nd ed.), Springer, ISBN 0-387-95336-1