n.
An equation in which one or more of the terms is squared but raised to no higher power, having the general form ax2 + bx + c = 0, where a, b, and c are constants.
| Dictionary: quadratic equation |
An equation in which one or more of the terms is squared but raised to no higher power, having the general form ax2 + bx + c = 0, where a, b, and c are constants.
| 5min Related Video: quadratic equation |
| Britannica Concise Encyclopedia: quadratic equation |
which guarantees two real-number solutions, one real-number solution, or two complex-number solutions, depending on whether the discriminate, b2 - 4ac, is greater than, equal to, or less than 0.For more information on quadratic equation, visit Britannica.com.
| WordNet: quadratic equation |
The noun has one meaning:
Meaning #1:
an equation in which the highest power of an unknown quantity is a square
Synonym: quadratic
| Wikipedia: Quadratic equation |
In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is

where x represents a variable, and a, b, and c, represent constants, with a ≠ 0. (If a = 0, the equation becomes 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. Quadratic comes from quadratus, which is the Latin word for "square."
Contents |
A quadratic equation with real or complex coefficients has two, but not necessarily distinct, solutions, called roots, which may or may not be real, given by the quadratic formula:

where the symbol "±" indicates that both
![]() |
and | ![]() |
are solutions.
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 Greek Delta (Δ).
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:

![]() |
and | ![]() |
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.
The roots of the quadratic equation

are also the zeros 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 zeros 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.
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

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 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

The Babylonians, as early as 1800 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:




by inspection of the values in (1) and (4).[2]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. Euclid, the Greek mathematician, produced a more abstract geometrical method around 300 BC.
In 628 AD, Brahmagupta, an Indian mathematician, gave the first explicit (although still not completely general) solution of the quadratic equation:

| “ | 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 dated to have been 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). Mohammad bin Musa Al-kwarismi (Persia, 9th century) developed a set of formulas that worked for positive solutions based on Brahmagupta.[3] The Catalan Jewish mathematician Abraham bar Hiyya Ha-Nasi authored the first book to include the full solution to the general quadratic equation.[4]
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. The first appearance of the general solution in the modern mathematical literature is evidently in an 1896 paper by Henry Heaton.[5]
The quadratic formula can be derived by the method of completing the square, 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 find some constant k such that

for another constant h. In order for these equations to be true,

or

and

thus

Adding this constant to equation (1) produces

The left side is now a perfect square because

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

An alternative way of deriving the quadratic formula is via the method of Lagrange resolvents, which is an early part of Galois theory.[6] 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 x2 + px + q, and assume that it factors as x2 + px + q = (x − α)(x − β). Expanding this out yields
so p = − (α + β),q = αβ. 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 Sn. For the quadratic polynomial, the only way to rearrange 2 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 r1 = α + β is a symmetric function in α and β, so it can be expressed in terms of p and q, and in fact r1 = − p, as noted above. Contrariwise, r2 = α − β is not symmetric, since switching α and β yields − r2 = β − α (formally, this is termed a group action of the symmetric group of the roots). Since r2 is not symmetric, it cannot be expressed in terms of the roots 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 r2 by a factor of − 1, and thus the square
is symmetric in the roots, and thus expressible in terms of p and q. Using the equation (α − β)2 = (α + β)2 − 4αβ 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 p = b / a,q = c / a yields the usual form for when a quadratic is not monic. The resolvents can be recognized as r1 / 2 = − p / 2 = − b / 2a 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 r2 and r3, 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.
In some situations it is preferable to express the roots in an alternate 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 a division by zero, which is undefined.
The roots are the same regardless of which expression we use; the alternate 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. The problem of c possibly being zero can be avoided by using a mixed approach:


Here sgn denotes the sign function.
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.



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 r2 uses the fact that the product of the roots is c/a.
See Numerical Recipes in C, Section 5.6: "Quadratic and Cubic Equations".[7]
Viète'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

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

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

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.
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 x + ax + 1 is irreducible over F4, but 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.
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| Best of the Web: quadratic equation |
Some good "quadratic equation" pages on the web:
Math mathworld.wolfram.com |
| quadratic formula | |
| conic section | |
| quadratic |
Copyrights:
![]() | Dictionary. The American Heritage® Dictionary of the English Language, Fourth Edition Copyright © 2007, 2000 by Houghton Mifflin Company. Updated in 2007. Published by Houghton Mifflin Company. All rights reserved. Read more | |
![]() | Britannica Concise Encyclopedia. Britannica Concise Encyclopedia. © 2006 Encyclopædia Britannica, Inc. All rights reserved. Read more | |
![]() | WordNet. WordNet 1.7.1 Copyright © 2001 by Princeton University. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Quadratic equation". Read more |
Mentioned in