User:NumberMaker/sandbox

= Proof of Solvability =

This article is about the means to be able to solve any equation.

This method has to be configured manually for all instances of the variable that you are trying to find. There is no automatic way to do this unless you can program a computer to be able to understand the equation. You would need to define an upper bound and a lower bound of the range that you will be searching and throughout this range it must be increasing or decreasing.

For example take the equation:

2X + 2^X = 11

It is written like the variable is on one side of the equation.

You could solve it using this C code: double upper = 3;

double lower = 1;

double x = lower;

for (float h = upper – lower; h > 2 ^ -12; h /= 2) if (2 * (x + h) + pow(2, x + h) < 11) x += h; Because it is increasing you can use <= as the comparison operator. If it were decreasing you would use >= as the comparison operator here.

I will write how to solve for 2 variables later.