Finding value of $lim_nrightarrow inftyfrac1+frac12+frac13+ cdots +frac1n^3ln(n)$

Multi tool use
Multi tool use

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











up vote
4
down vote

favorite













Find the value of
$$lim_nrightarrow inftyfrac1+frac12+frac13+cdots +frac1n^3ln(n)$$




My Try: Using Stolz-Cesaro,



Let $displaystyle a_n = 1+frac12+frac13+cdots cdots +frac1n$
and $b_n = ln(n)$



So $displaystyle fraca_n+1-a_nb_n+1-b_n = lim_nrightarrow inftyfrac1(n+1)^3cdot frac1lnbigg(1+frac1nbigg) = 0$



Please explain if what I have done above is right.










share|cite|improve this question























  • I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
    – Kavi Rama Murthy
    Sep 10 at 8:51







  • 1




    You mean Stolz-Cesaro?
    – Kusma
    Sep 10 at 8:53






  • 1




    I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
    – Paramanand Singh
    Sep 10 at 13:26














up vote
4
down vote

favorite













Find the value of
$$lim_nrightarrow inftyfrac1+frac12+frac13+cdots +frac1n^3ln(n)$$




My Try: Using Stolz-Cesaro,



Let $displaystyle a_n = 1+frac12+frac13+cdots cdots +frac1n$
and $b_n = ln(n)$



So $displaystyle fraca_n+1-a_nb_n+1-b_n = lim_nrightarrow inftyfrac1(n+1)^3cdot frac1lnbigg(1+frac1nbigg) = 0$



Please explain if what I have done above is right.










share|cite|improve this question























  • I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
    – Kavi Rama Murthy
    Sep 10 at 8:51







  • 1




    You mean Stolz-Cesaro?
    – Kusma
    Sep 10 at 8:53






  • 1




    I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
    – Paramanand Singh
    Sep 10 at 13:26












up vote
4
down vote

favorite









up vote
4
down vote

favorite












Find the value of
$$lim_nrightarrow inftyfrac1+frac12+frac13+cdots +frac1n^3ln(n)$$




My Try: Using Stolz-Cesaro,



Let $displaystyle a_n = 1+frac12+frac13+cdots cdots +frac1n$
and $b_n = ln(n)$



So $displaystyle fraca_n+1-a_nb_n+1-b_n = lim_nrightarrow inftyfrac1(n+1)^3cdot frac1lnbigg(1+frac1nbigg) = 0$



Please explain if what I have done above is right.










share|cite|improve this question
















Find the value of
$$lim_nrightarrow inftyfrac1+frac12+frac13+cdots +frac1n^3ln(n)$$




My Try: Using Stolz-Cesaro,



Let $displaystyle a_n = 1+frac12+frac13+cdots cdots +frac1n$
and $b_n = ln(n)$



So $displaystyle fraca_n+1-a_nb_n+1-b_n = lim_nrightarrow inftyfrac1(n+1)^3cdot frac1lnbigg(1+frac1nbigg) = 0$



Please explain if what I have done above is right.







real-analysis sequences-and-series limits






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 17 hours ago









Gabriel Romon

17.6k53283




17.6k53283










asked Sep 10 at 8:43









Durgesh Tiwari

4,8152526




4,8152526











  • I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
    – Kavi Rama Murthy
    Sep 10 at 8:51







  • 1




    You mean Stolz-Cesaro?
    – Kusma
    Sep 10 at 8:53






  • 1




    I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
    – Paramanand Singh
    Sep 10 at 13:26
















  • I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
    – Kavi Rama Murthy
    Sep 10 at 8:51







  • 1




    You mean Stolz-Cesaro?
    – Kusma
    Sep 10 at 8:53






  • 1




    I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
    – Paramanand Singh
    Sep 10 at 13:26















I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
– Kavi Rama Murthy
Sep 10 at 8:51





I haven't heard of Cizero stolza but I would bound the numerator by $int_1^n frac 1 x^3 , dx =frac 1 2n^2$ to show that the limit is $0$.
– Kavi Rama Murthy
Sep 10 at 8:51





1




1




You mean Stolz-Cesaro?
– Kusma
Sep 10 at 8:53




You mean Stolz-Cesaro?
– Kusma
Sep 10 at 8:53




1




1




I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
– Paramanand Singh
Sep 10 at 13:26




I wonder why so many downvotes. There was a simple mistake in asker's application of Cesaro-Stolz, but he did show effort. +1 to compensate.
– Paramanand Singh
Sep 10 at 13:26










5 Answers
5






active

oldest

votes

















up vote
9
down vote



accepted










Let $H_n=sum_k=1^n frac 1k$. Since $H_n=log n +O(1)$, $$H_n^3 = 3log n +O(1)$$
thus$$fracH_n^3log n = 3+Oleft(frac1log n right)=3+o(1)$$



The limit is $3$.






share|cite|improve this answer



























    up vote
    6
    down vote













    Use of Cesaro-Stolz is tricky here. Let's first evaluate the limit of $a_n$ given by $$a_n=frac1log n sum_k=1^nfrac1k$$ Using Cesaro-Stolz we have $$lim_nto infty a_n=lim_ntoinfty frac1/nlog n-log(n-1)=-lim_nto infty frac1nlog(1-(1/n))=1$$ and then the sequence in question, say $b_n$, is given by $b_n=3a_n^3$ so $b_nto 3$ as $ntoinfty$.






    share|cite|improve this answer




















    • I like this creativity! (+1)
      – Shashi
      Sep 10 at 11:08










    • Great simplification!
      – gimusi
      Sep 10 at 12:15

















    up vote
    4
    down vote













    Your $a_n$ should go up to $frac1n^3$. Then $a_n+1-a_n=frac1(n+1)^3+frac1(n+1)^3-1dots+frac1n^3+2+frac1n^3+1$.



    I don't know whether you can arrive there by your method, but you can find the limit by using the asymptotics of harmonic numbers / definition of the euler $gamma$ constant. Then the limit should be $3$.






    share|cite|improve this answer





























      up vote
      3
      down vote













      Note that using Stolz-Cesaro we obtain



      $$fracsum_k=1^(n+1)^3frac1k-sum_k=1^n^3frac1kln(n+1)-ln nsimfracln(n+1)^3-log n^3ln(1+frac1n)=3fracln(1+frac1n)ln(1+frac1n)=3$$



      but, as already noted by Gabriel Romon, this is not necessary and it is sufficient use that by Harmonic series



      $$fracsum_k=1^n^3frac1kln nsimfracln n^3ln n=3$$






      share|cite|improve this answer
















      • 2




        A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
        – Paramanand Singh
        Sep 10 at 11:05

















      up vote
      0
      down vote













      To answer your question directly. The mistake is made in $a_n+1-a_n$. For example, if $n = 10$, then this is given by
      $$a_11-a_10 = 1/1331 + 1/1330 + cdots + 1/1001$$
      since $11^3 = 1331$ and $10^3=1000$.



      If you insert this, you still are going to need to do something similar as Gabriel suggested by viewing the summation as upper and lower Riemann sums.



      Edit2: if you now use Stolz Cesaro, which is possible, it works out as Gimusi did.






      share|cite|improve this answer






















      • Why cannot we apply CS?
        – gimusi
        Sep 10 at 10:04










      • I am sorry you're right. Made a mistake here.
        – Stan Tendijck
        Sep 10 at 10:14










      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%2f2911688%2ffinding-value-of-lim-n-rightarrow-infty-frac1-frac12-frac13-cd%23new-answer', 'question_page');

      );

      Post as a guest






























      5 Answers
      5






      active

      oldest

      votes








      5 Answers
      5






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      9
      down vote



      accepted










      Let $H_n=sum_k=1^n frac 1k$. Since $H_n=log n +O(1)$, $$H_n^3 = 3log n +O(1)$$
      thus$$fracH_n^3log n = 3+Oleft(frac1log n right)=3+o(1)$$



      The limit is $3$.






      share|cite|improve this answer
























        up vote
        9
        down vote



        accepted










        Let $H_n=sum_k=1^n frac 1k$. Since $H_n=log n +O(1)$, $$H_n^3 = 3log n +O(1)$$
        thus$$fracH_n^3log n = 3+Oleft(frac1log n right)=3+o(1)$$



        The limit is $3$.






        share|cite|improve this answer






















          up vote
          9
          down vote



          accepted







          up vote
          9
          down vote



          accepted






          Let $H_n=sum_k=1^n frac 1k$. Since $H_n=log n +O(1)$, $$H_n^3 = 3log n +O(1)$$
          thus$$fracH_n^3log n = 3+Oleft(frac1log n right)=3+o(1)$$



          The limit is $3$.






          share|cite|improve this answer












          Let $H_n=sum_k=1^n frac 1k$. Since $H_n=log n +O(1)$, $$H_n^3 = 3log n +O(1)$$
          thus$$fracH_n^3log n = 3+Oleft(frac1log n right)=3+o(1)$$



          The limit is $3$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Sep 10 at 9:01









          Gabriel Romon

          17.6k53283




          17.6k53283




















              up vote
              6
              down vote













              Use of Cesaro-Stolz is tricky here. Let's first evaluate the limit of $a_n$ given by $$a_n=frac1log n sum_k=1^nfrac1k$$ Using Cesaro-Stolz we have $$lim_nto infty a_n=lim_ntoinfty frac1/nlog n-log(n-1)=-lim_nto infty frac1nlog(1-(1/n))=1$$ and then the sequence in question, say $b_n$, is given by $b_n=3a_n^3$ so $b_nto 3$ as $ntoinfty$.






              share|cite|improve this answer




















              • I like this creativity! (+1)
                – Shashi
                Sep 10 at 11:08










              • Great simplification!
                – gimusi
                Sep 10 at 12:15














              up vote
              6
              down vote













              Use of Cesaro-Stolz is tricky here. Let's first evaluate the limit of $a_n$ given by $$a_n=frac1log n sum_k=1^nfrac1k$$ Using Cesaro-Stolz we have $$lim_nto infty a_n=lim_ntoinfty frac1/nlog n-log(n-1)=-lim_nto infty frac1nlog(1-(1/n))=1$$ and then the sequence in question, say $b_n$, is given by $b_n=3a_n^3$ so $b_nto 3$ as $ntoinfty$.






              share|cite|improve this answer




















              • I like this creativity! (+1)
                – Shashi
                Sep 10 at 11:08










              • Great simplification!
                – gimusi
                Sep 10 at 12:15












              up vote
              6
              down vote










              up vote
              6
              down vote









              Use of Cesaro-Stolz is tricky here. Let's first evaluate the limit of $a_n$ given by $$a_n=frac1log n sum_k=1^nfrac1k$$ Using Cesaro-Stolz we have $$lim_nto infty a_n=lim_ntoinfty frac1/nlog n-log(n-1)=-lim_nto infty frac1nlog(1-(1/n))=1$$ and then the sequence in question, say $b_n$, is given by $b_n=3a_n^3$ so $b_nto 3$ as $ntoinfty$.






              share|cite|improve this answer












              Use of Cesaro-Stolz is tricky here. Let's first evaluate the limit of $a_n$ given by $$a_n=frac1log n sum_k=1^nfrac1k$$ Using Cesaro-Stolz we have $$lim_nto infty a_n=lim_ntoinfty frac1/nlog n-log(n-1)=-lim_nto infty frac1nlog(1-(1/n))=1$$ and then the sequence in question, say $b_n$, is given by $b_n=3a_n^3$ so $b_nto 3$ as $ntoinfty$.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Sep 10 at 11:02









              Paramanand Singh

              45.8k554144




              45.8k554144











              • I like this creativity! (+1)
                – Shashi
                Sep 10 at 11:08










              • Great simplification!
                – gimusi
                Sep 10 at 12:15
















              • I like this creativity! (+1)
                – Shashi
                Sep 10 at 11:08










              • Great simplification!
                – gimusi
                Sep 10 at 12:15















              I like this creativity! (+1)
              – Shashi
              Sep 10 at 11:08




              I like this creativity! (+1)
              – Shashi
              Sep 10 at 11:08












              Great simplification!
              – gimusi
              Sep 10 at 12:15




              Great simplification!
              – gimusi
              Sep 10 at 12:15










              up vote
              4
              down vote













              Your $a_n$ should go up to $frac1n^3$. Then $a_n+1-a_n=frac1(n+1)^3+frac1(n+1)^3-1dots+frac1n^3+2+frac1n^3+1$.



              I don't know whether you can arrive there by your method, but you can find the limit by using the asymptotics of harmonic numbers / definition of the euler $gamma$ constant. Then the limit should be $3$.






              share|cite|improve this answer


























                up vote
                4
                down vote













                Your $a_n$ should go up to $frac1n^3$. Then $a_n+1-a_n=frac1(n+1)^3+frac1(n+1)^3-1dots+frac1n^3+2+frac1n^3+1$.



                I don't know whether you can arrive there by your method, but you can find the limit by using the asymptotics of harmonic numbers / definition of the euler $gamma$ constant. Then the limit should be $3$.






                share|cite|improve this answer
























                  up vote
                  4
                  down vote










                  up vote
                  4
                  down vote









                  Your $a_n$ should go up to $frac1n^3$. Then $a_n+1-a_n=frac1(n+1)^3+frac1(n+1)^3-1dots+frac1n^3+2+frac1n^3+1$.



                  I don't know whether you can arrive there by your method, but you can find the limit by using the asymptotics of harmonic numbers / definition of the euler $gamma$ constant. Then the limit should be $3$.






                  share|cite|improve this answer














                  Your $a_n$ should go up to $frac1n^3$. Then $a_n+1-a_n=frac1(n+1)^3+frac1(n+1)^3-1dots+frac1n^3+2+frac1n^3+1$.



                  I don't know whether you can arrive there by your method, but you can find the limit by using the asymptotics of harmonic numbers / definition of the euler $gamma$ constant. Then the limit should be $3$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Sep 10 at 10:46

























                  answered Sep 10 at 8:56









                  Kusma

                  3,440219




                  3,440219




















                      up vote
                      3
                      down vote













                      Note that using Stolz-Cesaro we obtain



                      $$fracsum_k=1^(n+1)^3frac1k-sum_k=1^n^3frac1kln(n+1)-ln nsimfracln(n+1)^3-log n^3ln(1+frac1n)=3fracln(1+frac1n)ln(1+frac1n)=3$$



                      but, as already noted by Gabriel Romon, this is not necessary and it is sufficient use that by Harmonic series



                      $$fracsum_k=1^n^3frac1kln nsimfracln n^3ln n=3$$






                      share|cite|improve this answer
















                      • 2




                        A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                        – Paramanand Singh
                        Sep 10 at 11:05














                      up vote
                      3
                      down vote













                      Note that using Stolz-Cesaro we obtain



                      $$fracsum_k=1^(n+1)^3frac1k-sum_k=1^n^3frac1kln(n+1)-ln nsimfracln(n+1)^3-log n^3ln(1+frac1n)=3fracln(1+frac1n)ln(1+frac1n)=3$$



                      but, as already noted by Gabriel Romon, this is not necessary and it is sufficient use that by Harmonic series



                      $$fracsum_k=1^n^3frac1kln nsimfracln n^3ln n=3$$






                      share|cite|improve this answer
















                      • 2




                        A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                        – Paramanand Singh
                        Sep 10 at 11:05












                      up vote
                      3
                      down vote










                      up vote
                      3
                      down vote









                      Note that using Stolz-Cesaro we obtain



                      $$fracsum_k=1^(n+1)^3frac1k-sum_k=1^n^3frac1kln(n+1)-ln nsimfracln(n+1)^3-log n^3ln(1+frac1n)=3fracln(1+frac1n)ln(1+frac1n)=3$$



                      but, as already noted by Gabriel Romon, this is not necessary and it is sufficient use that by Harmonic series



                      $$fracsum_k=1^n^3frac1kln nsimfracln n^3ln n=3$$






                      share|cite|improve this answer












                      Note that using Stolz-Cesaro we obtain



                      $$fracsum_k=1^(n+1)^3frac1k-sum_k=1^n^3frac1kln(n+1)-ln nsimfracln(n+1)^3-log n^3ln(1+frac1n)=3fracln(1+frac1n)ln(1+frac1n)=3$$



                      but, as already noted by Gabriel Romon, this is not necessary and it is sufficient use that by Harmonic series



                      $$fracsum_k=1^n^3frac1kln nsimfracln n^3ln n=3$$







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Sep 10 at 9:57









                      gimusi

                      74.5k73889




                      74.5k73889







                      • 2




                        A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                        – Paramanand Singh
                        Sep 10 at 11:05












                      • 2




                        A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                        – Paramanand Singh
                        Sep 10 at 11:05







                      2




                      2




                      A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                      – Paramanand Singh
                      Sep 10 at 11:05




                      A direct use of Cesaro-Stolz leads to complications. I have tried a slight variation using subsequences.
                      – Paramanand Singh
                      Sep 10 at 11:05










                      up vote
                      0
                      down vote













                      To answer your question directly. The mistake is made in $a_n+1-a_n$. For example, if $n = 10$, then this is given by
                      $$a_11-a_10 = 1/1331 + 1/1330 + cdots + 1/1001$$
                      since $11^3 = 1331$ and $10^3=1000$.



                      If you insert this, you still are going to need to do something similar as Gabriel suggested by viewing the summation as upper and lower Riemann sums.



                      Edit2: if you now use Stolz Cesaro, which is possible, it works out as Gimusi did.






                      share|cite|improve this answer






















                      • Why cannot we apply CS?
                        – gimusi
                        Sep 10 at 10:04










                      • I am sorry you're right. Made a mistake here.
                        – Stan Tendijck
                        Sep 10 at 10:14














                      up vote
                      0
                      down vote













                      To answer your question directly. The mistake is made in $a_n+1-a_n$. For example, if $n = 10$, then this is given by
                      $$a_11-a_10 = 1/1331 + 1/1330 + cdots + 1/1001$$
                      since $11^3 = 1331$ and $10^3=1000$.



                      If you insert this, you still are going to need to do something similar as Gabriel suggested by viewing the summation as upper and lower Riemann sums.



                      Edit2: if you now use Stolz Cesaro, which is possible, it works out as Gimusi did.






                      share|cite|improve this answer






















                      • Why cannot we apply CS?
                        – gimusi
                        Sep 10 at 10:04










                      • I am sorry you're right. Made a mistake here.
                        – Stan Tendijck
                        Sep 10 at 10:14












                      up vote
                      0
                      down vote










                      up vote
                      0
                      down vote









                      To answer your question directly. The mistake is made in $a_n+1-a_n$. For example, if $n = 10$, then this is given by
                      $$a_11-a_10 = 1/1331 + 1/1330 + cdots + 1/1001$$
                      since $11^3 = 1331$ and $10^3=1000$.



                      If you insert this, you still are going to need to do something similar as Gabriel suggested by viewing the summation as upper and lower Riemann sums.



                      Edit2: if you now use Stolz Cesaro, which is possible, it works out as Gimusi did.






                      share|cite|improve this answer














                      To answer your question directly. The mistake is made in $a_n+1-a_n$. For example, if $n = 10$, then this is given by
                      $$a_11-a_10 = 1/1331 + 1/1330 + cdots + 1/1001$$
                      since $11^3 = 1331$ and $10^3=1000$.



                      If you insert this, you still are going to need to do something similar as Gabriel suggested by viewing the summation as upper and lower Riemann sums.



                      Edit2: if you now use Stolz Cesaro, which is possible, it works out as Gimusi did.







                      share|cite|improve this answer














                      share|cite|improve this answer



                      share|cite|improve this answer








                      edited Sep 10 at 10:15

























                      answered Sep 10 at 9:09









                      Stan Tendijck

                      1,321110




                      1,321110











                      • Why cannot we apply CS?
                        – gimusi
                        Sep 10 at 10:04










                      • I am sorry you're right. Made a mistake here.
                        – Stan Tendijck
                        Sep 10 at 10:14
















                      • Why cannot we apply CS?
                        – gimusi
                        Sep 10 at 10:04










                      • I am sorry you're right. Made a mistake here.
                        – Stan Tendijck
                        Sep 10 at 10:14















                      Why cannot we apply CS?
                      – gimusi
                      Sep 10 at 10:04




                      Why cannot we apply CS?
                      – gimusi
                      Sep 10 at 10:04












                      I am sorry you're right. Made a mistake here.
                      – Stan Tendijck
                      Sep 10 at 10:14




                      I am sorry you're right. Made a mistake here.
                      – Stan Tendijck
                      Sep 10 at 10:14

















                       

                      draft saved


                      draft discarded















































                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2911688%2ffinding-value-of-lim-n-rightarrow-infty-frac1-frac12-frac13-cd%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      rNb1iqC4,krT,Ph,kqcoCfDzGO8kbQXxoTUFM28erd 8XNG,MgweHKICxvuJlOU9CfqEkv6w,4k,t zoMtTjKYE,gS ydbgcmP
                      CNqYbv9,sHD G2ZLaa4lH,3rLKuEG53aKi,yfoXk1xjh,T mFHvn3tDDjRCinOG TGY,aMFl1mUGfern0j

                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Propositional logic and tautologies

                      Distribution of Stopped Wiener Process with Stochastic Volatility