Help finding a combinatorial proof of ${kn choose 2}= k{n choose 2}+n^2{k choose 2}$ [closed]












5












$begingroup$


Hi I have been trying to find a way to find a combinatorial proof for ${kn choose 2}= k{n choose 2}+n^2{k choose 2}$.






combinatorics discrete-mathematics







share|cite|improve this question









$endgroup$



closed as off-topic by RRL, jgon, KReiser, Cesareo, amWhy Jan 5 at 1:57


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, jgon, KReiser, Cesareo, amWhy

If this question can be reworded to fit the rules in the help center, please edit the question.





















    5












    $begingroup$


    Hi I have been trying to find a way to find a combinatorial proof for ${kn choose 2}= k{n choose 2}+n^2{k choose 2}$.






    combinatorics discrete-mathematics







    share|cite|improve this question









    $endgroup$



    closed as off-topic by RRL, jgon, KReiser, Cesareo, amWhy Jan 5 at 1:57


    This question appears to be off-topic. The users who voted to close gave this specific reason:


    • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, jgon, KReiser, Cesareo, amWhy

    If this question can be reworded to fit the rules in the help center, please edit the question.



















      5












      5








      5


      3



      $begingroup$


      Hi I have been trying to find a way to find a combinatorial proof for ${kn choose 2}= k{n choose 2}+n^2{k choose 2}$.






      combinatorics discrete-mathematics







      share|cite|improve this question









      $endgroup$




      Hi I have been trying to find a way to find a combinatorial proof for ${kn choose 2}= k{n choose 2}+n^2{k choose 2}$.






      combinatorics discrete-mathematics




      combinatorics discrete-mathematics






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 6 '18 at 23:28









      Lauren SmithLauren Smith

      291




      291




      closed as off-topic by RRL, jgon, KReiser, Cesareo, amWhy Jan 5 at 1:57


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, jgon, KReiser, Cesareo, amWhy

      If this question can be reworded to fit the rules in the help center, please edit the question.







      closed as off-topic by RRL, jgon, KReiser, Cesareo, amWhy Jan 5 at 1:57


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – RRL, jgon, KReiser, Cesareo, amWhy

      If this question can be reworded to fit the rules in the help center, please edit the question.






















          3 Answers
          3






          active

          oldest

          votes


















          6












          $begingroup$

          Hint: You want to pick $2$ elements out of $k$ buckets of $n$ elements each. You have two possible ways to do it: either you pick a bucket, and then you take $2$ elements from this bucket, or you pick $2$ buckets and then you choose one element from each of those $2$ buckets.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:38



















          3












          $begingroup$

          Consider a set of $kcdot n$ elements allocated in a grid with $n$ rows and $k$ columns then




          • on the LHS we have the ways to choose $2$ elements among all of them

          • on the RHS we have the cases with 2 elements choseen from a same row $k{n choose 2}$ and the cases 2 elements choseen from a same column $n{k choose 2}$ and the orther cases with $2$ elements chosen form different columns and rows $nk+(n-1)(k-1)$, indeed


          $$k{n choose 2}+n{k choose 2}+nk+(n-1)(k-1)=k{n choose 2}+n^2{k choose 2}$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:39



















          1












          $begingroup$

          As an addendum to Daniel Robert-Nicoud’s excellent hint, I find it helpful to rewrite the equality in the following way:



          $$binom{kn}{2} = binom{k}{1}binom{n}{2} + binom{k}{2}binom{n}{1}binom{n}{1}.$$



          By reading multiplication as “and then,” and addition as “or,” try to recover Daniel’s narrative by reading off the right-hand side.




          With this thought process in mind, try to come up with a formula for $binom{nk}{3}$. Can you generalize this pattern?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:37


















          3 Answers
          3






          active

          oldest

          votes








          3 Answers
          3






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          6












          $begingroup$

          Hint: You want to pick $2$ elements out of $k$ buckets of $n$ elements each. You have two possible ways to do it: either you pick a bucket, and then you take $2$ elements from this bucket, or you pick $2$ buckets and then you choose one element from each of those $2$ buckets.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:38
















          6












          $begingroup$

          Hint: You want to pick $2$ elements out of $k$ buckets of $n$ elements each. You have two possible ways to do it: either you pick a bucket, and then you take $2$ elements from this bucket, or you pick $2$ buckets and then you choose one element from each of those $2$ buckets.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:38














          6












          6








          6





          $begingroup$

          Hint: You want to pick $2$ elements out of $k$ buckets of $n$ elements each. You have two possible ways to do it: either you pick a bucket, and then you take $2$ elements from this bucket, or you pick $2$ buckets and then you choose one element from each of those $2$ buckets.






          share|cite|improve this answer









          $endgroup$



          Hint: You want to pick $2$ elements out of $k$ buckets of $n$ elements each. You have two possible ways to do it: either you pick a bucket, and then you take $2$ elements from this bucket, or you pick $2$ buckets and then you choose one element from each of those $2$ buckets.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 6 '18 at 23:30









          Daniel Robert-NicoudDaniel Robert-Nicoud

          20.4k33696




          20.4k33696












          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:38


















          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:38
















          $begingroup$
          Thank you very much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:38




          $begingroup$
          Thank you very much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:38











          3












          $begingroup$

          Consider a set of $kcdot n$ elements allocated in a grid with $n$ rows and $k$ columns then




          • on the LHS we have the ways to choose $2$ elements among all of them

          • on the RHS we have the cases with 2 elements choseen from a same row $k{n choose 2}$ and the cases 2 elements choseen from a same column $n{k choose 2}$ and the orther cases with $2$ elements chosen form different columns and rows $nk+(n-1)(k-1)$, indeed


          $$k{n choose 2}+n{k choose 2}+nk+(n-1)(k-1)=k{n choose 2}+n^2{k choose 2}$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:39
















          3












          $begingroup$

          Consider a set of $kcdot n$ elements allocated in a grid with $n$ rows and $k$ columns then




          • on the LHS we have the ways to choose $2$ elements among all of them

          • on the RHS we have the cases with 2 elements choseen from a same row $k{n choose 2}$ and the cases 2 elements choseen from a same column $n{k choose 2}$ and the orther cases with $2$ elements chosen form different columns and rows $nk+(n-1)(k-1)$, indeed


          $$k{n choose 2}+n{k choose 2}+nk+(n-1)(k-1)=k{n choose 2}+n^2{k choose 2}$$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:39














          3












          3








          3





          $begingroup$

          Consider a set of $kcdot n$ elements allocated in a grid with $n$ rows and $k$ columns then




          • on the LHS we have the ways to choose $2$ elements among all of them

          • on the RHS we have the cases with 2 elements choseen from a same row $k{n choose 2}$ and the cases 2 elements choseen from a same column $n{k choose 2}$ and the orther cases with $2$ elements chosen form different columns and rows $nk+(n-1)(k-1)$, indeed


          $$k{n choose 2}+n{k choose 2}+nk+(n-1)(k-1)=k{n choose 2}+n^2{k choose 2}$$






          share|cite|improve this answer









          $endgroup$



          Consider a set of $kcdot n$ elements allocated in a grid with $n$ rows and $k$ columns then




          • on the LHS we have the ways to choose $2$ elements among all of them

          • on the RHS we have the cases with 2 elements choseen from a same row $k{n choose 2}$ and the cases 2 elements choseen from a same column $n{k choose 2}$ and the orther cases with $2$ elements chosen form different columns and rows $nk+(n-1)(k-1)$, indeed


          $$k{n choose 2}+n{k choose 2}+nk+(n-1)(k-1)=k{n choose 2}+n^2{k choose 2}$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 6 '18 at 23:46









          gimusigimusi

          92.8k84494




          92.8k84494












          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:39


















          • $begingroup$
            Thank you very much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:39
















          $begingroup$
          Thank you very much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:39




          $begingroup$
          Thank you very much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:39











          1












          $begingroup$

          As an addendum to Daniel Robert-Nicoud’s excellent hint, I find it helpful to rewrite the equality in the following way:



          $$binom{kn}{2} = binom{k}{1}binom{n}{2} + binom{k}{2}binom{n}{1}binom{n}{1}.$$



          By reading multiplication as “and then,” and addition as “or,” try to recover Daniel’s narrative by reading off the right-hand side.




          With this thought process in mind, try to come up with a formula for $binom{nk}{3}$. Can you generalize this pattern?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:37
















          1












          $begingroup$

          As an addendum to Daniel Robert-Nicoud’s excellent hint, I find it helpful to rewrite the equality in the following way:



          $$binom{kn}{2} = binom{k}{1}binom{n}{2} + binom{k}{2}binom{n}{1}binom{n}{1}.$$



          By reading multiplication as “and then,” and addition as “or,” try to recover Daniel’s narrative by reading off the right-hand side.




          With this thought process in mind, try to come up with a formula for $binom{nk}{3}$. Can you generalize this pattern?






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Thank you so much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:37














          1












          1








          1





          $begingroup$

          As an addendum to Daniel Robert-Nicoud’s excellent hint, I find it helpful to rewrite the equality in the following way:



          $$binom{kn}{2} = binom{k}{1}binom{n}{2} + binom{k}{2}binom{n}{1}binom{n}{1}.$$



          By reading multiplication as “and then,” and addition as “or,” try to recover Daniel’s narrative by reading off the right-hand side.




          With this thought process in mind, try to come up with a formula for $binom{nk}{3}$. Can you generalize this pattern?






          share|cite|improve this answer











          $endgroup$



          As an addendum to Daniel Robert-Nicoud’s excellent hint, I find it helpful to rewrite the equality in the following way:



          $$binom{kn}{2} = binom{k}{1}binom{n}{2} + binom{k}{2}binom{n}{1}binom{n}{1}.$$



          By reading multiplication as “and then,” and addition as “or,” try to recover Daniel’s narrative by reading off the right-hand side.




          With this thought process in mind, try to come up with a formula for $binom{nk}{3}$. Can you generalize this pattern?







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 7 '18 at 0:21

























          answered Dec 7 '18 at 0:05









          Santana AftonSantana Afton

          2,6692629




          2,6692629












          • $begingroup$
            Thank you so much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:37


















          • $begingroup$
            Thank you so much. This was very helpful.
            $endgroup$
            – Lauren Smith
            Dec 7 '18 at 7:37
















          $begingroup$
          Thank you so much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:37




          $begingroup$
          Thank you so much. This was very helpful.
          $endgroup$
          – Lauren Smith
          Dec 7 '18 at 7:37



          -

          Popular posts from this blog

          Bundesstraße 106

          Image
          Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
          Read more

          Verónica Boquete

          Image
          Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
          Read more

          Ida-Boy-Ed-Garten

          Image
          Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
          Read more