AI Tutor
If you try to solve an equation like x3+2xβˆ’5=0x^3 + 2x - 5 = 0, standard factoring fails completely. But what if you could turn that static equation into a dynamic machine that steps directly toward the root?
To do that, we rewrite f(x)=0f(x) = 0 into the fixed-point form x=g(x)x = g(x), where the target root becomes the value that leaves the function unchanged.
Why do mathematicians call this special value a fixed point?

What Is a Fixed Point?

A fixed point of a function g(x)g(x) is an input value Ξ±\alpha that produces an identical output, so g(Ξ±)=Ξ±g(\alpha) = \alpha.
If you define f(x)=xβˆ’g(x)f(x) = x - g(x), setting f(x)=0f(x) = 0 immediately yields x=g(x)x = g(x), meaning the root of f(x)f(x) and the fixed point of g(x)g(x) are mathematically identical.
Can a single equation be rearranged into more than one fixed-point form? Let's manipulate a cubic polynomial.

Rearranging Polynomial Equations

Consider the cubic equation x3+2xβˆ’5=0x^3 + 2x - 5 = 0. You can isolate an xx on the left side in several distinct algebraic ways.
Isolating the linear term gives 2x=5βˆ’x32x = 5 - x^3, which simplifies to g1(x)=5βˆ’x32g_1(x) = \frac{5 - x^3}{2}.
Isolating the cubic term gives x3=5βˆ’2xx^3 = 5 - 2x, which upon taking the cube root yields g2(x)=5βˆ’2x3g_2(x) = \sqrt[3]{5 - 2x}.