Finding definite integral using Riemann sum theorem
EDIT: My question has been answered and I've solve the problem, thanks for the help.
I'm having some difficulty with a problem from the "Calculus, Early Transcendentals" textbook, section 5.2 number #24. The problem is as follows:
Use the form of the definition of the integral given in Theorem 4 to evaluate the integral:
$$ int_0^5 (1+2x^3) dx$$
Theorem 4 states that:
If f is integrable on [a, b] then:
$$ int_a^b f(x) dx = lim_{n to infty} sumlimits_{i=1}^n f(x_i) Delta x $$
where
$ Delta x = frac{b-a}{n} $ and $x_i = a + i Delta x$
The problem I'm running into is that, when trying to solve it, I get stuff like $i^4$ which I don't know the summation of.
I'm attaching my work here as an image because I find it pretty tough to use latex.
Thank you VERY much for any help! :)
calculus
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
add a comment |
EDIT: My question has been answered and I've solve the problem, thanks for the help.
I'm having some difficulty with a problem from the "Calculus, Early Transcendentals" textbook, section 5.2 number #24. The problem is as follows:
Use the form of the definition of the integral given in Theorem 4 to evaluate the integral:
$$ int_0^5 (1+2x^3) dx$$
Theorem 4 states that:
If f is integrable on [a, b] then:
$$ int_a^b f(x) dx = lim_{n to infty} sumlimits_{i=1}^n f(x_i) Delta x $$
where
$ Delta x = frac{b-a}{n} $ and $x_i = a + i Delta x$
The problem I'm running into is that, when trying to solve it, I get stuff like $i^4$ which I don't know the summation of.
I'm attaching my work here as an image because I find it pretty tough to use latex.
Thank you VERY much for any help! :)
calculus
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
add a comment |
EDIT: My question has been answered and I've solve the problem, thanks for the help.
I'm having some difficulty with a problem from the "Calculus, Early Transcendentals" textbook, section 5.2 number #24. The problem is as follows:
Use the form of the definition of the integral given in Theorem 4 to evaluate the integral:
$$ int_0^5 (1+2x^3) dx$$
Theorem 4 states that:
If f is integrable on [a, b] then:
$$ int_a^b f(x) dx = lim_{n to infty} sumlimits_{i=1}^n f(x_i) Delta x $$
where
$ Delta x = frac{b-a}{n} $ and $x_i = a + i Delta x$
The problem I'm running into is that, when trying to solve it, I get stuff like $i^4$ which I don't know the summation of.
I'm attaching my work here as an image because I find it pretty tough to use latex.
Thank you VERY much for any help! :)
calculus
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
EDIT: My question has been answered and I've solve the problem, thanks for the help.
I'm having some difficulty with a problem from the "Calculus, Early Transcendentals" textbook, section 5.2 number #24. The problem is as follows:
Use the form of the definition of the integral given in Theorem 4 to evaluate the integral:
$$ int_0^5 (1+2x^3) dx$$
Theorem 4 states that:
If f is integrable on [a, b] then:
$$ int_a^b f(x) dx = lim_{n to infty} sumlimits_{i=1}^n f(x_i) Delta x $$
where
$ Delta x = frac{b-a}{n} $ and $x_i = a + i Delta x$
The problem I'm running into is that, when trying to solve it, I get stuff like $i^4$ which I don't know the summation of.
I'm attaching my work here as an image because I find it pretty tough to use latex.
Thank you VERY much for any help! :)
calculus
calculus
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
edited Feb 23 '14 at 20:41
GuiR
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
asked Feb 23 '14 at 3:38
GuiRGuiR
1815
1815
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
I am sorry for overlooking it earlier, but in the evaluation of $sumlimits_{i=1}^n f(x_i)Delta_{x_i} = sumlimits_{i=1}^n (1+(frac{5i}{n})^3).(frac{5}{n}) = 5 + frac{625}{n^4}(sumlimits_{i=1}^n i^3)$,
So you wont be needing $sumlimits_{i=1}^n i^4$ as such.
But if you are still interested in knowing how to find the summation without having to apply mathematical induction I know a fast way of arguing combinatorially for $n>6$,
Count the number of quintuples $(x_1,x_2,x_3, x_4,x_5)$ with the property $x_5> maxlimits_{iin S}$ from the set $S={1,2,...,n,n+1}$,
then as $x_5$ varies from $2$ to $n+1$, the positions $(x_1,x_2,x_3, x_4)$
the positions can be filled in $sumlimits_{i=1}^n i^4$ ways.
Counting it according to the cases: $5 = 4 + 1 = 2 + 2 + 1 = 3 + 1 + 1 = 2+1+1+1=1+1+1+1+1$ (where the numbers in partitions indicate the number of equal components in that partition, i.e. for example $5=4+1$ corresponds to the case $x_1=x_2=x_3=x_4<x_5$; and $2+2+1$ corresponds to the case two pairs have equal value but the value of the pair are different ,.. and so on). Count the number of ways in which each of the partitioning can happen: $1,14,36,24$ respectively (in the same order as I have presented the partitions).
You get the number of ways to be: ${n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5}$
Therefore, $sumlimits_{i=1}^n i^4 = {n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5} = (1/5)n^5 + (1/2)n^4 + (1/3)n^3 - (1/30)n$.
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f686699%2ffinding-definite-integral-using-riemann-sum-theorem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
I am sorry for overlooking it earlier, but in the evaluation of $sumlimits_{i=1}^n f(x_i)Delta_{x_i} = sumlimits_{i=1}^n (1+(frac{5i}{n})^3).(frac{5}{n}) = 5 + frac{625}{n^4}(sumlimits_{i=1}^n i^3)$,
So you wont be needing $sumlimits_{i=1}^n i^4$ as such.
But if you are still interested in knowing how to find the summation without having to apply mathematical induction I know a fast way of arguing combinatorially for $n>6$,
Count the number of quintuples $(x_1,x_2,x_3, x_4,x_5)$ with the property $x_5> maxlimits_{iin S}$ from the set $S={1,2,...,n,n+1}$,
then as $x_5$ varies from $2$ to $n+1$, the positions $(x_1,x_2,x_3, x_4)$
the positions can be filled in $sumlimits_{i=1}^n i^4$ ways.
Counting it according to the cases: $5 = 4 + 1 = 2 + 2 + 1 = 3 + 1 + 1 = 2+1+1+1=1+1+1+1+1$ (where the numbers in partitions indicate the number of equal components in that partition, i.e. for example $5=4+1$ corresponds to the case $x_1=x_2=x_3=x_4<x_5$; and $2+2+1$ corresponds to the case two pairs have equal value but the value of the pair are different ,.. and so on). Count the number of ways in which each of the partitioning can happen: $1,14,36,24$ respectively (in the same order as I have presented the partitions).
You get the number of ways to be: ${n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5}$
Therefore, $sumlimits_{i=1}^n i^4 = {n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5} = (1/5)n^5 + (1/2)n^4 + (1/3)n^3 - (1/30)n$.
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
add a comment |
I am sorry for overlooking it earlier, but in the evaluation of $sumlimits_{i=1}^n f(x_i)Delta_{x_i} = sumlimits_{i=1}^n (1+(frac{5i}{n})^3).(frac{5}{n}) = 5 + frac{625}{n^4}(sumlimits_{i=1}^n i^3)$,
So you wont be needing $sumlimits_{i=1}^n i^4$ as such.
But if you are still interested in knowing how to find the summation without having to apply mathematical induction I know a fast way of arguing combinatorially for $n>6$,
Count the number of quintuples $(x_1,x_2,x_3, x_4,x_5)$ with the property $x_5> maxlimits_{iin S}$ from the set $S={1,2,...,n,n+1}$,
then as $x_5$ varies from $2$ to $n+1$, the positions $(x_1,x_2,x_3, x_4)$
the positions can be filled in $sumlimits_{i=1}^n i^4$ ways.
Counting it according to the cases: $5 = 4 + 1 = 2 + 2 + 1 = 3 + 1 + 1 = 2+1+1+1=1+1+1+1+1$ (where the numbers in partitions indicate the number of equal components in that partition, i.e. for example $5=4+1$ corresponds to the case $x_1=x_2=x_3=x_4<x_5$; and $2+2+1$ corresponds to the case two pairs have equal value but the value of the pair are different ,.. and so on). Count the number of ways in which each of the partitioning can happen: $1,14,36,24$ respectively (in the same order as I have presented the partitions).
You get the number of ways to be: ${n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5}$
Therefore, $sumlimits_{i=1}^n i^4 = {n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5} = (1/5)n^5 + (1/2)n^4 + (1/3)n^3 - (1/30)n$.
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
add a comment |
I am sorry for overlooking it earlier, but in the evaluation of $sumlimits_{i=1}^n f(x_i)Delta_{x_i} = sumlimits_{i=1}^n (1+(frac{5i}{n})^3).(frac{5}{n}) = 5 + frac{625}{n^4}(sumlimits_{i=1}^n i^3)$,
So you wont be needing $sumlimits_{i=1}^n i^4$ as such.
But if you are still interested in knowing how to find the summation without having to apply mathematical induction I know a fast way of arguing combinatorially for $n>6$,
Count the number of quintuples $(x_1,x_2,x_3, x_4,x_5)$ with the property $x_5> maxlimits_{iin S}$ from the set $S={1,2,...,n,n+1}$,
then as $x_5$ varies from $2$ to $n+1$, the positions $(x_1,x_2,x_3, x_4)$
the positions can be filled in $sumlimits_{i=1}^n i^4$ ways.
Counting it according to the cases: $5 = 4 + 1 = 2 + 2 + 1 = 3 + 1 + 1 = 2+1+1+1=1+1+1+1+1$ (where the numbers in partitions indicate the number of equal components in that partition, i.e. for example $5=4+1$ corresponds to the case $x_1=x_2=x_3=x_4<x_5$; and $2+2+1$ corresponds to the case two pairs have equal value but the value of the pair are different ,.. and so on). Count the number of ways in which each of the partitioning can happen: $1,14,36,24$ respectively (in the same order as I have presented the partitions).
You get the number of ways to be: ${n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5}$
Therefore, $sumlimits_{i=1}^n i^4 = {n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5} = (1/5)n^5 + (1/2)n^4 + (1/3)n^3 - (1/30)n$.
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
I am sorry for overlooking it earlier, but in the evaluation of $sumlimits_{i=1}^n f(x_i)Delta_{x_i} = sumlimits_{i=1}^n (1+(frac{5i}{n})^3).(frac{5}{n}) = 5 + frac{625}{n^4}(sumlimits_{i=1}^n i^3)$,
So you wont be needing $sumlimits_{i=1}^n i^4$ as such.
But if you are still interested in knowing how to find the summation without having to apply mathematical induction I know a fast way of arguing combinatorially for $n>6$,
Count the number of quintuples $(x_1,x_2,x_3, x_4,x_5)$ with the property $x_5> maxlimits_{iin S}$ from the set $S={1,2,...,n,n+1}$,
then as $x_5$ varies from $2$ to $n+1$, the positions $(x_1,x_2,x_3, x_4)$
the positions can be filled in $sumlimits_{i=1}^n i^4$ ways.
Counting it according to the cases: $5 = 4 + 1 = 2 + 2 + 1 = 3 + 1 + 1 = 2+1+1+1=1+1+1+1+1$ (where the numbers in partitions indicate the number of equal components in that partition, i.e. for example $5=4+1$ corresponds to the case $x_1=x_2=x_3=x_4<x_5$; and $2+2+1$ corresponds to the case two pairs have equal value but the value of the pair are different ,.. and so on). Count the number of ways in which each of the partitioning can happen: $1,14,36,24$ respectively (in the same order as I have presented the partitions).
You get the number of ways to be: ${n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5}$
Therefore, $sumlimits_{i=1}^n i^4 = {n+1choose 2}+14{n+1choose 3}+36{n+1 choose 4}+24{n+1choose 5} = (1/5)n^5 + (1/2)n^4 + (1/3)n^3 - (1/30)n$.
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
edited Feb 23 '14 at 19:23
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
answered Feb 23 '14 at 3:43
r9mr9m
13.2k23970
13.2k23970
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
add a comment |
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
How did you find this? Isn't there another way to solve this problem? The book provided formulas for $i, i^2$, and $i^3$ but not for $i^4$, which leads me to believe there might be another way of solving it that doesn't involve this...
– GuiR
Feb 23 '14 at 17:09
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
I Edited the answer:)
– r9m
Feb 23 '14 at 19:25
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
Thanks! I learned something new hehe. I found my error in my work and turns out I don't need $i^4$ at all, but thanks!
– GuiR
Feb 23 '14 at 20:40
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%2f686699%2ffinding-definite-integral-using-riemann-sum-theorem%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
