How many terms of the Maclaurin series for $ln(1+x)$ do you need to use to estimate $ln(1.4)$ to within $0.001$? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Finding the first 5 terms of a Maclaurin Series using division?Estimate error using Taylor SeriesStrategy to recognize and solve sequence and series problems?Use the Maclaurin series for $cos(x)$to compute the value of $cos(5^circ)$ correct to five decimal places.Number of terms to estimate the integral within the indicated accuracy using series!User remainder theorem to estimate $ sum^infty_k=1 frac12(-1)^k+1k^2 $ within $frac25$How do you find nth maclaurin/taylor series or polynomial?Solving an integral using first two terms of the Mclaurin series for $f(x)$Show $log(1-x)=-sum_n=1^inftyfracx^nn,forall xin(-1,1)$.Calculating the approximation of an integral using the first four terms of a Maclaurin series.
Should I use a zero-interest credit card for a large one-time purchase?
What order were files/directories outputted in dir?
Question about debouncing - delay of state change
Crossing US/Canada Border for less than 24 hours
What do you call the main part of a joke?
Amount of permutations on an NxNxN Rubik's Cube
What does it mean that physics no longer uses mechanical models to describe phenomena?
Do wooden building fires get hotter than 600°C?
Project Euler #1 in C++
How to react to hostile behavior from a senior developer?
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
How to tell that you are a giant?
Can a new player join a group only when a new campaign starts?
How to compare two different files line by line in unix?
What is this clumpy 20-30cm high yellow-flowered plant?
Significance of Cersei's obsession with elephants?
Why does the remaining Rebel fleet at the end of Rogue One seem dramatically larger than the one in A New Hope?
Why weren't discrete x86 CPUs ever used in game hardware?
Is it a good idea to use CNN to classify 1D signal?
An adverb for when you're not exaggerating
Can anything be seen from the center of the Boötes void? How dark would it be?
How come Sam didn't become Lord of Horn Hill?
Why wasn't DOSKEY integrated with COMMAND.COM?
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
How many terms of the Maclaurin series for $ln(1+x)$ do you need to use to estimate $ln(1.4)$ to within $0.001$?
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Finding the first 5 terms of a Maclaurin Series using division?Estimate error using Taylor SeriesStrategy to recognize and solve sequence and series problems?Use the Maclaurin series for $cos(x)$to compute the value of $cos(5^circ)$ correct to five decimal places.Number of terms to estimate the integral within the indicated accuracy using series!User remainder theorem to estimate $ sum^infty_k=1 frac12(-1)^k+1k^2 $ within $frac25$How do you find nth maclaurin/taylor series or polynomial?Solving an integral using first two terms of the Mclaurin series for $f(x)$Show $log(1-x)=-sum_n=1^inftyfracx^nn,forall xin(-1,1)$.Calculating the approximation of an integral using the first four terms of a Maclaurin series.
$begingroup$
My question:
How many terms of the Maclaurin series for ln(1+x) do you need to use to estimate ln(1.4) to within 0.001?
I feel like I'm lost and my textbook that I'm using doesn't really go into how to solve problems like these in the section Taylor series and Maclaurin. Even worse, I'm a bit confused about all of this so I'm not sure where to even proceed.
So my process is this:
- find the general formula for this series
- If it's alternating, find the term so that the error is less than 0.001
- I can also use the Taylor Inequality to estimate the error.
Where in the Stewart book does it even go into problems like these?
I have the derivatives of each:
$$f'(x) = frac11+x$$
$$f''(x) = frac-1(1+x)^2$$
$$f'''(x) = frac2(1+x)(1+x)^4 = frac2(1+x)^3$$
$$f^iv(x) = frac-6(1+x)^4$$
sequences-and-series
$endgroup$
add a comment |
$begingroup$
My question:
How many terms of the Maclaurin series for ln(1+x) do you need to use to estimate ln(1.4) to within 0.001?
I feel like I'm lost and my textbook that I'm using doesn't really go into how to solve problems like these in the section Taylor series and Maclaurin. Even worse, I'm a bit confused about all of this so I'm not sure where to even proceed.
So my process is this:
- find the general formula for this series
- If it's alternating, find the term so that the error is less than 0.001
- I can also use the Taylor Inequality to estimate the error.
Where in the Stewart book does it even go into problems like these?
I have the derivatives of each:
$$f'(x) = frac11+x$$
$$f''(x) = frac-1(1+x)^2$$
$$f'''(x) = frac2(1+x)(1+x)^4 = frac2(1+x)^3$$
$$f^iv(x) = frac-6(1+x)^4$$
sequences-and-series
$endgroup$
add a comment |
$begingroup$
My question:
How many terms of the Maclaurin series for ln(1+x) do you need to use to estimate ln(1.4) to within 0.001?
I feel like I'm lost and my textbook that I'm using doesn't really go into how to solve problems like these in the section Taylor series and Maclaurin. Even worse, I'm a bit confused about all of this so I'm not sure where to even proceed.
So my process is this:
- find the general formula for this series
- If it's alternating, find the term so that the error is less than 0.001
- I can also use the Taylor Inequality to estimate the error.
Where in the Stewart book does it even go into problems like these?
I have the derivatives of each:
$$f'(x) = frac11+x$$
$$f''(x) = frac-1(1+x)^2$$
$$f'''(x) = frac2(1+x)(1+x)^4 = frac2(1+x)^3$$
$$f^iv(x) = frac-6(1+x)^4$$
sequences-and-series
$endgroup$
My question:
How many terms of the Maclaurin series for ln(1+x) do you need to use to estimate ln(1.4) to within 0.001?
I feel like I'm lost and my textbook that I'm using doesn't really go into how to solve problems like these in the section Taylor series and Maclaurin. Even worse, I'm a bit confused about all of this so I'm not sure where to even proceed.
So my process is this:
- find the general formula for this series
- If it's alternating, find the term so that the error is less than 0.001
- I can also use the Taylor Inequality to estimate the error.
Where in the Stewart book does it even go into problems like these?
I have the derivatives of each:
$$f'(x) = frac11+x$$
$$f''(x) = frac-1(1+x)^2$$
$$f'''(x) = frac2(1+x)(1+x)^4 = frac2(1+x)^3$$
$$f^iv(x) = frac-6(1+x)^4$$
sequences-and-series
sequences-and-series
edited 5 mins ago
TheSimpliFire
13.2k62464
13.2k62464
asked 1 hour ago
Jwan622Jwan622
2,41111632
2,41111632
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You don't have to compute the derivatives as you do.
Use directly
- classical Taylor expansion :
$$ln(1+x)=x-tfracx^22+tfracx^33-tfracx^44-...tag1$$
with $x=0.4$ and
- the theorem about alternating series saying that the error done by truncating this series is less that the module of the first discarded term (i.e., the first one not present in the truncated series).
The condition is that this first discarded $n$th term is such
$$tfrac0.4^nnleq 0.001$$
Due to the fact that $tfrac0.4^66 < 0.001 < tfrac0.4^55$, we have $n=6$.
Thus we need $n-1=5$ terms in expansion (1).
Verification : $ln(1.4)= 0.3364722366...$ whereas
$0.4-tfrac0.4^22+tfrac0.4^33-tfrac0.4^44+tfrac0.4^55=0.3369813333...$. The error $approx 0.0003$ is indeed less than $0.001$.
$endgroup$
add a comment |
$begingroup$
First of all, you do need the MacLaurin series $$ tag1ln(1+x)=sum_k=0^infty a_kx^k.$$
Given that the derivative of $ln(1+x)$ is $frac11+x$, and from the geometric series
$$ frac11+x=sum_k=0^infty (-1)^kx^k,$$
you ought to see that $a_k=frac(-1)^k-1k$ for $k>0$ (and $a_0=0$).
In particular, for $0<x<1$, $(1)$ is an alternating series with secreasong (in absolute value) terms. Hence we can just stop when the further summands would be smaller than the desired error bound, without checking any specific error formula.
In other words, we find $n$ with $frac0.4^nn<0.001$ and then take $sum_k=0^n-1frac-(-0.4)^kk$ as our approximation of $ln(1.4)$.
Explicitly,
$$ ln(1.4)approx 0.4-0.08+0.021overline3-0.0064+0.002048$$
with the next summand $-0.000682overline6$ already small enough.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3193207%2fhow-many-terms-of-the-maclaurin-series-for-ln1x-do-you-need-to-use-to-esti%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You don't have to compute the derivatives as you do.
Use directly
- classical Taylor expansion :
$$ln(1+x)=x-tfracx^22+tfracx^33-tfracx^44-...tag1$$
with $x=0.4$ and
- the theorem about alternating series saying that the error done by truncating this series is less that the module of the first discarded term (i.e., the first one not present in the truncated series).
The condition is that this first discarded $n$th term is such
$$tfrac0.4^nnleq 0.001$$
Due to the fact that $tfrac0.4^66 < 0.001 < tfrac0.4^55$, we have $n=6$.
Thus we need $n-1=5$ terms in expansion (1).
Verification : $ln(1.4)= 0.3364722366...$ whereas
$0.4-tfrac0.4^22+tfrac0.4^33-tfrac0.4^44+tfrac0.4^55=0.3369813333...$. The error $approx 0.0003$ is indeed less than $0.001$.
$endgroup$
add a comment |
$begingroup$
You don't have to compute the derivatives as you do.
Use directly
- classical Taylor expansion :
$$ln(1+x)=x-tfracx^22+tfracx^33-tfracx^44-...tag1$$
with $x=0.4$ and
- the theorem about alternating series saying that the error done by truncating this series is less that the module of the first discarded term (i.e., the first one not present in the truncated series).
The condition is that this first discarded $n$th term is such
$$tfrac0.4^nnleq 0.001$$
Due to the fact that $tfrac0.4^66 < 0.001 < tfrac0.4^55$, we have $n=6$.
Thus we need $n-1=5$ terms in expansion (1).
Verification : $ln(1.4)= 0.3364722366...$ whereas
$0.4-tfrac0.4^22+tfrac0.4^33-tfrac0.4^44+tfrac0.4^55=0.3369813333...$. The error $approx 0.0003$ is indeed less than $0.001$.
$endgroup$
add a comment |
$begingroup$
You don't have to compute the derivatives as you do.
Use directly
- classical Taylor expansion :
$$ln(1+x)=x-tfracx^22+tfracx^33-tfracx^44-...tag1$$
with $x=0.4$ and
- the theorem about alternating series saying that the error done by truncating this series is less that the module of the first discarded term (i.e., the first one not present in the truncated series).
The condition is that this first discarded $n$th term is such
$$tfrac0.4^nnleq 0.001$$
Due to the fact that $tfrac0.4^66 < 0.001 < tfrac0.4^55$, we have $n=6$.
Thus we need $n-1=5$ terms in expansion (1).
Verification : $ln(1.4)= 0.3364722366...$ whereas
$0.4-tfrac0.4^22+tfrac0.4^33-tfrac0.4^44+tfrac0.4^55=0.3369813333...$. The error $approx 0.0003$ is indeed less than $0.001$.
$endgroup$
You don't have to compute the derivatives as you do.
Use directly
- classical Taylor expansion :
$$ln(1+x)=x-tfracx^22+tfracx^33-tfracx^44-...tag1$$
with $x=0.4$ and
- the theorem about alternating series saying that the error done by truncating this series is less that the module of the first discarded term (i.e., the first one not present in the truncated series).
The condition is that this first discarded $n$th term is such
$$tfrac0.4^nnleq 0.001$$
Due to the fact that $tfrac0.4^66 < 0.001 < tfrac0.4^55$, we have $n=6$.
Thus we need $n-1=5$ terms in expansion (1).
Verification : $ln(1.4)= 0.3364722366...$ whereas
$0.4-tfrac0.4^22+tfrac0.4^33-tfrac0.4^44+tfrac0.4^55=0.3369813333...$. The error $approx 0.0003$ is indeed less than $0.001$.
edited 15 mins ago
answered 1 hour ago
Jean MarieJean Marie
31.6k42355
31.6k42355
add a comment |
add a comment |
$begingroup$
First of all, you do need the MacLaurin series $$ tag1ln(1+x)=sum_k=0^infty a_kx^k.$$
Given that the derivative of $ln(1+x)$ is $frac11+x$, and from the geometric series
$$ frac11+x=sum_k=0^infty (-1)^kx^k,$$
you ought to see that $a_k=frac(-1)^k-1k$ for $k>0$ (and $a_0=0$).
In particular, for $0<x<1$, $(1)$ is an alternating series with secreasong (in absolute value) terms. Hence we can just stop when the further summands would be smaller than the desired error bound, without checking any specific error formula.
In other words, we find $n$ with $frac0.4^nn<0.001$ and then take $sum_k=0^n-1frac-(-0.4)^kk$ as our approximation of $ln(1.4)$.
Explicitly,
$$ ln(1.4)approx 0.4-0.08+0.021overline3-0.0064+0.002048$$
with the next summand $-0.000682overline6$ already small enough.
$endgroup$
add a comment |
$begingroup$
First of all, you do need the MacLaurin series $$ tag1ln(1+x)=sum_k=0^infty a_kx^k.$$
Given that the derivative of $ln(1+x)$ is $frac11+x$, and from the geometric series
$$ frac11+x=sum_k=0^infty (-1)^kx^k,$$
you ought to see that $a_k=frac(-1)^k-1k$ for $k>0$ (and $a_0=0$).
In particular, for $0<x<1$, $(1)$ is an alternating series with secreasong (in absolute value) terms. Hence we can just stop when the further summands would be smaller than the desired error bound, without checking any specific error formula.
In other words, we find $n$ with $frac0.4^nn<0.001$ and then take $sum_k=0^n-1frac-(-0.4)^kk$ as our approximation of $ln(1.4)$.
Explicitly,
$$ ln(1.4)approx 0.4-0.08+0.021overline3-0.0064+0.002048$$
with the next summand $-0.000682overline6$ already small enough.
$endgroup$
add a comment |
$begingroup$
First of all, you do need the MacLaurin series $$ tag1ln(1+x)=sum_k=0^infty a_kx^k.$$
Given that the derivative of $ln(1+x)$ is $frac11+x$, and from the geometric series
$$ frac11+x=sum_k=0^infty (-1)^kx^k,$$
you ought to see that $a_k=frac(-1)^k-1k$ for $k>0$ (and $a_0=0$).
In particular, for $0<x<1$, $(1)$ is an alternating series with secreasong (in absolute value) terms. Hence we can just stop when the further summands would be smaller than the desired error bound, without checking any specific error formula.
In other words, we find $n$ with $frac0.4^nn<0.001$ and then take $sum_k=0^n-1frac-(-0.4)^kk$ as our approximation of $ln(1.4)$.
Explicitly,
$$ ln(1.4)approx 0.4-0.08+0.021overline3-0.0064+0.002048$$
with the next summand $-0.000682overline6$ already small enough.
$endgroup$
First of all, you do need the MacLaurin series $$ tag1ln(1+x)=sum_k=0^infty a_kx^k.$$
Given that the derivative of $ln(1+x)$ is $frac11+x$, and from the geometric series
$$ frac11+x=sum_k=0^infty (-1)^kx^k,$$
you ought to see that $a_k=frac(-1)^k-1k$ for $k>0$ (and $a_0=0$).
In particular, for $0<x<1$, $(1)$ is an alternating series with secreasong (in absolute value) terms. Hence we can just stop when the further summands would be smaller than the desired error bound, without checking any specific error formula.
In other words, we find $n$ with $frac0.4^nn<0.001$ and then take $sum_k=0^n-1frac-(-0.4)^kk$ as our approximation of $ln(1.4)$.
Explicitly,
$$ ln(1.4)approx 0.4-0.08+0.021overline3-0.0064+0.002048$$
with the next summand $-0.000682overline6$ already small enough.
answered 59 mins ago
Hagen von EitzenHagen von Eitzen
283k23273508
283k23273508
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3193207%2fhow-many-terms-of-the-maclaurin-series-for-ln1x-do-you-need-to-use-to-esti%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown