MHB Sydney's question at Yahoo Answers regarding root approximation

MarkFL
Gold Member
MHB
Messages
13,284
Reaction score
12
Here is the question:

CALCULUS HELP PLEASE!?

Approximate the solution to the following equation that satisfies the given condition: x^(4) + x - 3 = 0 ; x is greater than or equal to 0Please help I'm having so much trouble!

Here is a link to the question:

CALCULUS HELP PLEASE!? - Yahoo! Answers

I have posted a link there to this topic so the OP can find my response.
 
Mathematics news on Phys.org
Hello Sydney,

First, let's take a look at a plot of the function:

View attachment 582

We see the positive root is near $x=1$, so that will be a good initial guess.

Newton's method gives us the recursion:

$\displaystyle x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}$

In our case, this is:

$\displaystyle x_{n+1}=x_n-\frac{x_n^4+x_n-3}{4x_n^3+1}=\frac{3(x_n^4+1)}{4x_n^3+1}$

where $x_0=1$.

Now, I have a TI-89 Titanium graphing calculator, so what I do is enter the following:

1 [ENTER] Result: 1
(3(ans(1)^4+1))/(4ans(1)^3+1) ♦[ENTER] Result: 1.2
♦[ENTER] Result: 1.16541961577
♦[ENTER] Result: 1.16403726916
♦[ENTER] Result: 1.16403514029
♦[ENTER] Result: 1.16403514029

Since the last two approximations are the same, we have exceeded the limit of accuracy of the calculator, and we know the required root, to 12 digits, is:

$x\approx1.16403514029$
 

Attachments

  • rootplot.jpg
    rootplot.jpg
    5.2 KB · Views: 82
Last edited:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top