find the value of L?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite












Suppose f is continuous on $[0,1]$. Find



$$L=lim_nrightarrow infty frac1n sum_k=1^n (-1)^k f(frackn) $$



My attempts : I was thinking about Riemann sum... but $(-1)^k$ creates confusion.



Thanks in advance.







share|cite|improve this question


















  • 1




    Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
    – Did
    Aug 18 at 6:54







  • 1




    I have completed this by using Riemann sum. Feel free to check my answer if interested.
    – xbh
    Aug 18 at 8:57











  • thanks u.. @xbh
    – stupid
    Aug 19 at 7:07














up vote
4
down vote

favorite












Suppose f is continuous on $[0,1]$. Find



$$L=lim_nrightarrow infty frac1n sum_k=1^n (-1)^k f(frackn) $$



My attempts : I was thinking about Riemann sum... but $(-1)^k$ creates confusion.



Thanks in advance.







share|cite|improve this question


















  • 1




    Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
    – Did
    Aug 18 at 6:54







  • 1




    I have completed this by using Riemann sum. Feel free to check my answer if interested.
    – xbh
    Aug 18 at 8:57











  • thanks u.. @xbh
    – stupid
    Aug 19 at 7:07












up vote
4
down vote

favorite









up vote
4
down vote

favorite











Suppose f is continuous on $[0,1]$. Find



$$L=lim_nrightarrow infty frac1n sum_k=1^n (-1)^k f(frackn) $$



My attempts : I was thinking about Riemann sum... but $(-1)^k$ creates confusion.



Thanks in advance.







share|cite|improve this question














Suppose f is continuous on $[0,1]$. Find



$$L=lim_nrightarrow infty frac1n sum_k=1^n (-1)^k f(frackn) $$



My attempts : I was thinking about Riemann sum... but $(-1)^k$ creates confusion.



Thanks in advance.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 18 at 9:01









Bernard

111k635103




111k635103










asked Aug 18 at 6:20









stupid

627110




627110







  • 1




    Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
    – Did
    Aug 18 at 6:54







  • 1




    I have completed this by using Riemann sum. Feel free to check my answer if interested.
    – xbh
    Aug 18 at 8:57











  • thanks u.. @xbh
    – stupid
    Aug 19 at 7:07












  • 1




    Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
    – Did
    Aug 18 at 6:54







  • 1




    I have completed this by using Riemann sum. Feel free to check my answer if interested.
    – xbh
    Aug 18 at 8:57











  • thanks u.. @xbh
    – stupid
    Aug 19 at 7:07







1




1




Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
– Did
Aug 18 at 6:54





Hint to conclude using Riemann sums: Write this as the difference of two Riemann sums of $f$.
– Did
Aug 18 at 6:54





1




1




I have completed this by using Riemann sum. Feel free to check my answer if interested.
– xbh
Aug 18 at 8:57





I have completed this by using Riemann sum. Feel free to check my answer if interested.
– xbh
Aug 18 at 8:57













thanks u.. @xbh
– stupid
Aug 19 at 7:07




thanks u.. @xbh
– stupid
Aug 19 at 7:07










3 Answers
3






active

oldest

votes

















up vote
3
down vote



accepted










I am here to give an analogous example. Maybe this method is also applicable to your question.



Compute $sum_1^infty (-1)^n-1 1/n$.



If we have some knowledge about harmonic series $sum_1^infty 1/n$:
$$
1 +frac 12 + frac 13 + cdots + frac 1n = log(n) + gamma + o(1) quad [n to infty],
$$
where $gamma$ is the Euler constant, then we could rewrite
$$
1-frac 12 + frac 13 - frac 14 + cdots + (-1)^n-1 frac 1n = sum_1^n frac 1j - 2 sum_1^lfloor n/2rfloor frac 1k,
$$
and use the asymptotic estimate above to get the result.



UPDATE



Solution. $blacktriangleleft$ Let $s_n = sum_1^n (-1)^k-1 f(k/n)$. Then $-L = lim s_n$ if $s_n$ converges.



Consider $s_2n$. By the similar operation above,
$$
s_2n = frac 12nleft(fleft( frac 12nright) + fleft(frac 22n right)+ cdots + fleft(frac 2n2n right) right) - 2 cdot frac 1 2n left( f left( frac 1nright)+ f left(frac 2nright) + cdots + fleft(frac nnright) right).
$$
Since $f in mathcal C[0,1]$, $f in mathcal R[0,1]$. Then
$$
lim s_2n = lim_n frac 12n sum_1^2n fleft( frac j2nright) - lim_n frac 1n sum_1^n f left(frac jn right) = int_0^1 f - int_0^1 f = 0.
$$
Now for $s_2n+1$,
$$
s_2n+1 = frac 1 2n+1 sum_1^2n+1 f left( frac j2n+1 right) - frac 2 2n+1 sum_1^n f left( frac 2j2n+1right).
$$
Clearly,
$$
frac j-1n leqslant frac 2j2n+1 = frac j n+1/2 leqslant frac jn,
$$
where the first inequality holds because of
$$
frac j-1n leqslant frac 2j2n+1 iff (j-1)(2n+1) leqslant 2jn iff -(2n+1) + j leqslant 0 quad [j leqslant n].
$$
Thus $(1/n)sum_1^n f(2j/(2n+1))$ is a Riemann sum w.r.t. to the partition $0, 1/n, 2/n, ldots, 1$. Then
$$
lim s_2n+1 =lim frac 12n+1 sum_1^2n+1 f left( frac j 2n+1right) - lim frac 2n2n+1 cdot lim frac 1n sum_1^n fleft( frac 2j2n+1right) = int_0^1 f - int_0^1 f = 0.
$$
Therefore $s_n$ is a sequence that $lim s_2n = lim s_2n+1 = 0$. Conclusively, $L = 0$. $blacktriangleright$



Seems that $f in mathcal R [0,1]$ might be sufficient.






share|cite|improve this answer






















  • I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
    – A. Pongrácz
    Aug 18 at 7:58










  • @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
    – xbh
    Aug 18 at 8:03










  • I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
    – A. Pongrácz
    Aug 18 at 8:04











  • +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
    – Paramanand Singh
    Aug 18 at 18:56

















up vote
3
down vote













Contrary to your name, you are not stupid.
You possess a very important ability in problem solving: realizing when you took the wrong approach. In such a case, you just have to abandon that road, and think about a different one.



Here, continuity is the key. Moreover, continuity on a bounded, closed interval, which implies uniform continuity. So if $n$ is large, the values $f(k/n)$ and $f((k+1)/n)$ are very close to each other.



I hope this hint helps. Mind the borders! What if $n$ is odd? What if $n$ is even?






