upper and lower sum answer not matching











up vote
0
down vote

favorite












I have to show that f is integrable using the Riemann criterion where
f(x) = x on [0, 1]. I am a bit confused over how my solution differs from the hint to solution of that question I have.
My approach is below:



Let partition P = {0 , 1/n , 2/n , ..... , (n-1)/n , n/n}.



So, U(P,f) = ∑(1/n) . { f(1/n) + f(2/n) + ....... + f(n/n) }

And, L(p,f) = ∑(1/n) . { f(0) + f(2/n) + ....... + f(n-1/n) }

Then, U(P,f) - L(P,f) = ( f(n/n) - f(0) )/n
= 1/n -> 0



Hint to solution given :
link is here



I am very confused over how did they get the result 1/n² , instead of my 1/n . Please help me out.






calculus







share|cite|improve this question




















  • 1




    I believe the hint is wrong.
    – B. Goddard
    Nov 17 at 13:42















up vote
0
down vote

favorite












I have to show that f is integrable using the Riemann criterion where
f(x) = x on [0, 1]. I am a bit confused over how my solution differs from the hint to solution of that question I have.
My approach is below:



Let partition P = {0 , 1/n , 2/n , ..... , (n-1)/n , n/n}.



So, U(P,f) = ∑(1/n) . { f(1/n) + f(2/n) + ....... + f(n/n) }

And, L(p,f) = ∑(1/n) . { f(0) + f(2/n) + ....... + f(n-1/n) }

Then, U(P,f) - L(P,f) = ( f(n/n) - f(0) )/n
= 1/n -> 0



Hint to solution given :
link is here



I am very confused over how did they get the result 1/n² , instead of my 1/n . Please help me out.






calculus







share|cite|improve this question




















  • 1




    I believe the hint is wrong.
    – B. Goddard
    Nov 17 at 13:42













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have to show that f is integrable using the Riemann criterion where
f(x) = x on [0, 1]. I am a bit confused over how my solution differs from the hint to solution of that question I have.
My approach is below:



Let partition P = {0 , 1/n , 2/n , ..... , (n-1)/n , n/n}.



So, U(P,f) = ∑(1/n) . { f(1/n) + f(2/n) + ....... + f(n/n) }

And, L(p,f) = ∑(1/n) . { f(0) + f(2/n) + ....... + f(n-1/n) }

Then, U(P,f) - L(P,f) = ( f(n/n) - f(0) )/n
= 1/n -> 0



Hint to solution given :
link is here



I am very confused over how did they get the result 1/n² , instead of my 1/n . Please help me out.






calculus







share|cite|improve this question















I have to show that f is integrable using the Riemann criterion where
f(x) = x on [0, 1]. I am a bit confused over how my solution differs from the hint to solution of that question I have.
My approach is below:



Let partition P = {0 , 1/n , 2/n , ..... , (n-1)/n , n/n}.



So, U(P,f) = ∑(1/n) . { f(1/n) + f(2/n) + ....... + f(n/n) }

And, L(p,f) = ∑(1/n) . { f(0) + f(2/n) + ....... + f(n-1/n) }

Then, U(P,f) - L(P,f) = ( f(n/n) - f(0) )/n
= 1/n -> 0



Hint to solution given :
link is here



I am very confused over how did they get the result 1/n² , instead of my 1/n . Please help me out.






calculus




calculus






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 17 at 10:42









Parcly Taxel

41k137199




41k137199










asked Nov 17 at 10:42









Kaustav Bhattacharjee

61




61








  • 1




    I believe the hint is wrong.
    – B. Goddard
    Nov 17 at 13:42














  • 1




    I believe the hint is wrong.
    – B. Goddard
    Nov 17 at 13:42








1




1




I believe the hint is wrong.
– B. Goddard
Nov 17 at 13:42




I believe the hint is wrong.
– B. Goddard
Nov 17 at 13:42















active

oldest

votes











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',
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
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002195%2fupper-and-lower-sum-answer-not-matching%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002195%2fupper-and-lower-sum-answer-not-matching%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Quarter-circle Tiles

Image
up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
Read more

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Image
0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
Read more

Mont Emei

Image
Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
Read more