Why is $binomn2 = sum_i=0^n i = fracn(n+1)2$? [duplicate]

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











up vote
-1
down vote

favorite
1













This question already has an answer here:



  • Is $sum_i=1^n-1i=binomn2$?

    6 answers



  • Why does $binomn2 = fracn^2 - n 2$?

    2 answers



  • Show that for $N ge 2$, $sum_n=1^N-1 n= N choose 2$

    4 answers



  • Is it correct to evaluate combinations of two as sum?

    3 answers



I can see this easily by definition. But will it have combinatorial meaning of $binomn2 = sum_k=1 ^n-1 (k)?$







share|cite|improve this question













marked as duplicate by amWhy, Shailesh, José Carlos Santos, Batominovski, N. F. Taussig combinatorics
Users with the  combinatorics badge can single-handedly close combinatorics questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Aug 7 at 15:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.










  • 1




    Please edit this post.
    – lulu
    Aug 7 at 14:39






  • 1




    PLease see math.meta.stackexchange.com/questions/5020
    – Lord Shark the Unknown
    Aug 7 at 14:40










  • @Jneven yes it is i dont know why in combinatorial way
    – SG tjdqls0599
    Aug 7 at 14:48










  • i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
    – Jneven
    Aug 7 at 14:50






  • 3




    But $binomn2neqfracn(n+1)2$.
    – Batominovski
    Aug 7 at 14:52














up vote
-1
down vote

favorite
1













This question already has an answer here:



  • Is $sum_i=1^n-1i=binomn2$?

    6 answers



  • Why does $binomn2 = fracn^2 - n 2$?

    2 answers



  • Show that for $N ge 2$, $sum_n=1^N-1 n= N choose 2$

    4 answers



  • Is it correct to evaluate combinations of two as sum?

    3 answers



I can see this easily by definition. But will it have combinatorial meaning of $binomn2 = sum_k=1 ^n-1 (k)?$







share|cite|improve this question













marked as duplicate by amWhy, Shailesh, José Carlos Santos, Batominovski, N. F. Taussig combinatorics
Users with the  combinatorics badge can single-handedly close combinatorics questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Aug 7 at 15:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.










  • 1




    Please edit this post.
    – lulu
    Aug 7 at 14:39






  • 1




    PLease see math.meta.stackexchange.com/questions/5020
    – Lord Shark the Unknown
    Aug 7 at 14:40










  • @Jneven yes it is i dont know why in combinatorial way
    – SG tjdqls0599
    Aug 7 at 14:48










  • i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
    – Jneven
    Aug 7 at 14:50






  • 3




    But $binomn2neqfracn(n+1)2$.
    – Batominovski
    Aug 7 at 14:52












up vote
-1
down vote

favorite
1









up vote
-1
down vote

favorite
1






1






This question already has an answer here:



  • Is $sum_i=1^n-1i=binomn2$?

    6 answers



  • Why does $binomn2 = fracn^2 - n 2$?

    2 answers



  • Show that for $N ge 2$, $sum_n=1^N-1 n= N choose 2$

    4 answers



  • Is it correct to evaluate combinations of two as sum?

    3 answers



I can see this easily by definition. But will it have combinatorial meaning of $binomn2 = sum_k=1 ^n-1 (k)?$







share|cite|improve this question














This question already has an answer here:



  • Is $sum_i=1^n-1i=binomn2$?

    6 answers



  • Why does $binomn2 = fracn^2 - n 2$?

    2 answers



  • Show that for $N ge 2$, $sum_n=1^N-1 n= N choose 2$

    4 answers



  • Is it correct to evaluate combinations of two as sum?

    3 answers



I can see this easily by definition. But will it have combinatorial meaning of $binomn2 = sum_k=1 ^n-1 (k)?$





This question already has an answer here:



  • Is $sum_i=1^n-1i=binomn2$?

    6 answers



  • Why does $binomn2 = fracn^2 - n 2$?

    2 answers



  • Show that for $N ge 2$, $sum_n=1^N-1 n= N choose 2$

    4 answers



  • Is it correct to evaluate combinations of two as sum?

    3 answers









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Aug 7 at 15:25









Jneven

545219




545219









asked Aug 7 at 14:36









SG tjdqls0599

296




296




marked as duplicate by amWhy, Shailesh, José Carlos Santos, Batominovski, N. F. Taussig combinatorics
Users with the  combinatorics badge can single-handedly close combinatorics questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Aug 7 at 15:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.






marked as duplicate by amWhy, Shailesh, José Carlos Santos, Batominovski, N. F. Taussig combinatorics
Users with the  combinatorics badge can single-handedly close combinatorics questions as duplicates and reopen them as needed.

StackExchange.ready(function()
if (StackExchange.options.isMobile) return;

$('.dupe-hammer-message-hover:not(.hover-bound)').each(function()
var $hover = $(this).addClass('hover-bound'),
$msg = $hover.siblings('.dupe-hammer-message');

$hover.hover(
function()
$hover.showInfoMessage('',
messageElement: $msg.clone().show(),
transient: false,
position: my: 'bottom left', at: 'top center', offsetTop: -7 ,
dismissable: false,
relativeToBody: true
);
,
function()
StackExchange.helpers.removeMessages();

);
);
);
Aug 7 at 15:11


This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.









  • 1




    Please edit this post.
    – lulu
    Aug 7 at 14:39






  • 1




    PLease see math.meta.stackexchange.com/questions/5020
    – Lord Shark the Unknown
    Aug 7 at 14:40










  • @Jneven yes it is i dont know why in combinatorial way
    – SG tjdqls0599
    Aug 7 at 14:48










  • i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
    – Jneven
    Aug 7 at 14:50






  • 3




    But $binomn2neqfracn(n+1)2$.
    – Batominovski
    Aug 7 at 14:52












  • 1




    Please edit this post.
    – lulu
    Aug 7 at 14:39






  • 1




    PLease see math.meta.stackexchange.com/questions/5020
    – Lord Shark the Unknown
    Aug 7 at 14:40










  • @Jneven yes it is i dont know why in combinatorial way
    – SG tjdqls0599
    Aug 7 at 14:48










  • i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
    – Jneven
    Aug 7 at 14:50






  • 3




    But $binomn2neqfracn(n+1)2$.
    – Batominovski
    Aug 7 at 14:52







1




1




Please edit this post.
– lulu
Aug 7 at 14:39




Please edit this post.
– lulu
Aug 7 at 14:39




1




1




PLease see math.meta.stackexchange.com/questions/5020
– Lord Shark the Unknown
Aug 7 at 14:40




PLease see math.meta.stackexchange.com/questions/5020
– Lord Shark the Unknown
Aug 7 at 14:40












@Jneven yes it is i dont know why in combinatorial way
– SG tjdqls0599
Aug 7 at 14:48




@Jneven yes it is i dont know why in combinatorial way
– SG tjdqls0599
Aug 7 at 14:48












i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
– Jneven
Aug 7 at 14:50




i really can't understand what is it that you're asking, especially it is unclear what expression are you referring to
– Jneven
Aug 7 at 14:50




3




3




But $binomn2neqfracn(n+1)2$.
– Batominovski
Aug 7 at 14:52




But $binomn2neqfracn(n+1)2$.
– Batominovski
Aug 7 at 14:52










4 Answers
4






active

oldest

votes

















up vote
1
down vote



accepted










There is a 1-to-1 correspondence between each blue pair, and each yellow circle. With $n$ blue circles there are $binomn2$ blue pairs, and the number of yellow circles is $sum_i=1^n-1i$.



enter image description here