share|cite|improve this answer



























    up vote
    2
    down vote













    If $f$ is continuous on $[0,1]$ it is uniformly continuous; for any $ngeq 1$ let $$Delta_n = sup_substackx-yleft|f(x)-f(y)right|$$
    and $M=sup_xin[0,1]left|f(x)right|$. By the triangle inequality
    $$ left|sum_k=1^n(-1)^k fleft(tfracknright)right| leq M + fracn2Delta_n $$
    and since $Delta_n to 0$ as $nto +infty$, the wanted limit is zero.






    share|cite|improve this answer




















      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: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      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%2f2886467%2ffind-the-value-of-l%23new-answer', 'question_page');

      );

      Post as a guest






























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      3
      down vote



      accepted










      I am here to give an analogous example. Maybe this method is also applicable to your question.



      Compute $sum_1^infty (-1)^n-1 1/n$.



      If we have some knowledge about harmonic series $sum_1^infty 1/n$:
      $$
      1 +frac 12 + frac 13 + cdots + frac 1n = log(n) + gamma + o(1) quad [n to infty],
      $$
      where $gamma$ is the Euler constant, then we could rewrite
      $$
      1-frac 12 + frac 13 - frac 14 + cdots + (-1)^n-1 frac 1n = sum_1^n frac 1j - 2 sum_1^lfloor n/2rfloor frac 1k,
      $$
      and use the asymptotic estimate above to get the result.



      UPDATE



      Solution. $blacktriangleleft$ Let $s_n = sum_1^n (-1)^k-1 f(k/n)$. Then $-L = lim s_n$ if $s_n$ converges.



      Consider $s_2n$. By the similar operation above,
      $$
      s_2n = frac 12nleft(fleft( frac 12nright) + fleft(frac 22n right)+ cdots + fleft(frac 2n2n right) right) - 2 cdot frac 1 2n left( f left( frac 1nright)+ f left(frac 2nright) + cdots + fleft(frac nnright) right).
      $$
      Since $f in mathcal C[0,1]$, $f in mathcal R[0,1]$. Then
      $$
      lim s_2n = lim_n frac 12n sum_1^2n fleft( frac j2nright) - lim_n frac 1n sum_1^n f left(frac jn right) = int_0^1 f - int_0^1 f = 0.
      $$
      Now for $s_2n+1$,
      $$
      s_2n+1 = frac 1 2n+1 sum_1^2n+1 f left( frac j2n+1 right) - frac 2 2n+1 sum_1^n f left( frac 2j2n+1right).
      $$
      Clearly,
      $$
      frac j-1n leqslant frac 2j2n+1 = frac j n+1/2 leqslant frac jn,
      $$
      where the first inequality holds because of
      $$
      frac j-1n leqslant frac 2j2n+1 iff (j-1)(2n+1) leqslant 2jn iff -(2n+1) + j leqslant 0 quad [j leqslant n].
      $$
      Thus $(1/n)sum_1^n f(2j/(2n+1))$ is a Riemann sum w.r.t. to the partition $0, 1/n, 2/n, ldots, 1$. Then
      $$
      lim s_2n+1 =lim frac 12n+1 sum_1^2n+1 f left( frac j 2n+1right) - lim frac 2n2n+1 cdot lim frac 1n sum_1^n fleft( frac 2j2n+1right) = int_0^1 f - int_0^1 f = 0.
      $$
      Therefore $s_n$ is a sequence that $lim s_2n = lim s_2n+1 = 0$. Conclusively, $L = 0$. $blacktriangleright$



      Seems that $f in mathcal R [0,1]$ might be sufficient.






      share|cite|improve this answer






















      • I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
        – A. Pongrácz
        Aug 18 at 7:58










      • @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
        – xbh
        Aug 18 at 8:03










      • I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
        – A. Pongrácz
        Aug 18 at 8:04











      • +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
        – Paramanand Singh
        Aug 18 at 18:56














      up vote
      3
      down vote



      accepted










      I am here to give an analogous example. Maybe this method is also applicable to your question.



      Compute $sum_1^infty (-1)^n-1 1/n$.



      If we have some knowledge about harmonic series $sum_1^infty 1/n$:
      $$
      1 +frac 12 + frac 13 + cdots + frac 1n = log(n) + gamma + o(1) quad [n to infty],
      $$
      where $gamma$ is the Euler constant, then we could rewrite
      $$
      1-frac 12 + frac 13 - frac 14 + cdots + (-1)^n-1 frac 1n = sum_1^n frac 1j - 2 sum_1^lfloor n/2rfloor frac 1k,
      $$
      and use the asymptotic estimate above to get the result.



      UPDATE



      Solution. $blacktriangleleft$ Let $s_n = sum_1^n (-1)^k-1 f(k/n)$. Then $-L = lim s_n$ if $s_n$ converges.



      Consider $s_2n$. By the similar operation above,
      $$
      s_2n = frac 12nleft(fleft( frac 12nright) + fleft(frac 22n right)+ cdots + fleft(frac 2n2n right) right) - 2 cdot frac 1 2n left( f left( frac 1nright)+ f left(frac 2nright) + cdots + fleft(frac nnright) right).
      $$
      Since $f in mathcal C[0,1]$, $f in mathcal R[0,1]$. Then
      $$
      lim s_2n = lim_n frac 12n sum_1^2n fleft( frac j2nright) - lim_n frac 1n sum_1^n f left(frac jn right) = int_0^1 f - int_0^1 f = 0.
      $$
      Now for $s_2n+1$,
      $$
      s_2n+1 = frac 1 2n+1 sum_1^2n+1 f left( frac j2n+1 right) - frac 2 2n+1 sum_1^n f left( frac 2j2n+1right).
      $$
      Clearly,
      $$
      frac j-1n leqslant frac 2j2n+1 = frac j n+1/2 leqslant frac jn,
      $$
      where the first inequality holds because of
      $$
      frac j-1n leqslant frac 2j2n+1 iff (j-1)(2n+1) leqslant 2jn iff -(2n+1) + j leqslant 0 quad [j leqslant n].
      $$
      Thus $(1/n)sum_1^n f(2j/(2n+1))$ is a Riemann sum w.r.t. to the partition $0, 1/n, 2/n, ldots, 1$. Then
      $$
      lim s_2n+1 =lim frac 12n+1 sum_1^2n+1 f left( frac j 2n+1right) - lim frac 2n2n+1 cdot lim frac 1n sum_1^n fleft( frac 2j2n+1right) = int_0^1 f - int_0^1 f = 0.
      $$
      Therefore $s_n$ is a sequence that $lim s_2n = lim s_2n+1 = 0$. Conclusively, $L = 0$. $blacktriangleright$



      Seems that $f in mathcal R [0,1]$ might be sufficient.






      share|cite|improve this answer






















      • I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
        – A. Pongrácz
        Aug 18 at 7:58










      • @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
        – xbh
        Aug 18 at 8:03










      • I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
        – A. Pongrácz
        Aug 18 at 8:04











      • +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
        – Paramanand Singh
        Aug 18 at 18:56












      up vote
      3
      down vote



      accepted







      up vote
      3
      down vote



      accepted






      I am here to give an analogous example. Maybe this method is also applicable to your question.



      Compute $sum_1^infty (-1)^n-1 1/n$.



      If we have some knowledge about harmonic series $sum_1^infty 1/n$:
      $$
      1 +frac 12 + frac 13 + cdots + frac 1n = log(n) + gamma + o(1) quad [n to infty],
      $$
      where $gamma$ is the Euler constant, then we could rewrite
      $$
      1-frac 12 + frac 13 - frac 14 + cdots + (-1)^n-1 frac 1n = sum_1^n frac 1j - 2 sum_1^lfloor n/2rfloor frac 1k,
      $$
      and use the asymptotic estimate above to get the result.



      UPDATE



      Solution. $blacktriangleleft$ Let $s_n = sum_1^n (-1)^k-1 f(k/n)$. Then $-L = lim s_n$ if $s_n$ converges.



      Consider $s_2n$. By the similar operation above,
      $$
      s_2n = frac 12nleft(fleft( frac 12nright) + fleft(frac 22n right)+ cdots + fleft(frac 2n2n right) right) - 2 cdot frac 1 2n left( f left( frac 1nright)+ f left(frac 2nright) + cdots + fleft(frac nnright) right).
      $$
      Since $f in mathcal C[0,1]$, $f in mathcal R[0,1]$. Then
      $$
      lim s_2n = lim_n frac 12n sum_1^2n fleft( frac j2nright) - lim_n frac 1n sum_1^n f left(frac jn right) = int_0^1 f - int_0^1 f = 0.
      $$
      Now for $s_2n+1$,
      $$
      s_2n+1 = frac 1 2n+1 sum_1^2n+1 f left( frac j2n+1 right) - frac 2 2n+1 sum_1^n f left( frac 2j2n+1right).
      $$
      Clearly,
      $$
      frac j-1n leqslant frac 2j2n+1 = frac j n+1/2 leqslant frac jn,
      $$
      where the first inequality holds because of
      $$
      frac j-1n leqslant frac 2j2n+1 iff (j-1)(2n+1) leqslant 2jn iff -(2n+1) + j leqslant 0 quad [j leqslant n].
      $$
      Thus $(1/n)sum_1^n f(2j/(2n+1))$ is a Riemann sum w.r.t. to the partition $0, 1/n, 2/n, ldots, 1$. Then
      $$
      lim s_2n+1 =lim frac 12n+1 sum_1^2n+1 f left( frac j 2n+1right) - lim frac 2n2n+1 cdot lim frac 1n sum_1^n fleft( frac 2j2n+1right) = int_0^1 f - int_0^1 f = 0.
      $$
      Therefore $s_n$ is a sequence that $lim s_2n = lim s_2n+1 = 0$. Conclusively, $L = 0$. $blacktriangleright$



      Seems that $f in mathcal R [0,1]$ might be sufficient.






      share|cite|improve this answer














      I am here to give an analogous example. Maybe this method is also applicable to your question.



      Compute $sum_1^infty (-1)^n-1 1/n$.



      If we have some knowledge about harmonic series $sum_1^infty 1/n$:
      $$
      1 +frac 12 + frac 13 + cdots + frac 1n = log(n) + gamma + o(1) quad [n to infty],
      $$
      where $gamma$ is the Euler constant, then we could rewrite
      $$
      1-frac 12 + frac 13 - frac 14 + cdots + (-1)^n-1 frac 1n = sum_1^n frac 1j - 2 sum_1^lfloor n/2rfloor frac 1k,
      $$
      and use the asymptotic estimate above to get the result.



      UPDATE



      Solution. $blacktriangleleft$ Let $s_n = sum_1^n (-1)^k-1 f(k/n)$. Then $-L = lim s_n$ if $s_n$ converges.



      Consider $s_2n$. By the similar operation above,
      $$
      s_2n = frac 12nleft(fleft( frac 12nright) + fleft(frac 22n right)+ cdots + fleft(frac 2n2n right) right) - 2 cdot frac 1 2n left( f left( frac 1nright)+ f left(frac 2nright) + cdots + fleft(frac nnright) right).
      $$
      Since $f in mathcal C[0,1]$, $f in mathcal R[0,1]$. Then
      $$
      lim s_2n = lim_n frac 12n sum_1^2n fleft( frac j2nright) - lim_n frac 1n sum_1^n f left(frac jn right) = int_0^1 f - int_0^1 f = 0.
      $$
      Now for $s_2n+1$,
      $$
      s_2n+1 = frac 1 2n+1 sum_1^2n+1 f left( frac j2n+1 right) - frac 2 2n+1 sum_1^n f left( frac 2j2n+1right).
      $$
      Clearly,
      $$
      frac j-1n leqslant frac 2j2n+1 = frac j n+1/2 leqslant frac jn,
      $$
      where the first inequality holds because of
      $$
      frac j-1n leqslant frac 2j2n+1 iff (j-1)(2n+1) leqslant 2jn iff -(2n+1) + j leqslant 0 quad [j leqslant n].
      $$
      Thus $(1/n)sum_1^n f(2j/(2n+1))$ is a Riemann sum w.r.t. to the partition $0, 1/n, 2/n, ldots, 1$. Then
      $$
      lim s_2n+1 =lim frac 12n+1 sum_1^2n+1 f left( frac j 2n+1right) - lim frac 2n2n+1 cdot lim frac 1n sum_1^n fleft( frac 2j2n+1right) = int_0^1 f - int_0^1 f = 0.
      $$
      Therefore $s_n$ is a sequence that $lim s_2n = lim s_2n+1 = 0$. Conclusively, $L = 0$. $blacktriangleright$



      Seems that $f in mathcal R [0,1]$ might be sufficient.







      share|cite|improve this answer














      share|cite|improve this answer



      share|cite|improve this answer








      edited Aug 18 at 9:07

























      answered Aug 18 at 6:57









      xbh

      2,402114




      2,402114











      • I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
        – A. Pongrácz
        Aug 18 at 7:58










      • @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
        – xbh
        Aug 18 at 8:03










      • I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
        – A. Pongrácz
        Aug 18 at 8:04











      • +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
        – Paramanand Singh
        Aug 18 at 18:56
















      • I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
        – A. Pongrácz
        Aug 18 at 7:58










      • @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
        – xbh
        Aug 18 at 8:03










      • I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
        – A. Pongrácz
        Aug 18 at 8:04











      • +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
        – Paramanand Singh
        Aug 18 at 18:56















      I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
      – A. Pongrácz
      Aug 18 at 7:58




      I don't think that this is related to the problem. In the post, there is a continuous function on a bounded, closed interval, which is very important. The result is $0$ because of a general principal. You showed an interesting, concrete summation, but it is irrelevant here.
      – A. Pongrácz
      Aug 18 at 7:58












      @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
      – xbh
      Aug 18 at 8:03




      @A.Pongrácz Thanks for your criticism. My point is to use similar operations to get rid of the factor $(-1)^k$ then $L$ could be computed by difference of two Riemann Sums. If this is still not convincing, then I would delete it.
      – xbh
      Aug 18 at 8:03












      I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
      – A. Pongrácz
      Aug 18 at 8:04





      I see what you mean now. But I still think this approach could only work in a very restricted setup, and in case of the problem posted, there is a clear general principle that solves the problem for all continuous functions. So what you suggested is a nice idea, and it could be useful in another problem, but nit this one.
      – A. Pongrácz
      Aug 18 at 8:04













      +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
      – Paramanand Singh
      Aug 18 at 18:56




      +1 for the updated version. And yes Riemann integrability of $f$ is sufficient as your proof clearly does not make use of any other assumption.
      – Paramanand Singh
      Aug 18 at 18:56










      up vote
      3
      down vote













      Contrary to your name, you are not stupid.
      You possess a very important ability in problem solving: realizing when you took the wrong approach. In such a case, you just have to abandon that road, and think about a different one.



      Here, continuity is the key. Moreover, continuity on a bounded, closed interval, which implies uniform continuity. So if $n$ is large, the values $f(k/n)$ and $f((k+1)/n)$ are very close to each other.



      I hope this hint helps. Mind the borders! What if $n$ is odd? What if $n$ is even?






      share|cite|improve this answer
























        up vote
        3
        down vote













        Contrary to your name, you are not stupid.
        You possess a very important ability in problem solving: realizing when you took the wrong approach. In such a case, you just have to abandon that road, and think about a different one.



        Here, continuity is the key. Moreover, continuity on a bounded, closed interval, which implies uniform continuity. So if $n$ is large, the values $f(k/n)$ and $f((k+1)/n)$ are very close to each other.



        I hope this hint helps. Mind the borders! What if $n$ is odd? What if $n$ is even?






        share|cite|improve this answer






















          up vote
          3
          down vote










          up vote
          3
          down vote









          Contrary to your name, you are not stupid.
          You possess a very important ability in problem solving: realizing when you took the wrong approach. In such a case, you just have to abandon that road, and think about a different one.



          Here, continuity is the key. Moreover, continuity on a bounded, closed interval, which implies uniform continuity. So if $n$ is large, the values $f(k/n)$ and $f((k+1)/n)$ are very close to each other.



          I hope this hint helps. Mind the borders! What if $n$ is odd? What if $n$ is even?






          share|cite|improve this answer












          Contrary to your name, you are not stupid.
          You possess a very important ability in problem solving: realizing when you took the wrong approach. In such a case, you just have to abandon that road, and think about a different one.



          Here, continuity is the key. Moreover, continuity on a bounded, closed interval, which implies uniform continuity. So if $n$ is large, the values $f(k/n)$ and $f((k+1)/n)$ are very close to each other.



          I hope this hint helps. Mind the borders! What if $n$ is odd? What if $n$ is even?







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Aug 18 at 6:28









          A. Pongrácz

          3,887625




          3,887625




















              up vote
              2
              down vote













              If $f$ is continuous on $[0,1]$ it is uniformly continuous; for any $ngeq 1$ let $$Delta_n = sup_substackx-yleft|f(x)-f(y)right|$$
              and $M=sup_xin[0,1]left|f(x)right|$. By the triangle inequality
              $$ left|sum_k=1^n(-1)^k fleft(tfracknright)right| leq M + fracn2Delta_n $$
              and since $Delta_n to 0$ as $nto +infty$, the wanted limit is zero.






              share|cite|improve this answer
























                up vote
                2
                down vote













                If $f$ is continuous on $[0,1]$ it is uniformly continuous; for any $ngeq 1$ let $$Delta_n = sup_substackx-yleft|f(x)-f(y)right|$$
                and $M=sup_xin[0,1]left|f(x)right|$. By the triangle inequality
                $$ left|sum_k=1^n(-1)^k fleft(tfracknright)right| leq M + fracn2Delta_n $$
                and since $Delta_n to 0$ as $nto +infty$, the wanted limit is zero.






                share|cite|improve this answer






















                  up vote
                  2
                  down vote










                  up vote
                  2
                  down vote









                  If $f$ is continuous on $[0,1]$ it is uniformly continuous; for any $ngeq 1$ let $$Delta_n = sup_substackx-yleft|f(x)-f(y)right|$$
                  and $M=sup_xin[0,1]left|f(x)right|$. By the triangle inequality
                  $$ left|sum_k=1^n(-1)^k fleft(tfracknright)right| leq M + fracn2Delta_n $$
                  and since $Delta_n to 0$ as $nto +infty$, the wanted limit is zero.






                  share|cite|improve this answer












                  If $f$ is continuous on $[0,1]$ it is uniformly continuous; for any $ngeq 1$ let $$Delta_n = sup_substackx-yleft|f(x)-f(y)right|$$
                  and $M=sup_xin[0,1]left|f(x)right|$. By the triangle inequality
                  $$ left|sum_k=1^n(-1)^k fleft(tfracknright)right| leq M + fracn2Delta_n $$
                  and since $Delta_n to 0$ as $nto +infty$, the wanted limit is zero.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Aug 18 at 15:21









                  Jack D'Aurizio♦

                  272k32267632




                  272k32267632






















                       

                      draft saved


                      draft discarded


























                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2886467%2ffind-the-value-of-l%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Mutual Information Always Non-negative

                      Why am i infinitely getting the same tweet with the Twitter Search API?