2
$\begingroup$

I am writing a program which relies heavily on solving complex equations. Of course I can't just write a separate function for solving every single type of equation, because I might as well need to solve an equation of 200th degree and I don't have the time to create 200 separate functions for every degree.

I was looking for a general formula for solving any equation with a single variable. The catch is that I'd much rather have the exact solutions, not approximated (or at least as exact as a finite set of bits allows them to be). Then I stumbled upon the Abel-Ruffini theorem.

So basically the way I understand it is that no such formula exists, that for an equation of degree >= 5 you either need to approximate the solutions or create a formula that is specific to that equation. Which basically means that what I was trying to achieve is not possible. But that just doesn't seem right. How come a human can easily solve something like ax^{10} = 0 or ax^8 + bx^4 = 0 but a machine can only approximate since it relies on having a formula to use? And why is number 5 so special? Do I even understand it correctly?

$\endgroup$
  • $\begingroup$ "Not soluble by radicals", i.e you can't get the solution using addition, subtraction, multiplication, division or roots. However there are other methods. $\endgroup$ – TCiur Dec 29 '16 at 13:55
  • $\begingroup$ If you're up for it, there are things such as math.stackexchange.com/questions/540964/…. $\endgroup$ – TCiur Dec 29 '16 at 13:56
  • $\begingroup$ I most certainly am up for anything, but if I understand this correctly it will only work for polynomials of the 5th degree. I need a single algorithm/formula for any polynomial provided it has a solution in radicals $\endgroup$ – AlanKalane Dec 29 '16 at 21:46
1
$\begingroup$

A computer can certainly solve $ax^{10}=0$ and $ax^8+bx^4=0$ because those are special polynomials with a certain form. What it can't solve is the following general equation in terms of radicals: $$ax^5+bx^4+cx^3+dx^2+ex+f=0$$ There are certain special cases of this equation where some of the coefficients are $0$ or related to each other where it can be solved exactly, but the general case can not be solved using one formula. Also, what I mean by "in terms of radicals" is that you can not solve this equation by using addition, subtraction, multiplication, division, and roots in terms of $a, b, c, d, e, f$ to solve this equation. It's not just that there's no general formula with radicals. It's that it is literally impossible to write the roots of certain quintics using only radicals. The exact solution simply can not be written in terms of radicals. Even if you tried to create a specific formula just for $x^5+2x^3-19$ in terms of radicals, you can't. You have to use something else like maybe some trigonometric or other weird function in order to write the exact solution.

You can, however, reduce the quintic to Bring-Jerrard form (although, to be honest, I don't know how to do this reduction) and then use the Bring radical to solve the equation. If I'm not mistaken, the Bring radical can be solved using binary search since $x^5+x+a$ is an always increasing function, so I think you should still be able to approximate the solution to a quintic pretty well by approximating the Bring radical.

$\endgroup$
  • 1
    $\begingroup$ See TCiur's link for that general quintic polynomial stuff. $\endgroup$ – Simply Beautiful Art Dec 29 '16 at 14:08
  • $\begingroup$ @NobleMushtak It might be worth mentioning that to reduce the general quintic into the Bring-Jerrard form, you have to apply two transformations. A quartic, then a sextic. $\endgroup$ – Frank Dec 29 '16 at 15:47
  • $\begingroup$ Okay so that will do for quintic equations. Is there a formula or an algorithm that will work for any polynomial with a single variable? (polynomial of nth degree) $\endgroup$ – AlanKalane Dec 29 '16 at 21:38
  • $\begingroup$ That is, provided a solution in radical exists $\endgroup$ – AlanKalane Dec 29 '16 at 21:42
  • 1
    $\begingroup$ @AlanKalane, you're better off using a numerical approach like Newton's method. $\endgroup$ – Antonio Vargas Dec 30 '16 at 10:36
0
$\begingroup$

You misunderstand a vital part of the Abel-Ruffini theorem. It more or less states that polynomials of degree $>4$ are not solvable in general using radicals, but on a case-by-case scenario, they can be solved using radicals. Your examples are plenty proof of the fact.

For polynomials degree $5,6$, general formulas do exist, they just involve crazy functions like the hypergeomtric series. See here for the $5$th degree and here for the $6$th degree. Particularly, you will need there Kampé de Fériet function.

I also recommend you check the rational roots theorem, it helps reduce the problem often, and if you learn Galois theory, you can determine which polynomials of degree $>4$ are solvable with radicals.

$\endgroup$
  • $\begingroup$ Okay, that clears things up a bit. I will just have to check if the function is solvable in terms of radicals and then apply the solution. Still, what you've provided will work for the 5th and 6th degree, right? What about the 7th, 8th or nth degree? $\endgroup$ – AlanKalane Dec 29 '16 at 21:36
  • $\begingroup$ @AlanKalane Such topics are covered under "Galois theory". You'd have to study that. And general solutions to even higher degrees are so impractical that we more or less give up, even if such formula exists, and just use numerical methods. $\endgroup$ – Simply Beautiful Art Dec 29 '16 at 22:46

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.