Summation equality with finite differences - prove with induction Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Similar to Macmahon's theorem, why does $sum t^textmaj(w)=sum t^textinv(w)$?Prove derivative with summation by inductionProving a summation inequality with inductionSummation with combinationsProof by induction (summation formula)How to prove $sum_k=1^n(2k)^2 = frac2n(n+1)(2n+1)3$ using mathematical induction?Prove that $sumfrac(k_1+k_2+dots+k_n)!k_1!k_2!dots k_n! = 2^n-1$, where the sum is over every nonnegative $(k_i)$ such that $sum ik_i=n$Proof of $sum_k=1^n binomnk binomnn+1-k = binom2nn+1$ via inductionProving the Multinomial Theorem--Collapsing Double Sum (Multiple Summation Step)Prove by induction $(n+1) + (n + 2) +dots + (2n - 1 ) + (2n) = fracn(3n + 1)2$, $n geq 1$

Test print coming out spongy

How can I prevent/balance waiting and turtling as a response to cooldown mechanics

Special flights

Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?

A proverb that is used to imply that you have unexpectedly faced a big problem

How can I save and copy a screenhot at the same time?

Found this skink in my tomato plant bucket. Is he trapped? Or could he leave if he wanted?

How many time has Arya actually used Needle?

Where is the Next Backup Size entry on iOS 12?

Monty Hall Problem-Probability Paradox

Sally's older brother

Why shouldn't this prove the Prime Number Theorem?

what is the log of the PDF for a Normal Distribution?

Why are vacuum tubes still used in amateur radios?

A term for a woman complaining about things/begging in a cute/childish way

Printing attributes of selection in ArcPy?

As a dual citizen, my US passport will expire one day after traveling to the US. Will this work?

Did pre-Columbian Americans know the spherical shape of the Earth?

After Sam didn't return home in the end, were he and Al still friends?

Relating to the President and obstruction, were Mueller's conclusions preordained?

The Nth Gryphon Number

Random body shuffle every night—can we still function?

Why complex landing gears are used instead of simple,reliability and light weight muscle wire or shape memory alloys?

Is there hard evidence that the grant peer review system performs significantly better than random?



Summation equality with finite differences - prove with induction



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Similar to Macmahon's theorem, why does $sum t^textmaj(w)=sum t^textinv(w)$?Prove derivative with summation by inductionProving a summation inequality with inductionSummation with combinationsProof by induction (summation formula)How to prove $sum_k=1^n(2k)^2 = frac2n(n+1)(2n+1)3$ using mathematical induction?Prove that $sumfrac(k_1+k_2+dots+k_n)!k_1!k_2!dots k_n! = 2^n-1$, where the sum is over every nonnegative $(k_i)$ such that $sum ik_i=n$Proof of $sum_k=1^n binomnk binomnn+1-k = binom2nn+1$ via inductionProving the Multinomial Theorem--Collapsing Double Sum (Multiple Summation Step)Prove by induction $(n+1) + (n + 2) +dots + (2n - 1 ) + (2n) = fracn(3n + 1)2$, $n geq 1$










2












$begingroup$


$f : mathbb R^n to mathbb R, x,h in mathbb R^n$ and $m in mathbb N$, $m geq 1$.



We wish to prove that $$Delta_mh^r(f,x) = sum_k_1 = 0^m-1dotssum_k_r = 0^m-1Delta_h^r(f, x+k_1h+dots + k_rh)$$



Where $Delta_h^r (f,x):= sum_k = 0^r(-1)^r+kbinomrkf(x+kh)$



We know this to be true when $r=1$, we wish to prove this with induction for all $r in mathbb N$.



I've tried the natural thing to do but i got stuck, is there some trick here that I don't see?










share|cite|improve this question









$endgroup$











  • $begingroup$
    I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
    $endgroup$
    – Mike Earnest
    Apr 6 at 20:57















2












$begingroup$


$f : mathbb R^n to mathbb R, x,h in mathbb R^n$ and $m in mathbb N$, $m geq 1$.



We wish to prove that $$Delta_mh^r(f,x) = sum_k_1 = 0^m-1dotssum_k_r = 0^m-1Delta_h^r(f, x+k_1h+dots + k_rh)$$



Where $Delta_h^r (f,x):= sum_k = 0^r(-1)^r+kbinomrkf(x+kh)$



We know this to be true when $r=1$, we wish to prove this with induction for all $r in mathbb N$.



I've tried the natural thing to do but i got stuck, is there some trick here that I don't see?










share|cite|improve this question









$endgroup$











  • $begingroup$
    I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
    $endgroup$
    – Mike Earnest
    Apr 6 at 20:57













2












2








2


1



$begingroup$


$f : mathbb R^n to mathbb R, x,h in mathbb R^n$ and $m in mathbb N$, $m geq 1$.



We wish to prove that $$Delta_mh^r(f,x) = sum_k_1 = 0^m-1dotssum_k_r = 0^m-1Delta_h^r(f, x+k_1h+dots + k_rh)$$



Where $Delta_h^r (f,x):= sum_k = 0^r(-1)^r+kbinomrkf(x+kh)$



We know this to be true when $r=1$, we wish to prove this with induction for all $r in mathbb N$.



I've tried the natural thing to do but i got stuck, is there some trick here that I don't see?










share|cite|improve this question









$endgroup$




$f : mathbb R^n to mathbb R, x,h in mathbb R^n$ and $m in mathbb N$, $m geq 1$.



We wish to prove that $$Delta_mh^r(f,x) = sum_k_1 = 0^m-1dotssum_k_r = 0^m-1Delta_h^r(f, x+k_1h+dots + k_rh)$$



Where $Delta_h^r (f,x):= sum_k = 0^r(-1)^r+kbinomrkf(x+kh)$



We know this to be true when $r=1$, we wish to prove this with induction for all $r in mathbb N$.



I've tried the natural thing to do but i got stuck, is there some trick here that I don't see?







combinatorics summation






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Apr 2 at 9:59









Rick JokerRick Joker

285214




285214











  • $begingroup$
    I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
    $endgroup$
    – Mike Earnest
    Apr 6 at 20:57
















  • $begingroup$
    I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
    $endgroup$
    – Mike Earnest
    Apr 6 at 20:57















$begingroup$
I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
$endgroup$
– Mike Earnest
Apr 6 at 20:57




$begingroup$
I am not sure if this was the intended solution method, or how to do this without operator arithmetic...
$endgroup$
– Mike Earnest
Apr 6 at 20:57










1 Answer
1






active

oldest

votes


















3





+100







$begingroup$

Everything becomes easy with the right notation and perspective.



Let $L_h$ be the shift operator. Given a function $f:mathbb R^nto mathbb R$, this means $L_hf$ is a new function $mathbb R^nto mathbb R$, given by $(L_hf)(x)=f(x+h)$. This is related to $Delta$ by
$$
Delta^1_h(f,x) = f(x+h)-f(x)=(L_hf)(x)-f(x)
$$

Since we have equality for all inputs $x$, we have an equality of functions:
$$
Delta^1_h f = L_hf - f=(L_h-1)f
$$

Furthermore, since holds for all functions $f$, this is an equality of operators:
$$
Delta^1_h = L_h-1
$$

Here, $1$ is the identity operator, and the sum of operators is defined function-wise. Now, given any operator $G,$ let $G^n = Gcirc Gcirc dots circ G$ denote the composition of $G$ with itself $n$ times. Since operator arithmetic obeys all the usual laws, and composing two shift operators gives a different shift operator via $L_h_1+h_2=L_h_1circ L_h_2$, we have
beginalign*
(Delta^1_h)^r
&= (L_h-1)^r\
&= sum_k=0^r binomrkL_h^k(-1)^r-k\
&= sum_k=0^r binomrkL_hk^(-1)^r-k\
&= Delta_h^r
endalign*

This shows that $Delta^r_h$ is the $r$-fold composition of $Delta^1_h$ with itself, a good choice of notation!



Now, you already know that $Delta_mh^1(f,x)=sum_k=0^m-1 Delta_h^1(f,x+kh)$, as this is a telescoping sum. We can write this as an equality of operators:
$$
Delta_mh^1=sum_k=0^m-1 Delta^1_hcirc L_kh
$$

Now, take taking the $r$-fold composition of both sides, we get
beginalign*
Delta_mh^r
&=left(sum_k=0^m-1 Delta^1_hcirc L_khright)^r
\&=sum_k_1=0^m-1sum_k_2=0^m-1dots sum_k_r=0^m-1 Delta^1_hcirc L_k_1hcirc Delta^1_hcirc L_k_2hcirc dots circ Delta^1_hcirc L_k_rh
endalign*



Finally, since $Delta_h^1=L_h-1$, it is easy to show that $Delta^1_h circ L_kh=L_khcirc Delta^1_h$, i.e. that $Delta^1_h$ commutes with all powers of $L_h$ (recall that $L_h^k=L_kh$). Therefore, we can rearrange this to
beginalign
Delta_mh^r
&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
Delta_h^1circDelta^1_hcircdots Delta^1_hcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
\&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
Delta_h^rcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
endalign

This equality of operators is exactly what you are trying to prove.






share|cite|improve this answer











$endgroup$













    Your Answer








    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%2f3171677%2fsummation-equality-with-finite-differences-prove-with-induction%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









    3





    +100







    $begingroup$

    Everything becomes easy with the right notation and perspective.



    Let $L_h$ be the shift operator. Given a function $f:mathbb R^nto mathbb R$, this means $L_hf$ is a new function $mathbb R^nto mathbb R$, given by $(L_hf)(x)=f(x+h)$. This is related to $Delta$ by
    $$
    Delta^1_h(f,x) = f(x+h)-f(x)=(L_hf)(x)-f(x)
    $$

    Since we have equality for all inputs $x$, we have an equality of functions:
    $$
    Delta^1_h f = L_hf - f=(L_h-1)f
    $$

    Furthermore, since holds for all functions $f$, this is an equality of operators:
    $$
    Delta^1_h = L_h-1
    $$

    Here, $1$ is the identity operator, and the sum of operators is defined function-wise. Now, given any operator $G,$ let $G^n = Gcirc Gcirc dots circ G$ denote the composition of $G$ with itself $n$ times. Since operator arithmetic obeys all the usual laws, and composing two shift operators gives a different shift operator via $L_h_1+h_2=L_h_1circ L_h_2$, we have
    beginalign*
    (Delta^1_h)^r
    &= (L_h-1)^r\
    &= sum_k=0^r binomrkL_h^k(-1)^r-k\
    &= sum_k=0^r binomrkL_hk^(-1)^r-k\
    &= Delta_h^r
    endalign*

    This shows that $Delta^r_h$ is the $r$-fold composition of $Delta^1_h$ with itself, a good choice of notation!



    Now, you already know that $Delta_mh^1(f,x)=sum_k=0^m-1 Delta_h^1(f,x+kh)$, as this is a telescoping sum. We can write this as an equality of operators:
    $$
    Delta_mh^1=sum_k=0^m-1 Delta^1_hcirc L_kh
    $$

    Now, take taking the $r$-fold composition of both sides, we get
    beginalign*
    Delta_mh^r
    &=left(sum_k=0^m-1 Delta^1_hcirc L_khright)^r
    \&=sum_k_1=0^m-1sum_k_2=0^m-1dots sum_k_r=0^m-1 Delta^1_hcirc L_k_1hcirc Delta^1_hcirc L_k_2hcirc dots circ Delta^1_hcirc L_k_rh
    endalign*



    Finally, since $Delta_h^1=L_h-1$, it is easy to show that $Delta^1_h circ L_kh=L_khcirc Delta^1_h$, i.e. that $Delta^1_h$ commutes with all powers of $L_h$ (recall that $L_h^k=L_kh$). Therefore, we can rearrange this to
    beginalign
    Delta_mh^r
    &=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
    Delta_h^1circDelta^1_hcircdots Delta^1_hcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
    \&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
    Delta_h^rcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
    endalign

    This equality of operators is exactly what you are trying to prove.






    share|cite|improve this answer











    $endgroup$

















      3





      +100







      $begingroup$

      Everything becomes easy with the right notation and perspective.



      Let $L_h$ be the shift operator. Given a function $f:mathbb R^nto mathbb R$, this means $L_hf$ is a new function $mathbb R^nto mathbb R$, given by $(L_hf)(x)=f(x+h)$. This is related to $Delta$ by
      $$
      Delta^1_h(f,x) = f(x+h)-f(x)=(L_hf)(x)-f(x)
      $$

      Since we have equality for all inputs $x$, we have an equality of functions:
      $$
      Delta^1_h f = L_hf - f=(L_h-1)f
      $$

      Furthermore, since holds for all functions $f$, this is an equality of operators:
      $$
      Delta^1_h = L_h-1
      $$

      Here, $1$ is the identity operator, and the sum of operators is defined function-wise. Now, given any operator $G,$ let $G^n = Gcirc Gcirc dots circ G$ denote the composition of $G$ with itself $n$ times. Since operator arithmetic obeys all the usual laws, and composing two shift operators gives a different shift operator via $L_h_1+h_2=L_h_1circ L_h_2$, we have
      beginalign*
      (Delta^1_h)^r
      &= (L_h-1)^r\
      &= sum_k=0^r binomrkL_h^k(-1)^r-k\
      &= sum_k=0^r binomrkL_hk^(-1)^r-k\
      &= Delta_h^r
      endalign*

      This shows that $Delta^r_h$ is the $r$-fold composition of $Delta^1_h$ with itself, a good choice of notation!



      Now, you already know that $Delta_mh^1(f,x)=sum_k=0^m-1 Delta_h^1(f,x+kh)$, as this is a telescoping sum. We can write this as an equality of operators:
      $$
      Delta_mh^1=sum_k=0^m-1 Delta^1_hcirc L_kh
      $$

      Now, take taking the $r$-fold composition of both sides, we get
      beginalign*
      Delta_mh^r
      &=left(sum_k=0^m-1 Delta^1_hcirc L_khright)^r
      \&=sum_k_1=0^m-1sum_k_2=0^m-1dots sum_k_r=0^m-1 Delta^1_hcirc L_k_1hcirc Delta^1_hcirc L_k_2hcirc dots circ Delta^1_hcirc L_k_rh
      endalign*



      Finally, since $Delta_h^1=L_h-1$, it is easy to show that $Delta^1_h circ L_kh=L_khcirc Delta^1_h$, i.e. that $Delta^1_h$ commutes with all powers of $L_h$ (recall that $L_h^k=L_kh$). Therefore, we can rearrange this to
      beginalign
      Delta_mh^r
      &=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
      Delta_h^1circDelta^1_hcircdots Delta^1_hcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
      \&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
      Delta_h^rcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
      endalign

      This equality of operators is exactly what you are trying to prove.






      share|cite|improve this answer











      $endgroup$















        3





        +100







        3





        +100



        3




        +100



        $begingroup$

        Everything becomes easy with the right notation and perspective.



        Let $L_h$ be the shift operator. Given a function $f:mathbb R^nto mathbb R$, this means $L_hf$ is a new function $mathbb R^nto mathbb R$, given by $(L_hf)(x)=f(x+h)$. This is related to $Delta$ by
        $$
        Delta^1_h(f,x) = f(x+h)-f(x)=(L_hf)(x)-f(x)
        $$

        Since we have equality for all inputs $x$, we have an equality of functions:
        $$
        Delta^1_h f = L_hf - f=(L_h-1)f
        $$

        Furthermore, since holds for all functions $f$, this is an equality of operators:
        $$
        Delta^1_h = L_h-1
        $$

        Here, $1$ is the identity operator, and the sum of operators is defined function-wise. Now, given any operator $G,$ let $G^n = Gcirc Gcirc dots circ G$ denote the composition of $G$ with itself $n$ times. Since operator arithmetic obeys all the usual laws, and composing two shift operators gives a different shift operator via $L_h_1+h_2=L_h_1circ L_h_2$, we have
        beginalign*
        (Delta^1_h)^r
        &= (L_h-1)^r\
        &= sum_k=0^r binomrkL_h^k(-1)^r-k\
        &= sum_k=0^r binomrkL_hk^(-1)^r-k\
        &= Delta_h^r
        endalign*

        This shows that $Delta^r_h$ is the $r$-fold composition of $Delta^1_h$ with itself, a good choice of notation!



        Now, you already know that $Delta_mh^1(f,x)=sum_k=0^m-1 Delta_h^1(f,x+kh)$, as this is a telescoping sum. We can write this as an equality of operators:
        $$
        Delta_mh^1=sum_k=0^m-1 Delta^1_hcirc L_kh
        $$

        Now, take taking the $r$-fold composition of both sides, we get
        beginalign*
        Delta_mh^r
        &=left(sum_k=0^m-1 Delta^1_hcirc L_khright)^r
        \&=sum_k_1=0^m-1sum_k_2=0^m-1dots sum_k_r=0^m-1 Delta^1_hcirc L_k_1hcirc Delta^1_hcirc L_k_2hcirc dots circ Delta^1_hcirc L_k_rh
        endalign*



        Finally, since $Delta_h^1=L_h-1$, it is easy to show that $Delta^1_h circ L_kh=L_khcirc Delta^1_h$, i.e. that $Delta^1_h$ commutes with all powers of $L_h$ (recall that $L_h^k=L_kh$). Therefore, we can rearrange this to
        beginalign
        Delta_mh^r
        &=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
        Delta_h^1circDelta^1_hcircdots Delta^1_hcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
        \&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
        Delta_h^rcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
        endalign

        This equality of operators is exactly what you are trying to prove.






        share|cite|improve this answer











        $endgroup$



        Everything becomes easy with the right notation and perspective.



        Let $L_h$ be the shift operator. Given a function $f:mathbb R^nto mathbb R$, this means $L_hf$ is a new function $mathbb R^nto mathbb R$, given by $(L_hf)(x)=f(x+h)$. This is related to $Delta$ by
        $$
        Delta^1_h(f,x) = f(x+h)-f(x)=(L_hf)(x)-f(x)
        $$

        Since we have equality for all inputs $x$, we have an equality of functions:
        $$
        Delta^1_h f = L_hf - f=(L_h-1)f
        $$

        Furthermore, since holds for all functions $f$, this is an equality of operators:
        $$
        Delta^1_h = L_h-1
        $$

        Here, $1$ is the identity operator, and the sum of operators is defined function-wise. Now, given any operator $G,$ let $G^n = Gcirc Gcirc dots circ G$ denote the composition of $G$ with itself $n$ times. Since operator arithmetic obeys all the usual laws, and composing two shift operators gives a different shift operator via $L_h_1+h_2=L_h_1circ L_h_2$, we have
        beginalign*
        (Delta^1_h)^r
        &= (L_h-1)^r\
        &= sum_k=0^r binomrkL_h^k(-1)^r-k\
        &= sum_k=0^r binomrkL_hk^(-1)^r-k\
        &= Delta_h^r
        endalign*

        This shows that $Delta^r_h$ is the $r$-fold composition of $Delta^1_h$ with itself, a good choice of notation!



        Now, you already know that $Delta_mh^1(f,x)=sum_k=0^m-1 Delta_h^1(f,x+kh)$, as this is a telescoping sum. We can write this as an equality of operators:
        $$
        Delta_mh^1=sum_k=0^m-1 Delta^1_hcirc L_kh
        $$

        Now, take taking the $r$-fold composition of both sides, we get
        beginalign*
        Delta_mh^r
        &=left(sum_k=0^m-1 Delta^1_hcirc L_khright)^r
        \&=sum_k_1=0^m-1sum_k_2=0^m-1dots sum_k_r=0^m-1 Delta^1_hcirc L_k_1hcirc Delta^1_hcirc L_k_2hcirc dots circ Delta^1_hcirc L_k_rh
        endalign*



        Finally, since $Delta_h^1=L_h-1$, it is easy to show that $Delta^1_h circ L_kh=L_khcirc Delta^1_h$, i.e. that $Delta^1_h$ commutes with all powers of $L_h$ (recall that $L_h^k=L_kh$). Therefore, we can rearrange this to
        beginalign
        Delta_mh^r
        &=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
        Delta_h^1circDelta^1_hcircdots Delta^1_hcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
        \&=sum_k_1=0^m-1sum_k_2=0^m-1dotssum_k_r=0^m-1
        Delta_h^rcirc L_k_1hcirc L_k_2 hcirc dots L_k_rh
        endalign

        This equality of operators is exactly what you are trying to prove.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Apr 5 at 23:52

























        answered Apr 5 at 20:03









        Mike EarnestMike Earnest

        28.2k22152




        28.2k22152



























            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%2f3171677%2fsummation-equality-with-finite-differences-prove-with-induction%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