What Is A Quartic Polynomial
In algebra, a quartic part is a role of the form
where a is nonzero, which is defined by a polynomial of degree four, called a quartic polynomial.
A quartic equation, or equation of the 4th degree, is an equation that equates a quartic polynomial to zero, of the form
where a ≠ 0.[ane] The derivative of a quartic role is a cubic part.
Sometimes the term biquadratic is used instead of quartic, but, ordinarily, biquadratic function refers to a quadratic part of a square (or, equivalently, to the part divers past a quartic polynomial without terms of odd degree), having the form
Since a quartic function is defined by a polynomial of fifty-fifty degree, it has the same space limit when the statement goes to positive or negative infinity. If a is positive, and so the part increases to positive infinity at both ends; and thus the function has a global minimum. Too, if a is negative, it decreases to negative infinity and has a global maximum. In both cases it may or may not have some other local maximum and another local minimum.
The degree four (quartic case) is the highest degree such that every polynomial equation tin can be solved past radicals, co-ordinate to the Abel–Ruffini theorem.
History [edit]
Lodovico Ferrari is credited with the discovery of the solution to the quartic in 1540, but since this solution, like all algebraic solutions of the quartic, requires the solution of a cubic to be institute, it could not be published immediately.[two] The solution of the quartic was published together with that of the cubic by Ferrari's mentor Gerolamo Cardano in the volume Ars Magna.[three]
The Soviet historian I. Y. Depman (ru) claimed that even earlier, in 1486, Castilian mathematician Valmes was burned at the stake for claiming to have solved the quartic equation.[4] Inquisitor General Tomás de Torquemada allegedly told Valmes that information technology was the will of God that such a solution be inaccessible to homo understanding.[5] However, Petr Beckmann, who popularized this story of Depman in the West, said that it was unreliable and hinted that it may take been invented as Soviet antireligious propaganda.[half-dozen] Beckmann'due south version of this story has been widely copied in several books and net sites, usually without his reservations and sometimes with fanciful embellishments. Several attempts to find corroborating show for this story, or even for the beingness of Valmes, have failed.[vii]
The proof that four is the highest caste of a general polynomial for which such solutions can be found was outset given in the Abel–Ruffini theorem in 1824, proving that all attempts at solving the higher order polynomials would be futile. The notes left by Évariste Galois prior to dying in a duel in 1832 later led to an elegant complete theory of the roots of polynomials, of which this theorem was one event.[eight]
Applications [edit]
Each coordinate of the intersection points of two conic sections is a solution of a quartic equation. The same is truthful for the intersection of a line and a torus. It follows that quartic equations often arise in computational geometry and all related fields such as computer graphics, calculator-aided design, calculator-aided manufacturing and eyes. Hither are examples of other geometric issues whose solution involves solving a quartic equation.
In computer-aided manufacturing, the torus is a shape that is unremarkably associated with the endmill cutter. To summate its location relative to a triangulated surface, the position of a horizontal torus on the z -axis must be found where it is tangent to a fixed line, and this requires the solution of a general quartic equation to exist calculated.[nine]
A quartic equation arises also in the process of solving the crossed ladders problem, in which the lengths of two crossed ladders, each based confronting one wall and leaning against some other, are given forth with the elevation at which they cantankerous, and the distance betwixt the walls is to exist found.[ten]
In eyes, Alhazen'south trouble is "Given a light source and a spherical mirror, discover the point on the mirror where the light will be reflected to the center of an observer." This leads to a quartic equation.[11] [12] [xiii]
Finding the altitude of closest approach of 2 ellipses involves solving a quartic equation.
The eigenvalues of a 4×4 matrix are the roots of a quartic polynomial which is the characteristic polynomial of the matrix.
The characteristic equation of a quaternary-society linear difference equation or differential equation is a quartic equation. An case arises in the Timoshenko-Rayleigh theory of axle angle.[14]
Intersections betwixt spheres, cylinders, or other quadrics can be found using quartic equations.
Inflection points and golden ratio [edit]
Letting F and G be the distinct inflection points of the graph of a quartic role, and letting H exist the intersection of the inflection secant line FG and the quartic, nearer to G than to F, then G divides FH into the golden section:[xv]
Moreover, the area of the region between the secant line and the quartic below the secant line equals the area of the region between the secant line and the quartic above the secant line. One of those regions is disjointed into sub-regions of equal area.
Solution [edit]
Nature of the roots [edit]
Given the general quartic equation
with real coefficients and a ≠ 0 the nature of its roots is mainly determined by the sign of its discriminant
This may be refined by considering the signs of 4 other polynomials:
such that P / eighta 2 is the second degree coefficient of the associated depressed quartic (run into below);
such that R / 8a 3 is the commencement degree coefficient of the associated depressed quartic;
which is 0 if the quartic has a triple root; and
which is 0 if the quartic has ii double roots.
The possible cases for the nature of the roots are as follows:[16]
- If ∆ < 0 then the equation has ii distinct real roots and 2 complex conjugate non-real roots.
- If ∆ > 0 then either the equation's four roots are all real or none is.
- If P < 0 and D < 0 then all four roots are existent and distinct.
- If P > 0 or D > 0 then there are two pairs of non-real complex cohabit roots.[17]
- If ∆ = 0 and then (and only then) the polynomial has a multiple root. Here are the different cases that can occur:
- If P < 0 and D < 0 and ∆0 ≠ 0, there are a existent double root and two real simple roots.
- If D > 0 or (P > 0 and (D ≠ 0 or R ≠ 0)), there are a real double root and two complex conjugate roots.
- If ∆0 = 0 and D ≠ 0, there are a triple root and a simple root, all real.
- If D = 0, then:
- If P < 0, there are ii real double roots.
- If P > 0 and R = 0, there are two complex conjugate double roots.
- If ∆0 = 0, all four roots are equal to − b / 4a
There are some cases that practice not seem to be covered, and in fact they cannot occur. For example, ∆0 > 0, P = 0 and D ≤ 0 is non one of the cases. In fact, if ∆0 > 0 and P = 0 and then D > 0, since then this combination is not possible.
General formula for roots [edit]
The 4 roots ten 1 , x 2 , x 3 , and x 4 for the general quartic equation
with a ≠ 0 are given in the post-obit formula, which is deduced from the one in the section on Ferrari's method by dorsum changing the variables (see § Converting to a depressed quartic) and using the formulas for the quadratic and cubic equations.
where p and q are the coefficients of the second and of the first degree respectively in the associated depressed quartic
and where
(if Due south = 0 or Q = 0, run across § Special cases of the formula, below)
with
and
- where is the aforementioned discriminant. For the cube root expression for Q, any of the three cube roots in the complex aeroplane can be used, although if one of them is existent that is the natural and simplest i to choose. The mathematical expressions of these last 4 terms are very similar to those of their cubic counterparts.
Special cases of the formula [edit]
-
- where
- If and the sign of has to be chosen to have that is one should define every bit maintaining the sign of
- If then one must alter the choice of the cube root in in order to have This is always possible except if the quartic may be factored into The effect is then correct, but misleading because information technology hides the fact that no cube root is needed in this case. In fact this case may occur only if the numerator of is aught, in which case the associated depressed quartic is biquadratic; it may thus be solved by the method described below.
- If and and thus likewise at least iii roots are equal to each other, and the roots are rational functions of the coefficients. The triple root is a mutual root of the quartic and its second derivative it is thus besides the unique root of the residual of the Euclidean division of the quartic by its 2nd derivative, which is a linear polynomial. The simple root can be deduced from
- If and the to a higher place expression for the roots is correct but misleading, hiding the fact that the polynomial is reducible and no cube root is needed to represent the roots.
Simpler cases [edit]
Reducible quartics [edit]
Consider the general quartic
It is reducible if Q(x) = R(ten)×S(x), where R(10) and S(x) are non-abiding polynomials with rational coefficients (or more than generally with coefficients in the same field every bit the coefficients of Q(x)). Such a factorization volition take one of two forms:
or
In either instance, the roots of Q(ten) are the roots of the factors, which may be computed using the formulas for the roots of a quadratic office or cubic function.
Detecting the being of such factorizations can be washed using the resolvent cubic of Q(x). Information technology turns out that:
- if nosotros are working over R (that is, if coefficients are restricted to be existent numbers) (or, more more often than not, over some real airtight field) then in that location is always such a factorization;
- if we are working over Q (that is, if coefficients are restricted to be rational numbers) then there is an algorithm to determine whether or not Q(x) is reducible and, if it is, how to express information technology as a product of polynomials of smaller degree.
In fact, several methods of solving quartic equations (Ferrari's method, Descartes' method, and, to a lesser extent, Euler's method) are based upon finding such factorizations.
Biquadratic equation [edit]
If a 3 = a 1 = 0 then the biquadratic office
defines a biquadratic equation, which is easy to solve.
Permit the auxiliary variable z = x 2 . Then Q(x) becomes a quadratic q in z : q(z) = a 4 z ii + a 2 z + a 0 . Permit z + and z − be the roots of q(z). Then the roots of our quartic Q(10) are
Quasi-palindromic equation [edit]
The polynomial
is most palindromic, as P(mx) = x 4 / m 2 P( m / x ) (it is palindromic if m = i). The modify of variables z = x + k / x in P(x) / 10 ii = 0 produces the quadratic equation a 0 z ii + a 1 z + a 2 − 2ma 0 = 0. Since x two − xz + m = 0, the quartic equation P(x) = 0 may exist solved by applying the quadratic formula twice.
Solution methods [edit]
Converting to a depressed quartic [edit]
For solving purposes, it is generally improve to convert the quartic into a depressed quartic by the following simple change of variable. All formulas are simpler and some methods piece of work only in this example. The roots of the original quartic are easily recovered from that of the depressed quartic by the opposite modify of variable.
Let
be the general quartic equation we desire to solve.
Dividing by a 4 , provides the equivalent equation x four + bx three + cx 2 + dx + e = 0, with b = a 3 / a 4 , c = a ii / a four , d = a 1 / a iv , and e = a 0 / a iv . Substituting y − b / 4 for x gives, after regrouping the terms, the equation y four + py 2 + qy + r = 0, where
If y 0 is a root of this depressed quartic, so y 0 − b / 4 (that is y 0 − a iii / foura 4 ) is a root of the original quartic and every root of the original quartic tin be obtained by this process.
Ferrari'southward solution [edit]
As explained in the preceding department, we may start with the depressed quartic equation
This depressed quartic can be solved by means of a method discovered past Lodovico Ferrari. The depressed equation may be rewritten (this is easily verified past expanding the square and regrouping all terms in the left-mitt side) as
Then, nosotros introduce a variable m into the factor on the left-hand side by calculation iiy 2 m + pm + k 2 to both sides. After regrouping the coefficients of the power of y on the right-hand side, this gives the equation
-
(one)
which is equivalent to the original equation, whichever value is given to m.
Every bit the value of chiliad may exist arbitrarily chosen, we volition choose information technology in club to complete the foursquare on the right-hand side. This implies that the discriminant in y of this quadratic equation is cypher, that is k is a root of the equation
which may be rewritten as
-
(1a)
This is the resolvent cubic of the quartic equation. The value of m may thus exist obtained from Cardano's formula. When m is a root of this equation, the right-hand side of equation ( 1 ) is the square
Nonetheless, this induces a partition by aught if grand = 0. This implies q = 0, and thus that the depressed equation is bi-quadratic, and may be solved by an easier method (encounter above). This was non a problem at the time of Ferrari, when one solved merely explicitly given equations with numeric coefficients. For a full general formula that is always truthful, ane thus needs to choose a root of the cubic equation such that k ≠ 0. This is always possible except for the depressed equation y four = 0.
At present, if thousand is a root of the cubic equation such that m ≠ 0, equation ( 1 ) becomes
This equation is of the class K 2 = N 2 , which can be rearranged every bit Grand two − N 2 = 0 or (M + N)(M − N) = 0. Therefore, equation ( 1 ) may be rewritten as
This equation is easily solved by applying to each factor the quadratic formula. Solving them we may write the four roots as
where ±one and ±two denote either + or −. As the 2 occurrences of ±1 must denote the same sign, this leaves four possibilities, one for each root.
Therefore, the solutions of the original quartic equation are
A comparison with the general formula higher up shows that √2m = twoSouthward .
Descartes' solution [edit]
Descartes[nineteen] introduced in 1637 the method of finding the roots of a quartic polynomial by factoring information technology into two quadratic ones. Let
Past equating coefficients, this results in the post-obit organization of equations:
This can be simplified by starting again with the depressed quartic y 4 + py 2 + qy + r , which can be obtained past substituting y − b/4 for x . Since the coefficient of y 3 is0, we get s = −u , and:
One can now eliminate both t and v by doing the post-obit:
If we set U = u 2 , then solving this equation becomes finding the roots of the resolvent cubic
-
(2)
which is done elsewhere. This resolvent cubic is equivalent to the resolvent cubic given to a higher place (equation (1a)), as can be seen by substituting U = 2m.
If u is a square root of a not-zip root of this resolvent (such a non-nada root exists except for the quartic x 4 , which is trivially factored),
The symmetries in this solution are as follows. There are three roots of the cubic, respective to the three ways that a quartic tin exist factored into two quadratics, and choosing positive or negative values of u for the square root of U merely exchanges the 2 quadratics with one another.
The in a higher place solution shows that a quartic polynomial with rational coefficients and a goose egg coefficient on the cubic term is factorable into quadratics with rational coefficients if and only if either the resolvent cubic ( ii ) has a non-cipher root which is the square of a rational, or p ii − ivr is the foursquare of rational and q = 0; this tin readily exist checked using the rational root examination.[20]
Euler's solution [edit]
A variant of the previous method is due to Euler.[21] [22] Dissimilar the previous methods, both of which use some root of the resolvent cubic, Euler's method uses all of them. Consider a depressed quartic x 4 + px ii + qx + r . Observe that, if
- x iv + px 2 + qx + r = (x 2 + sx + t)(ten 2 − sx + five),
- r ane and r 2 are the roots of x 2 + sx + t ,
- r iii and r 4 are the roots of ten 2 − sx + five ,
then
- the roots of x 4 + px 2 + qx + r are r 1 , r 2 , r three , and r four ,
- r 1 + r 2 = −due south ,
- r three + r 4 = s .
Therefore, (r 1 + r 2)(r three + r four) = −due south 2 . In other words, −(r one + r 2)(r 3 + r 4) is one of the roots of the resolvent cubic ( ii ) and this suggests that the roots of that cubic are equal to −(r 1 + r two)(r 3 + r iv), −(r 1 + r 3)(r 2 + r 4), and −(r 1 + r 4)(r 2 + r three). This is indeed true and it follows from Vieta'south formulas. It too follows from Vieta's formulas, together with the fact that we are working with a depressed quartic, that r 1 + r 2 + r 3 + r four = 0. (Of form, this likewise follows from the fact that r 1 + r two + r 3 + r iv = −s + south .) Therefore, if α , β , and γ are the roots of the resolvent cubic, then the numbers r 1 , r ii , r 3 , and r 4 are such that
It is a upshot of the start two equations that r 1 + r 2 is a foursquare root of α and that r 3 + r iv is the other square root of α . For the aforementioned reason,
- r i + r 3 is a foursquare root of β ,
- r two + r iv is the other square root of β ,
- r i + r 4 is a square root of γ ,
- r two + r 3 is the other square root of γ .
Therefore, the numbers r one , r two , r 3 , and r 4 are such that
the sign of the square roots will be dealt with beneath. The just solution of this system is:
Since, in general, there are two choices for each square root, it might await as if this provides viii (= two3) choices for the set {r 1, r two, r 3, r 4 }, just, in fact, it provides no more than ii such choices, because the consequence of replacing ane of the square roots by the symmetric one is that the set up {r one, r 2, r 3, r 4 } becomes the set up {−r i, −r 2, −r 3, −r 4 }.
In order to determine the correct sign of the square roots, 1 merely chooses some square root for each of the numbers α , β , and γ and uses them to compute the numbers r 1 , r 2 , r 3 , and r 4 from the previous equalities. Then, one computes the number √ α √ β √ γ . Since α , β , and γ are the roots of ( ii ), it is a consequence of Vieta's formulas that their product is equal to q 2 and therefore that √ α √ β √ γ = ±q . Merely a straightforward computation shows that
- √ α √ β √ γ = r 1 r 2 r 3 + r ane r 2 r 4 + r i r 3 r 4 + r 2 r 3 r four.
If this number is −q , then the selection of the foursquare roots was a good i (again, past Vieta'southward formulas); otherwise, the roots of the polynomial will be −r 1 , −r 2 , −r 3 , and −r iv , which are the numbers obtained if one of the square roots is replaced by the symmetric i (or, what amounts to the same affair, if each of the three foursquare roots is replaced past the symmetric 1).
This argument suggests another style of choosing the square roots:
- pick any square root √ α of α and whatsoever square root √ β of β ;
- define √ γ every bit .
Of course, this volition make no sense if α or β is equal to 0, but 0 is a root of ( 2 ) only when q = 0, that is, only when we are dealing with a biquadratic equation, in which case there is a much simpler arroyo.
Solving by Lagrange resolvent [edit]
The symmetric group Due south iv on 4 elements has the Klein four-group as a normal subgroup. This suggests using a resolvent cubic whose roots may be variously described every bit a detached Fourier transform or a Hadamard matrix transform of the roots; see Lagrange resolvents for the general method. Denote past xi , for i from0 to3, the four roots of ten 4 + bx 3 + cx 2 + dx + due east . If we ready
so since the transformation is an involution we may limited the roots in terms of the four due southi in exactly the same manner. Since we know the value s 0 = − b / 2 , we but demand the values for s 1 , s 2 and s three . These are the roots of the polynomial
Substituting the si past their values in term of the teni , this polynomial may be expanded in a polynomial in s whose coefficients are symmetric polynomials in the xi . By the fundamental theorem of symmetric polynomials, these coefficients may be expressed as polynomials in the coefficients of the monic quartic. If, for simplification, we suppose that the quartic is depressed, that is b = 0, this results in the polynomial
-
(3)
This polynomial is of degree half dozen, but only of degree three in s ii , and so the respective equation is solvable past the method described in the commodity nearly cubic function. By substituting the roots in the expression of the xi in terms of the southwardi , we obtain expression for the roots. In fact nosotros obtain, evidently, several expressions, depending on the numbering of the roots of the cubic polynomial and of the signs given to their square roots. All these different expressions may exist deduced from 1 of them past merely changing the numbering of the xi .
These expressions are unnecessarily complicated, involving the cubic roots of unity, which can be avoided equally follows. If southward is any not-cypher root of ( 3 ), and if nosotros set
then
We therefore tin can solve the quartic past solving for s and so solving for the roots of the 2 factors using the quadratic formula.
This gives exactly the same formula for the roots as the one provided past Descartes' method.
Solving with algebraic geometry [edit]
There is an culling solution using algebraic geometry[23] In brief, one interprets the roots as the intersection of two quadratic curves, then finds the three reducible quadratic curves (pairs of lines) that pass through these points (this corresponds to the resolvent cubic, the pairs of lines existence the Lagrange resolvents), and and then use these linear equations to solve the quadratic.
The iv roots of the depressed quartic x iv + px two + qx + r = 0 may likewise be expressed every bit 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 two that two quadratics intersect in four points is an instance of Bézout'due south theorem. Explicitly, the four points are Pi ≔ (xi , xi two) for the four roots xi of the quartic.
These iv points are not collinear because they lie on the irreducible quadratic y = x 2 and thus at that place is a i-parameter family of quadratics (a pencil of curves) passing through these points. Writing the projectivization of the 2 quadratics as quadratic forms in three variables:
the pencil is given by the forms λF 1 + μF ii for any betoken [λ, μ] in the projective line — in other words, where λ and μ are non both aught, and multiplying a quadratic course past a constant does not change its quadratic curve of zeros.
This pencil contains three reducible quadratics, each corresponding to a pair of lines, each passing through two of the four points, which can exist done =6 different ways. Denote these Q 1 = L 12 + L 34 , Q two = L xiii + L 24 , and Q iii = L xiv + Fifty 23 . Given any ii of these, their intersection has exactly the 4 points.
The reducible quadratics, in turn, may be determined past expressing the quadratic grade λF 1 + μF 2 as a 3×3 matrix: reducible quadratics correspond to this matrix beingness singular, which is equivalent to its determinant being zero, and the determinant is a homogeneous caste three polynomial in λ and μ and corresponds to the resolvent cubic.
See also [edit]
- Linear office – Linear map or polynomial role of caste ane
- Quadratic part – Polynomial function of degree two
- Cubic function – Polynomial function of degree iii
- Quintic function – Polynomial office of degree 5
References [edit]
- ^ Weisstein, Eric Due west. "Quartic Equation". mathworld.wolfram.com . Retrieved 27 July 2020.
- ^ O'Connor, John J.; Robertson, Edmund F., "Lodovico Ferrari", MacTutor History of Mathematics archive, University of St Andrews
- ^ Cardano, Gerolamo (1993) [1545], Ars magna or The Rules of Algebra , Dover, ISBN0-486-67811-3
- ^ Depman (1954), Rasskazy o matematike (in Russian), Leningrad: Gosdetizdat
- ^ P. Beckmann (1971). A history of π. Macmillan. p. fourscore. ISBN9780312381851.
- ^ P. Beckmann (1971). A history of π. Macmillan. p. 191. ISBN9780312381851.
- ^ P. Zoll (1989). "Letter of the alphabet to the Editor". American Mathematical Monthly. 96 (viii): 709–710. JSTOR 2324719.
- ^ Stewart, Ian, Galois Theory, Third Edition (Chapman & Hall/CRC Mathematics, 2004)
- ^ "DIFFERENTIAL GEOMETRY: A First Course in Curves and Surfaces, p. 36" (PDF). math.gatech.edu.
- ^ Weisstein, Eric Westward. "Crossed Ladders Problem". mathworld.wolfram.com . Retrieved 27 July 2020.
- ^ O'Connor, John J.; Robertson, Edmund F., "Abu Ali al-Hasan ibn al-Haytham", MacTutor History of Mathematics archive, University of St Andrews
- ^ MacKay, R. J.; Oldford, R. W. (August 2000), "Scientific Method, Statistical Method and the Speed of Light", Statistical Science, fifteen (iii): 254–78, doi:10.1214/ss/1009212817, MR 1847825
- ^ Neumann, Peter Yard. (1998), "Reflections on Reflection in a Spherical Mirror", American Mathematical Monthly, 105 (6): 523–528, doi:10.2307/2589403, JSTOR 2589403
- ^ Shabana, A. A. (8 December 1995). Theory of Vibration: An Introduction. Springer Science & Business organisation Media. ISBN978-0-387-94524-eight.
- ^ Aude, H. T. R. (1949), "Notes on Quartic Curves", American Mathematical Monthly, 56 (three): 165–170, doi:x.2307/2305030, JSTOR 2305030
- ^ Rees, E. Fifty. (1922). "Graphical Discussion of the Roots of a Quartic Equation". The American Mathematical Monthly. 29 (2): 51–55. doi:10.2307/2972804. JSTOR 2972804.
- ^ Lazard, D. (1988). "Quantifier elimination: Optimal solution for two classical examples". Journal of Symbolic Ciphering. 5 (1–2): 261–266. doi:10.1016/S0747-7171(88)80015-4.
- ^ http://planetmath.org/QuarticFormula, PlanetMath, quartic formula, 21 October 2012
- ^ Descartes, René (1954) [1637], "Book Three: On the structure of solid and supersolid problems", The Geometry of Rene Descartes with a facsimile of the first edition, Dover, ISBN0-486-60068-eight, JFM 51.0020.07
- ^ Brookfield, G. (2007). "Factoring quartic polynomials: A lost art" (PDF). Mathematics Mag. 80 (1): 67–70. doi:10.1080/0025570X.2007.11953453. S2CID 53375377.
- ^ van der Waerden, Bartel Leendert (1991), "The Galois theory: Equations of the second, 3rd, and fourth degrees", Algebra, vol. i (7th ed.), Springer-Verlag, ISBN0-387-97424-5, Zbl 0724.12001
- ^ Euler, Leonhard (1984) [1765], "Of a new method of resolving equations of the quaternary caste", Elements of Algebra, Springer-Verlag, ISBN978-1-4613-8511-0, Zbl 0557.01014
- ^ Faucette, William G. (1996), "A Geometric Interpretation of the Solution of the General Quartic Polynomial", American Mathematical Monthly, 103 (ane): 51–57, doi:10.2307/2975214, JSTOR 2975214, MR 1369151
Further reading [edit]
- Carpenter, W. (1966). "On the solution of the real quartic". Mathematics Magazine. 39 (i): 28–30. doi:10.2307/2688990. JSTOR 2688990.
- Yacoub,M.D.; Fraidenraich, G. (July 2012). "A solution to the quartic equation". Mathematical Gazette. 96: 271–275. doi:10.1017/s002555720000454x. S2CID 124512391.
External links [edit]
- Quartic formula as four single equations at PlanetMath.
- Ferrari's achievement
What Is A Quartic Polynomial,
Source: https://en.wikipedia.org/wiki/Quartic_function
Posted by: mathewsfusent.blogspot.com
0 Response to "What Is A Quartic Polynomial"
Post a Comment