share|cite|improve this answer




























    up vote
    2
    down vote













    Clearly $sumlimits_i=0^n-1 i=sumlimits_j=1^n (j-1)$ by using the substitution $j=1+1$



    A combinatorial demonstration of $n choose 2 = sumlimits_j=1^n (j-1)$:



    • $n choose 2$ is the number of ways of choosing two integers from $1,2,ldots,n$

    • if the larger of the two integers is $j in 1,2,ldots,n$ then there are $j-1$ possibilities for the smaller of the two integers, so in total there are $sumlimits_j=1^n (j-1)$ possible pairs

    • so these two expressions are equal

    A geometric illustration this is $fracn(n-1)2$:



    enter image description here






    share|cite|improve this answer





















    • What does you mean larger of two integers??
      – SG tjdqls0599
      Aug 7 at 15:30










    • @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
      – Henry
      Aug 7 at 15:48

















    up vote
    1
    down vote













    Consider $dbinomn+12$. It is the number of ways to choose two items from a set of $n+1$ items.



    So, start with a single item (call it item 1). There are $n$ other items that can be picked to pair with it.



    Next, suppose we do NOT pick item 1. We start with item 2. Now, there are $n-1$ other items (that are not item 1 nor item 2) that can be picked to pair with it.



    ...



    Suppose we do NOT pick items 1 through $n-1$. We pick item $n$. There is exactly 1 other item (not items 1 through $n$) that can be picked to pair with it.






    share|cite|improve this answer




























      up vote
      0
      down vote













      $sum_i=1^n$ is $binomn+12$, not $binomn2$.



      Consider the set of $n=1$ tokens $1,2,ldots,n-1,n,*$. $binomn+12$ is the size of the set of possible pairs $(i,j)$ with $i<j$ (and $*$ greater than all the rest). Each pair $(i,j)$ represents a point on the plane, and each pair $(i,*)$ represents the point $(i,i)$. These points visualize as:



      $$beginarrayccccc
      star&star&cdots&star&star\
      star&star&cdots&star\
      vdots&vdots\
      star&star\
      star
      endarray$$



      Counting from the bottom up, you have $1+2+cdots+(n-1)+n$ points. So $binomn+12=sum_i=1^ni$.






      share|cite|improve this answer




























        4 Answers
        4






        active

        oldest

        votes








        4 Answers
        4






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes








        up vote
        1
        down vote



        accepted










        There is a 1-to-1 correspondence between each blue pair, and each yellow circle. With $n$ blue circles there are $binomn2$ blue pairs, and the number of yellow circles is $sum_i=1^n-1i$.



        enter image description here






        share|cite|improve this answer

























          up vote
          1
          down vote



          accepted










          There is a 1-to-1 correspondence between each blue pair, and each yellow circle. With $n$ blue circles there are $binomn2$ blue pairs, and the number of yellow circles is $sum_i=1^n-1i$.



          enter image description here






          share|cite|improve this answer























            up vote
            1
            down vote



            accepted







            up vote
            1
            down vote



            accepted






            There is a 1-to-1 correspondence between each blue pair, and each yellow circle. With $n$ blue circles there are $binomn2$ blue pairs, and the number of yellow circles is $sum_i=1^n-1i$.



            enter image description here






            share|cite|improve this answer













            There is a 1-to-1 correspondence between each blue pair, and each yellow circle. With $n$ blue circles there are $binomn2$ blue pairs, and the number of yellow circles is $sum_i=1^n-1i$.



            enter image description here







            share|cite|improve this answer













            share|cite|improve this answer



            share|cite|improve this answer











            answered Aug 7 at 15:08









            cansomeonehelpmeout

            4,7943830




            4,7943830




















                up vote
                2
                down vote













                Clearly $sumlimits_i=0^n-1 i=sumlimits_j=1^n (j-1)$ by using the substitution $j=1+1$



                A combinatorial demonstration of $n choose 2 = sumlimits_j=1^n (j-1)$:



                • $n choose 2$ is the number of ways of choosing two integers from $1,2,ldots,n$

                • if the larger of the two integers is $j in 1,2,ldots,n$ then there are $j-1$ possibilities for the smaller of the two integers, so in total there are $sumlimits_j=1^n (j-1)$ possible pairs

                • so these two expressions are equal

                A geometric illustration this is $fracn(n-1)2$:



                enter image description here






                share|cite|improve this answer





















                • What does you mean larger of two integers??
                  – SG tjdqls0599
                  Aug 7 at 15:30










                • @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                  – Henry
                  Aug 7 at 15:48














                up vote
                2
                down vote













                Clearly $sumlimits_i=0^n-1 i=sumlimits_j=1^n (j-1)$ by using the substitution $j=1+1$



                A combinatorial demonstration of $n choose 2 = sumlimits_j=1^n (j-1)$:



                • $n choose 2$ is the number of ways of choosing two integers from $1,2,ldots,n$

                • if the larger of the two integers is $j in 1,2,ldots,n$ then there are $j-1$ possibilities for the smaller of the two integers, so in total there are $sumlimits_j=1^n (j-1)$ possible pairs

                • so these two expressions are equal

                A geometric illustration this is $fracn(n-1)2$:



                enter image description here






                share|cite|improve this answer





















                • What does you mean larger of two integers??
                  – SG tjdqls0599
                  Aug 7 at 15:30










                • @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                  – Henry
                  Aug 7 at 15:48












                up vote
                2
                down vote










                up vote
                2
                down vote









                Clearly $sumlimits_i=0^n-1 i=sumlimits_j=1^n (j-1)$ by using the substitution $j=1+1$



                A combinatorial demonstration of $n choose 2 = sumlimits_j=1^n (j-1)$:



                • $n choose 2$ is the number of ways of choosing two integers from $1,2,ldots,n$

                • if the larger of the two integers is $j in 1,2,ldots,n$ then there are $j-1$ possibilities for the smaller of the two integers, so in total there are $sumlimits_j=1^n (j-1)$ possible pairs

                • so these two expressions are equal

                A geometric illustration this is $fracn(n-1)2$:



                enter image description here






                share|cite|improve this answer













                Clearly $sumlimits_i=0^n-1 i=sumlimits_j=1^n (j-1)$ by using the substitution $j=1+1$



                A combinatorial demonstration of $n choose 2 = sumlimits_j=1^n (j-1)$:



                • $n choose 2$ is the number of ways of choosing two integers from $1,2,ldots,n$

                • if the larger of the two integers is $j in 1,2,ldots,n$ then there are $j-1$ possibilities for the smaller of the two integers, so in total there are $sumlimits_j=1^n (j-1)$ possible pairs

                • so these two expressions are equal

                A geometric illustration this is $fracn(n-1)2$:



                enter image description here







                share|cite|improve this answer













                share|cite|improve this answer



                share|cite|improve this answer











                answered Aug 7 at 14:58









                Henry

                93.1k469147




                93.1k469147











                • What does you mean larger of two integers??
                  – SG tjdqls0599
                  Aug 7 at 15:30










                • @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                  – Henry
                  Aug 7 at 15:48
















                • What does you mean larger of two integers??
                  – SG tjdqls0599
                  Aug 7 at 15:30










                • @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                  – Henry
                  Aug 7 at 15:48















                What does you mean larger of two integers??
                – SG tjdqls0599
                Aug 7 at 15:30




                What does you mean larger of two integers??
                – SG tjdqls0599
                Aug 7 at 15:30












                @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                – Henry
                Aug 7 at 15:48




                @SGtjdqls0599: if I pick the integers $2$ and $5$ in any order, then $5$ is the larger of the two numbers
                – Henry
                Aug 7 at 15:48










                up vote
                1
                down vote













                Consider $dbinomn+12$. It is the number of ways to choose two items from a set of $n+1$ items.



                So, start with a single item (call it item 1). There are $n$ other items that can be picked to pair with it.



                Next, suppose we do NOT pick item 1. We start with item 2. Now, there are $n-1$ other items (that are not item 1 nor item 2) that can be picked to pair with it.



                ...



                Suppose we do NOT pick items 1 through $n-1$. We pick item $n$. There is exactly 1 other item (not items 1 through $n$) that can be picked to pair with it.






                share|cite|improve this answer

























                  up vote
                  1
                  down vote













                  Consider $dbinomn+12$. It is the number of ways to choose two items from a set of $n+1$ items.



                  So, start with a single item (call it item 1). There are $n$ other items that can be picked to pair with it.



                  Next, suppose we do NOT pick item 1. We start with item 2. Now, there are $n-1$ other items (that are not item 1 nor item 2) that can be picked to pair with it.



                  ...



                  Suppose we do NOT pick items 1 through $n-1$. We pick item $n$. There is exactly 1 other item (not items 1 through $n$) that can be picked to pair with it.






                  share|cite|improve this answer























                    up vote
                    1
                    down vote










                    up vote
                    1
                    down vote









                    Consider $dbinomn+12$. It is the number of ways to choose two items from a set of $n+1$ items.



                    So, start with a single item (call it item 1). There are $n$ other items that can be picked to pair with it.



                    Next, suppose we do NOT pick item 1. We start with item 2. Now, there are $n-1$ other items (that are not item 1 nor item 2) that can be picked to pair with it.



                    ...



                    Suppose we do NOT pick items 1 through $n-1$. We pick item $n$. There is exactly 1 other item (not items 1 through $n$) that can be picked to pair with it.






                    share|cite|improve this answer













                    Consider $dbinomn+12$. It is the number of ways to choose two items from a set of $n+1$ items.



                    So, start with a single item (call it item 1). There are $n$ other items that can be picked to pair with it.



                    Next, suppose we do NOT pick item 1. We start with item 2. Now, there are $n-1$ other items (that are not item 1 nor item 2) that can be picked to pair with it.



                    ...



                    Suppose we do NOT pick items 1 through $n-1$. We pick item $n$. There is exactly 1 other item (not items 1 through $n$) that can be picked to pair with it.







                    share|cite|improve this answer













                    share|cite|improve this answer



                    share|cite|improve this answer











                    answered Aug 7 at 15:00









                    InterstellarProbe

                    2,262518




                    2,262518




















                        up vote
                        0
                        down vote













                        $sum_i=1^n$ is $binomn+12$, not $binomn2$.



                        Consider the set of $n=1$ tokens $1,2,ldots,n-1,n,*$. $binomn+12$ is the size of the set of possible pairs $(i,j)$ with $i<j$ (and $*$ greater than all the rest). Each pair $(i,j)$ represents a point on the plane, and each pair $(i,*)$ represents the point $(i,i)$. These points visualize as:



                        $$beginarrayccccc
                        star&star&cdots&star&star\
                        star&star&cdots&star\
                        vdots&vdots\
                        star&star\
                        star
                        endarray$$



                        Counting from the bottom up, you have $1+2+cdots+(n-1)+n$ points. So $binomn+12=sum_i=1^ni$.






                        share|cite|improve this answer

























                          up vote
                          0
                          down vote













                          $sum_i=1^n$ is $binomn+12$, not $binomn2$.



                          Consider the set of $n=1$ tokens $1,2,ldots,n-1,n,*$. $binomn+12$ is the size of the set of possible pairs $(i,j)$ with $i<j$ (and $*$ greater than all the rest). Each pair $(i,j)$ represents a point on the plane, and each pair $(i,*)$ represents the point $(i,i)$. These points visualize as:



                          $$beginarrayccccc
                          star&star&cdots&star&star\
                          star&star&cdots&star\
                          vdots&vdots\
                          star&star\
                          star
                          endarray$$



                          Counting from the bottom up, you have $1+2+cdots+(n-1)+n$ points. So $binomn+12=sum_i=1^ni$.






                          share|cite|improve this answer























                            up vote
                            0
                            down vote










                            up vote
                            0
                            down vote









                            $sum_i=1^n$ is $binomn+12$, not $binomn2$.



                            Consider the set of $n=1$ tokens $1,2,ldots,n-1,n,*$. $binomn+12$ is the size of the set of possible pairs $(i,j)$ with $i<j$ (and $*$ greater than all the rest). Each pair $(i,j)$ represents a point on the plane, and each pair $(i,*)$ represents the point $(i,i)$. These points visualize as:



                            $$beginarrayccccc
                            star&star&cdots&star&star\
                            star&star&cdots&star\
                            vdots&vdots\
                            star&star\
                            star
                            endarray$$



                            Counting from the bottom up, you have $1+2+cdots+(n-1)+n$ points. So $binomn+12=sum_i=1^ni$.






                            share|cite|improve this answer













                            $sum_i=1^n$ is $binomn+12$, not $binomn2$.



                            Consider the set of $n=1$ tokens $1,2,ldots,n-1,n,*$. $binomn+12$ is the size of the set of possible pairs $(i,j)$ with $i<j$ (and $*$ greater than all the rest). Each pair $(i,j)$ represents a point on the plane, and each pair $(i,*)$ represents the point $(i,i)$. These points visualize as:



                            $$beginarrayccccc
                            star&star&cdots&star&star\
                            star&star&cdots&star\
                            vdots&vdots\
                            star&star\
                            star
                            endarray$$



                            Counting from the bottom up, you have $1+2+cdots+(n-1)+n$ points. So $binomn+12=sum_i=1^ni$.







                            share|cite|improve this answer













                            share|cite|improve this answer



                            share|cite|improve this answer











                            answered Aug 7 at 14:55









                            alex.jordan

                            37k459117




                            37k459117












                                這個網誌中的熱門文章

                                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?