Quartic Equation Solver
Solve quartic equation problems step-by-step with our free calculator. See formulas, worked examples, and clear explanations.
Calculator
Adjust values & calculateCritical Points
Formula
This calculator solves quartic equations using Newton-Raphson numerical methods from multiple starting points to find all real roots. It also computes the discriminant, Vieta relationships, and critical points of the polynomial.
Last reviewed: December 2025
Worked Examples
Example 1: Quartic with Four Integer Roots
Example 2: Quartic with Two Real Roots
Background & Theory
The Quartic Equation Solver applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Quartic Equation Solver traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Key Features
- Solves linear, quadratic, and higher-degree polynomial equations step by step, returning all real and complex roots with full working shown.
- Simplifies fractions to lowest terms and computes ratios and proportions, including cross-multiplication checks and equivalent fraction generation.
- Performs complete prime factorization of any integer and computes the Greatest Common Divisor and Least Common Multiple for sets of numbers.
- Handles matrix operations including addition, scalar multiplication, matrix multiplication, determinant calculation, and full matrix inversion for square matrices.
- Evaluates all standard trigonometric functions and their inverses in degrees or radians, and verifies common trigonometric identities symbolically.
- Calculates permutations, combinations, and binomial coefficients for combinatorics problems, supporting both formula display and step-by-step breakdown.
- Converts integers between binary, octal, decimal, and hexadecimal bases instantly, with optional display of the positional value expansion.
- Computes the sum of arithmetic and geometric sequences given the first term, common difference or ratio, and number of terms, with formula derivation.
Frequently Asked Questions
Formula
ax^4 + bx^3 + cx^2 + dx + e = 0
This calculator solves quartic equations using Newton-Raphson numerical methods from multiple starting points to find all real roots. It also computes the discriminant, Vieta relationships, and critical points of the polynomial.
Worked Examples
Example 1: Quartic with Four Integer Roots
Problem: Solve x^4 - 10x^3 + 35x^2 - 50x + 24 = 0.
Solution: Test integer roots: f(1) = 1 - 10 + 35 - 50 + 24 = 0, so x = 1 is a root.\nDivide by (x-1): x^3 - 9x^2 + 26x - 24\nf(2) = 8 - 36 + 52 - 24 = 0, so x = 2 is a root.\nDivide by (x-2): x^2 - 7x + 12 = (x-3)(x-4)\nAll roots: x = 1, 2, 3, 4\nVerify: sum = 10 = -(-10)/1, product = 24 = 24/1
Result: Roots: x = 1, x = 2, x = 3, x = 4 | Sum = 10, Product = 24
Example 2: Quartic with Two Real Roots
Problem: Solve x^4 - 2x^2 - 3 = 0.
Solution: Substitute u = x^2: u^2 - 2u - 3 = 0\n(u-3)(u+1) = 0, so u = 3 or u = -1\nFrom u = x^2 = 3: x = sqrt(3) or x = -sqrt(3)\nFrom u = x^2 = -1: x = i or x = -i (complex)\nReal roots: x = 1.732051 and x = -1.732051\nComplex roots: x = i and x = -i
Result: Real roots: x = 1.7321 and x = -1.7321 | Complex roots: x = +/-i
Frequently Asked Questions
What is a quartic equation and how many roots can it have?
A quartic equation is a polynomial equation of degree four, taking the general form ax^4 + bx^3 + cx^2 + dx + e = 0 where a is not zero. By the Fundamental Theorem of Algebra, every quartic equation has exactly four roots when counted with multiplicity and including complex roots. The possible configurations of real roots are: four distinct real roots, two distinct real roots and two complex conjugate roots, no real roots (two pairs of complex conjugates), or various combinations involving repeated roots. The quartic is the highest-degree polynomial for which a general closed-form solution using radicals exists.
What is the Ferrari method for solving quartic equations?
The Ferrari method, developed by Lodovico Ferrari in 1540, was the first general solution for quartic equations. The approach converts the quartic into a depressed quartic by substituting x = t - b/(4a) to eliminate the cubic term. The depressed quartic is then factored into two quadratic factors by introducing an auxiliary variable, which satisfies a resolvent cubic equation. Solving the cubic gives the auxiliary variable, which allows factoring the quartic into two quadratics that can each be solved with the quadratic formula. While elegant in theory, the Ferrari method produces complex expressions and is primarily of theoretical importance today.
How does the discriminant of a quartic classify its roots?
The discriminant of a quartic equation is a polynomial expression in the coefficients that determines the nature of the roots. If the discriminant is positive, the quartic has either four distinct real roots or four complex roots (two conjugate pairs). If the discriminant is zero, the quartic has at least one repeated root. If the discriminant is negative, the quartic has exactly two real roots and two complex conjugate roots. The quartic discriminant is considerably more complex than the quadratic discriminant b^2-4ac, involving many terms of the coefficients. Additional conditions on subsidiary discriminants are needed to fully classify all cases.
What numerical methods work best for solving quartic equations?
Several numerical methods effectively solve quartic equations. The Newton-Raphson method provides quadratic convergence when starting near a root and works excellently for quartics since the derivative is easy to compute. The companion matrix eigenvalue method converts the polynomial root problem into finding eigenvalues of a 4x4 matrix, leveraging robust linear algebra algorithms. The Durand-Kerner method simultaneously approximates all four roots using iterative refinement. For real-world applications, the Jenkins-Traub algorithm is considered one of the most reliable polynomial root finders, handling all cases including closely spaced and multiple roots.
How are quartic equations used in real-world applications?
Quartic equations arise naturally in many scientific and engineering problems. In optics, ray tracing through fourth-order surfaces like tori requires solving quartic equations to find intersection points. In celestial mechanics, certain orbital mechanics problems reduce to quartic equations. Computer-aided geometric design uses quartic curves and surfaces extensively. In robotics, inverse kinematics for certain robot arm configurations involves quartic equations. Elasticity theory uses quartic equations when analyzing beam deflections under specific loading conditions. Financial derivative pricing models sometimes produce quartic equations when solving for implied volatility.
What is the relationship between quartic roots and the coefficients?
Vieta formulas for a quartic ax^4 + bx^3 + cx^2 + dx + e with roots r1, r2, r3, r4 establish that: the sum of all roots equals -b/a, the sum of all pairwise products equals c/a, the sum of all triple products equals -d/a, and the product of all four roots equals e/a. These relationships are symmetric functions of the roots and remain valid whether the roots are real or complex. Vieta formulas provide a quick way to verify computed roots and can be used to reconstruct a polynomial from its known roots by working backwards from the symmetric sums.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy