Converting summation ( how do I get from $k cdot sum_{j=k}^{2k} frac{1}{j-k+1}$ to $ k cdot sum_{j=1}^{k+1}...












1












$begingroup$


I am trying to figure out the steps between these two equal expressions.



$$ k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{j=1}^{k+1} frac{1}{j} $$



I get that $2k -k +1 = k+1$, but why does $j=k$ change to $j=1$?










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Because $k-k+1=1$ by using the same exact argument as for $2k$
    $endgroup$
    – b00n heT
    Dec 17 '18 at 21:33








  • 1




    $begingroup$
    And the $k$ in front of the sum is irrelevant. You might as well divide that out...
    $endgroup$
    – Mason
    Dec 17 '18 at 21:35
















1












$begingroup$


I am trying to figure out the steps between these two equal expressions.



$$ k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{j=1}^{k+1} frac{1}{j} $$



I get that $2k -k +1 = k+1$, but why does $j=k$ change to $j=1$?










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Because $k-k+1=1$ by using the same exact argument as for $2k$
    $endgroup$
    – b00n heT
    Dec 17 '18 at 21:33








  • 1




    $begingroup$
    And the $k$ in front of the sum is irrelevant. You might as well divide that out...
    $endgroup$
    – Mason
    Dec 17 '18 at 21:35














1












1








1





$begingroup$


I am trying to figure out the steps between these two equal expressions.



$$ k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{j=1}^{k+1} frac{1}{j} $$



I get that $2k -k +1 = k+1$, but why does $j=k$ change to $j=1$?










share|cite|improve this question











$endgroup$




I am trying to figure out the steps between these two equal expressions.



$$ k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{j=1}^{k+1} frac{1}{j} $$



I get that $2k -k +1 = k+1$, but why does $j=k$ change to $j=1$?







discrete-mathematics summation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 17 '18 at 21:36









Martin Argerami

128k1184184




128k1184184










asked Dec 17 '18 at 21:26









LuckyLucky

1177




1177








  • 1




    $begingroup$
    Because $k-k+1=1$ by using the same exact argument as for $2k$
    $endgroup$
    – b00n heT
    Dec 17 '18 at 21:33








  • 1




    $begingroup$
    And the $k$ in front of the sum is irrelevant. You might as well divide that out...
    $endgroup$
    – Mason
    Dec 17 '18 at 21:35














  • 1




    $begingroup$
    Because $k-k+1=1$ by using the same exact argument as for $2k$
    $endgroup$
    – b00n heT
    Dec 17 '18 at 21:33








  • 1




    $begingroup$
    And the $k$ in front of the sum is irrelevant. You might as well divide that out...
    $endgroup$
    – Mason
    Dec 17 '18 at 21:35








1




1




$begingroup$
Because $k-k+1=1$ by using the same exact argument as for $2k$
$endgroup$
– b00n heT
Dec 17 '18 at 21:33






$begingroup$
Because $k-k+1=1$ by using the same exact argument as for $2k$
$endgroup$
– b00n heT
Dec 17 '18 at 21:33






1




1




$begingroup$
And the $k$ in front of the sum is irrelevant. You might as well divide that out...
$endgroup$
– Mason
Dec 17 '18 at 21:35




$begingroup$
And the $k$ in front of the sum is irrelevant. You might as well divide that out...
$endgroup$
– Mason
Dec 17 '18 at 21:35










1 Answer
1






active

oldest

votes


















2












$begingroup$

Note that for





  • $j$ varing from $k$ up to $2k$


we have that





  • $j-k+1$ varies linearly from $1$ to $k+1$


therefore the two sums are equivalent.



If you find confusing using the same $j$ for both sums, let use another index for the second sum, that is for example



$$r=j-k+1 implies k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{r=1}^{k+1} frac{1}{r}$$






share|cite|improve this answer











$endgroup$













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


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044461%2fconverting-summation-how-do-i-get-from-k-cdot-sum-j-k2k-frac1j-k1%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









    2












    $begingroup$

    Note that for





    • $j$ varing from $k$ up to $2k$


    we have that





    • $j-k+1$ varies linearly from $1$ to $k+1$


    therefore the two sums are equivalent.



    If you find confusing using the same $j$ for both sums, let use another index for the second sum, that is for example



    $$r=j-k+1 implies k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{r=1}^{k+1} frac{1}{r}$$






    share|cite|improve this answer











    $endgroup$


















      2












      $begingroup$

      Note that for





      • $j$ varing from $k$ up to $2k$


      we have that





      • $j-k+1$ varies linearly from $1$ to $k+1$


      therefore the two sums are equivalent.



      If you find confusing using the same $j$ for both sums, let use another index for the second sum, that is for example



      $$r=j-k+1 implies k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{r=1}^{k+1} frac{1}{r}$$






      share|cite|improve this answer











      $endgroup$
















        2












        2








        2





        $begingroup$

        Note that for





        • $j$ varing from $k$ up to $2k$


        we have that





        • $j-k+1$ varies linearly from $1$ to $k+1$


        therefore the two sums are equivalent.



        If you find confusing using the same $j$ for both sums, let use another index for the second sum, that is for example



        $$r=j-k+1 implies k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{r=1}^{k+1} frac{1}{r}$$






        share|cite|improve this answer











        $endgroup$



        Note that for





        • $j$ varing from $k$ up to $2k$


        we have that





        • $j-k+1$ varies linearly from $1$ to $k+1$


        therefore the two sums are equivalent.



        If you find confusing using the same $j$ for both sums, let use another index for the second sum, that is for example



        $$r=j-k+1 implies k cdot sum_{j=k}^{2k} frac{1}{j-k+1} = k cdot sum_{r=1}^{k+1} frac{1}{r}$$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 17 '18 at 21:34

























        answered Dec 17 '18 at 21:29









        gimusigimusi

        93k84594




        93k84594






























            draft saved

            draft discarded




















































            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3044461%2fconverting-summation-how-do-i-get-from-k-cdot-sum-j-k2k-frac1j-k1%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

            Plaza Victoria

            In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

            How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...