how can i solve the following equation?
![]()
can i solve it without using any numerical method? also, when you solve using this method, -sqrt(2) (which is a solution) will be eliminated.The equation can be written in more convenient form as...
that's true.I am positive that there are only two real solutions:
x_1=sqrt(2)
x_2=-sqrt(2)
The Newton's sequence for solving the equation...
(1)
... is expressed as...
(2)
The functionis represented here...
If x has to be consider positive real, there is only one attractive fixed point atand for any
the sequence converges to the solution. For x negative or in general complex the task is much more complex and the 'solution'
found by Zarathustra, though perfectly correct, is symply among the complex solutions the only that has the imaginary part equal to 0...
Kind regards
![]()
![]()
and we can continue with as many
times as we want forto appear in those powers (an even number of times, though).
Taking limit we have. Therefore
so
Generalize:for a constant number of times x appears in the power.
In case you want it more rigorously:
Letbe defined by
, where
appears
times in those powers
(where in the given equation we haveappear
times in the powers).
It's easy to show thatfor all
.
is a sub-sequence of
which is defined just like
but for
.
so it is also the limit of its sub-sequence
.
Thereforeis the solution to
, which would be
and possibly the negative of it, if it can be substituted in the original equation.
Note an interesting point here. From what we proved it follows that if we're talking in the domainthen
converges only ifis a solution to
for some
.
But using the usual invetigation methods of functions it follows that the maximal value ofin
is when. That is, the maximal value is
, so
converges for
only if
We see thatis about
as we would expect, as a result of the original problem.