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?