Why does $binom {3} {1} =binom {3} {2}$?












0












$begingroup$


Why does $binom {3} {1} =binom {3} {2}$? Is it just a coincidence?










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Why does $binom {3} {1} =binom {3} {2}$? Is it just a coincidence?










    share|cite|improve this question











    $endgroup$















      0












      0








      0


      0



      $begingroup$


      Why does $binom {3} {1} =binom {3} {2}$? Is it just a coincidence?










      share|cite|improve this question











      $endgroup$




      Why does $binom {3} {1} =binom {3} {2}$? Is it just a coincidence?







      combinatorics binomial-coefficients combinations






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 28 '18 at 21:26









      Rebellos

      15.7k31250




      15.7k31250










      asked Dec 28 '18 at 21:18









      Ashraf BenmebarekAshraf Benmebarek

      465




      465






















          7 Answers
          7






          active

          oldest

          votes


















          5












          $begingroup$

          Always $binom{n}{k}=binom{n}{n-k}$ (when $0 le k le n.)$ Because choosing a $k$ element set from $n$ things is the same as choosing its complement.



          So also $binom{10}{3}=binom{10}{7}$ and one can generate lots of these.






          share|cite|improve this answer









          $endgroup$





















            3












            $begingroup$

            The binomial coefficient is calculated as :



            $$binom{n}{k}= frac{n!}{k!(n-k)!}$$



            It's easy to see why the two binomial coefficients mentioned are equal, based on the definition.



            In general, it always holds that :



            $$binom{n}{k}=binom{n}{n-k}, quad 0leq k leq n$$



            Essentialy, what this means is that choosing an element $k$ from $n$ elements is the same as not choosing $n-k$ elements from $n$ elements.






            share|cite|improve this answer









            $endgroup$





















              2












              $begingroup$

              Because to choose $1$ from $3$ things it's the same not to choose $2$ from $3$ things.






              share|cite|improve this answer









              $endgroup$





















                1












                $begingroup$

                No, it’s not. We have



                $${n choose r} = {n choose n-r}$$



                for non-negative values of $r$ with $r leq n$, which can be verified through the definition ${n choose r} = frac{n!}{r!(n-r)!}$:



                $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!(n-(n-r))!}$$



                $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!r!}$$






                share|cite|improve this answer









                $endgroup$





















                  1












                  $begingroup$

                  $binom{3}{1}$ is calculating the number of ways to choose one object out of a set of three. $binom{3}{2}$ is calculating the number of ways to choose two objects out of a set of three.



                  Imagine I'm looking at a group of three people: Alice, Bob, and Charlotte. Let's say I want to choose two of them, and I've decided that those two are going to be Alice and Bob. There are two ways for me to say that - one way is the obvious, "I'm going to choose Alice and Bob." The other way is to talk about who I'm not choosing: "I'm going to choose everyone except Charlotte."



                  More generally, when picking two objects out of a group of three, we can phrase that as deciding which one is going to be left over. In other words, choosing which two to take is the same as choosing which one not to take. There are $binom{3}{2}$ ways to choose which two to take; there are $binom{3}{1}$ ways to choose which one not to take. Since those mean the same thing, $binom{3}{1} = binom{3}{2}$.



                  It is not just a coincidence. Nothing I just said really had anything to do with the numbers $3$, $2$, and $1$. What mattered was that when $2$ were chosen out of a group of $3$, $1$ was left over. We can generalize that: when $k$ are chosen out of a group of $n$, $n - k$ will be left over; so choosing $k$ out of $n$ is the same as excluding $n - k$ out of $n$. In other words:



                  $$binom{n}{k} = binom{n}{n - k}$$






                  share|cite|improve this answer









                  $endgroup$





















                    0












                    $begingroup$

                    Imagine you have a group of $n$ objects, and you choose $k$ of those objects to remove.



                    However, instead of considering it like this, consider it as dividing the group of $n$ objects into two groups, one of which has $k$ objects (and consequently, the other has $(n-k)$ objects).



                    We can flip this scenario and remove $(n-k)$ objects, leaving $k$ behind.



                    Can you see how these two scenarios are the same?






                    share|cite|improve this answer









                    $endgroup$





















                      0












                      $begingroup$

                      Short Answer: No, These numbers are related to the Pascal's triangle which is symmetrical. The third row is 1 , 3 , 3, 1. This states that (3 Choose 1) = (3 Chose 2): which you stated, also: (3 Choose 0) = (3 Choose 3). You can continue this for any number of items.






                      share|cite|improve this answer









                      $endgroup$









                      • 1




                        $begingroup$
                        I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                        $endgroup$
                        – hardmath
                        Feb 25 at 4:00












                      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%2f3055293%2fwhy-does-binom-3-1-binom-3-2%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown

























                      7 Answers
                      7






                      active

                      oldest

                      votes








                      7 Answers
                      7






                      active

                      oldest

                      votes









                      active

                      oldest

                      votes






                      active

                      oldest

                      votes









                      5












                      $begingroup$

                      Always $binom{n}{k}=binom{n}{n-k}$ (when $0 le k le n.)$ Because choosing a $k$ element set from $n$ things is the same as choosing its complement.



                      So also $binom{10}{3}=binom{10}{7}$ and one can generate lots of these.






                      share|cite|improve this answer









                      $endgroup$


















                        5












                        $begingroup$

                        Always $binom{n}{k}=binom{n}{n-k}$ (when $0 le k le n.)$ Because choosing a $k$ element set from $n$ things is the same as choosing its complement.



                        So also $binom{10}{3}=binom{10}{7}$ and one can generate lots of these.






                        share|cite|improve this answer









                        $endgroup$
















                          5












                          5








                          5





                          $begingroup$

                          Always $binom{n}{k}=binom{n}{n-k}$ (when $0 le k le n.)$ Because choosing a $k$ element set from $n$ things is the same as choosing its complement.



                          So also $binom{10}{3}=binom{10}{7}$ and one can generate lots of these.






                          share|cite|improve this answer









                          $endgroup$



                          Always $binom{n}{k}=binom{n}{n-k}$ (when $0 le k le n.)$ Because choosing a $k$ element set from $n$ things is the same as choosing its complement.



                          So also $binom{10}{3}=binom{10}{7}$ and one can generate lots of these.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Dec 28 '18 at 21:22









                          coffeemathcoffeemath

                          2,9691416




                          2,9691416























                              3












                              $begingroup$

                              The binomial coefficient is calculated as :



                              $$binom{n}{k}= frac{n!}{k!(n-k)!}$$



                              It's easy to see why the two binomial coefficients mentioned are equal, based on the definition.



                              In general, it always holds that :



                              $$binom{n}{k}=binom{n}{n-k}, quad 0leq k leq n$$



                              Essentialy, what this means is that choosing an element $k$ from $n$ elements is the same as not choosing $n-k$ elements from $n$ elements.






                              share|cite|improve this answer









                              $endgroup$


















                                3












                                $begingroup$

                                The binomial coefficient is calculated as :



                                $$binom{n}{k}= frac{n!}{k!(n-k)!}$$



                                It's easy to see why the two binomial coefficients mentioned are equal, based on the definition.



                                In general, it always holds that :



                                $$binom{n}{k}=binom{n}{n-k}, quad 0leq k leq n$$



                                Essentialy, what this means is that choosing an element $k$ from $n$ elements is the same as not choosing $n-k$ elements from $n$ elements.






                                share|cite|improve this answer









                                $endgroup$
















                                  3












                                  3








                                  3





                                  $begingroup$

                                  The binomial coefficient is calculated as :



                                  $$binom{n}{k}= frac{n!}{k!(n-k)!}$$



                                  It's easy to see why the two binomial coefficients mentioned are equal, based on the definition.



                                  In general, it always holds that :



                                  $$binom{n}{k}=binom{n}{n-k}, quad 0leq k leq n$$



                                  Essentialy, what this means is that choosing an element $k$ from $n$ elements is the same as not choosing $n-k$ elements from $n$ elements.






                                  share|cite|improve this answer









                                  $endgroup$



                                  The binomial coefficient is calculated as :



                                  $$binom{n}{k}= frac{n!}{k!(n-k)!}$$



                                  It's easy to see why the two binomial coefficients mentioned are equal, based on the definition.



                                  In general, it always holds that :



                                  $$binom{n}{k}=binom{n}{n-k}, quad 0leq k leq n$$



                                  Essentialy, what this means is that choosing an element $k$ from $n$ elements is the same as not choosing $n-k$ elements from $n$ elements.







                                  share|cite|improve this answer












                                  share|cite|improve this answer



                                  share|cite|improve this answer










                                  answered Dec 28 '18 at 21:22









                                  RebellosRebellos

                                  15.7k31250




                                  15.7k31250























                                      2












                                      $begingroup$

                                      Because to choose $1$ from $3$ things it's the same not to choose $2$ from $3$ things.






                                      share|cite|improve this answer









                                      $endgroup$


















                                        2












                                        $begingroup$

                                        Because to choose $1$ from $3$ things it's the same not to choose $2$ from $3$ things.






                                        share|cite|improve this answer









                                        $endgroup$
















                                          2












                                          2








                                          2





                                          $begingroup$

                                          Because to choose $1$ from $3$ things it's the same not to choose $2$ from $3$ things.






                                          share|cite|improve this answer









                                          $endgroup$



                                          Because to choose $1$ from $3$ things it's the same not to choose $2$ from $3$ things.







                                          share|cite|improve this answer












                                          share|cite|improve this answer



                                          share|cite|improve this answer










                                          answered Dec 28 '18 at 21:23









                                          Michael RozenbergMichael Rozenberg

                                          111k1896201




                                          111k1896201























                                              1












                                              $begingroup$

                                              No, it’s not. We have



                                              $${n choose r} = {n choose n-r}$$



                                              for non-negative values of $r$ with $r leq n$, which can be verified through the definition ${n choose r} = frac{n!}{r!(n-r)!}$:



                                              $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!(n-(n-r))!}$$



                                              $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!r!}$$






                                              share|cite|improve this answer









                                              $endgroup$


















                                                1












                                                $begingroup$

                                                No, it’s not. We have



                                                $${n choose r} = {n choose n-r}$$



                                                for non-negative values of $r$ with $r leq n$, which can be verified through the definition ${n choose r} = frac{n!}{r!(n-r)!}$:



                                                $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!(n-(n-r))!}$$



                                                $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!r!}$$






                                                share|cite|improve this answer









                                                $endgroup$
















                                                  1












                                                  1








                                                  1





                                                  $begingroup$

                                                  No, it’s not. We have



                                                  $${n choose r} = {n choose n-r}$$



                                                  for non-negative values of $r$ with $r leq n$, which can be verified through the definition ${n choose r} = frac{n!}{r!(n-r)!}$:



                                                  $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!(n-(n-r))!}$$



                                                  $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!r!}$$






                                                  share|cite|improve this answer









                                                  $endgroup$



                                                  No, it’s not. We have



                                                  $${n choose r} = {n choose n-r}$$



                                                  for non-negative values of $r$ with $r leq n$, which can be verified through the definition ${n choose r} = frac{n!}{r!(n-r)!}$:



                                                  $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!(n-(n-r))!}$$



                                                  $$frac{n!}{r!(n-r)!} = frac{n!}{(n-r)!r!}$$







                                                  share|cite|improve this answer












                                                  share|cite|improve this answer



                                                  share|cite|improve this answer










                                                  answered Dec 28 '18 at 21:25









                                                  KM101KM101

                                                  6,0861525




                                                  6,0861525























                                                      1












                                                      $begingroup$

                                                      $binom{3}{1}$ is calculating the number of ways to choose one object out of a set of three. $binom{3}{2}$ is calculating the number of ways to choose two objects out of a set of three.



                                                      Imagine I'm looking at a group of three people: Alice, Bob, and Charlotte. Let's say I want to choose two of them, and I've decided that those two are going to be Alice and Bob. There are two ways for me to say that - one way is the obvious, "I'm going to choose Alice and Bob." The other way is to talk about who I'm not choosing: "I'm going to choose everyone except Charlotte."



                                                      More generally, when picking two objects out of a group of three, we can phrase that as deciding which one is going to be left over. In other words, choosing which two to take is the same as choosing which one not to take. There are $binom{3}{2}$ ways to choose which two to take; there are $binom{3}{1}$ ways to choose which one not to take. Since those mean the same thing, $binom{3}{1} = binom{3}{2}$.



                                                      It is not just a coincidence. Nothing I just said really had anything to do with the numbers $3$, $2$, and $1$. What mattered was that when $2$ were chosen out of a group of $3$, $1$ was left over. We can generalize that: when $k$ are chosen out of a group of $n$, $n - k$ will be left over; so choosing $k$ out of $n$ is the same as excluding $n - k$ out of $n$. In other words:



                                                      $$binom{n}{k} = binom{n}{n - k}$$






                                                      share|cite|improve this answer









                                                      $endgroup$


















                                                        1












                                                        $begingroup$

                                                        $binom{3}{1}$ is calculating the number of ways to choose one object out of a set of three. $binom{3}{2}$ is calculating the number of ways to choose two objects out of a set of three.



                                                        Imagine I'm looking at a group of three people: Alice, Bob, and Charlotte. Let's say I want to choose two of them, and I've decided that those two are going to be Alice and Bob. There are two ways for me to say that - one way is the obvious, "I'm going to choose Alice and Bob." The other way is to talk about who I'm not choosing: "I'm going to choose everyone except Charlotte."



                                                        More generally, when picking two objects out of a group of three, we can phrase that as deciding which one is going to be left over. In other words, choosing which two to take is the same as choosing which one not to take. There are $binom{3}{2}$ ways to choose which two to take; there are $binom{3}{1}$ ways to choose which one not to take. Since those mean the same thing, $binom{3}{1} = binom{3}{2}$.



                                                        It is not just a coincidence. Nothing I just said really had anything to do with the numbers $3$, $2$, and $1$. What mattered was that when $2$ were chosen out of a group of $3$, $1$ was left over. We can generalize that: when $k$ are chosen out of a group of $n$, $n - k$ will be left over; so choosing $k$ out of $n$ is the same as excluding $n - k$ out of $n$. In other words:



                                                        $$binom{n}{k} = binom{n}{n - k}$$






                                                        share|cite|improve this answer









                                                        $endgroup$
















                                                          1












                                                          1








                                                          1





                                                          $begingroup$

                                                          $binom{3}{1}$ is calculating the number of ways to choose one object out of a set of three. $binom{3}{2}$ is calculating the number of ways to choose two objects out of a set of three.



                                                          Imagine I'm looking at a group of three people: Alice, Bob, and Charlotte. Let's say I want to choose two of them, and I've decided that those two are going to be Alice and Bob. There are two ways for me to say that - one way is the obvious, "I'm going to choose Alice and Bob." The other way is to talk about who I'm not choosing: "I'm going to choose everyone except Charlotte."



                                                          More generally, when picking two objects out of a group of three, we can phrase that as deciding which one is going to be left over. In other words, choosing which two to take is the same as choosing which one not to take. There are $binom{3}{2}$ ways to choose which two to take; there are $binom{3}{1}$ ways to choose which one not to take. Since those mean the same thing, $binom{3}{1} = binom{3}{2}$.



                                                          It is not just a coincidence. Nothing I just said really had anything to do with the numbers $3$, $2$, and $1$. What mattered was that when $2$ were chosen out of a group of $3$, $1$ was left over. We can generalize that: when $k$ are chosen out of a group of $n$, $n - k$ will be left over; so choosing $k$ out of $n$ is the same as excluding $n - k$ out of $n$. In other words:



                                                          $$binom{n}{k} = binom{n}{n - k}$$






                                                          share|cite|improve this answer









                                                          $endgroup$



                                                          $binom{3}{1}$ is calculating the number of ways to choose one object out of a set of three. $binom{3}{2}$ is calculating the number of ways to choose two objects out of a set of three.



                                                          Imagine I'm looking at a group of three people: Alice, Bob, and Charlotte. Let's say I want to choose two of them, and I've decided that those two are going to be Alice and Bob. There are two ways for me to say that - one way is the obvious, "I'm going to choose Alice and Bob." The other way is to talk about who I'm not choosing: "I'm going to choose everyone except Charlotte."



                                                          More generally, when picking two objects out of a group of three, we can phrase that as deciding which one is going to be left over. In other words, choosing which two to take is the same as choosing which one not to take. There are $binom{3}{2}$ ways to choose which two to take; there are $binom{3}{1}$ ways to choose which one not to take. Since those mean the same thing, $binom{3}{1} = binom{3}{2}$.



                                                          It is not just a coincidence. Nothing I just said really had anything to do with the numbers $3$, $2$, and $1$. What mattered was that when $2$ were chosen out of a group of $3$, $1$ was left over. We can generalize that: when $k$ are chosen out of a group of $n$, $n - k$ will be left over; so choosing $k$ out of $n$ is the same as excluding $n - k$ out of $n$. In other words:



                                                          $$binom{n}{k} = binom{n}{n - k}$$







                                                          share|cite|improve this answer












                                                          share|cite|improve this answer



                                                          share|cite|improve this answer










                                                          answered Dec 28 '18 at 21:27









                                                          ReeseReese

                                                          15.3k11338




                                                          15.3k11338























                                                              0












                                                              $begingroup$

                                                              Imagine you have a group of $n$ objects, and you choose $k$ of those objects to remove.



                                                              However, instead of considering it like this, consider it as dividing the group of $n$ objects into two groups, one of which has $k$ objects (and consequently, the other has $(n-k)$ objects).



                                                              We can flip this scenario and remove $(n-k)$ objects, leaving $k$ behind.



                                                              Can you see how these two scenarios are the same?






                                                              share|cite|improve this answer









                                                              $endgroup$


















                                                                0












                                                                $begingroup$

                                                                Imagine you have a group of $n$ objects, and you choose $k$ of those objects to remove.



                                                                However, instead of considering it like this, consider it as dividing the group of $n$ objects into two groups, one of which has $k$ objects (and consequently, the other has $(n-k)$ objects).



                                                                We can flip this scenario and remove $(n-k)$ objects, leaving $k$ behind.



                                                                Can you see how these two scenarios are the same?






                                                                share|cite|improve this answer









                                                                $endgroup$
















                                                                  0












                                                                  0








                                                                  0





                                                                  $begingroup$

                                                                  Imagine you have a group of $n$ objects, and you choose $k$ of those objects to remove.



                                                                  However, instead of considering it like this, consider it as dividing the group of $n$ objects into two groups, one of which has $k$ objects (and consequently, the other has $(n-k)$ objects).



                                                                  We can flip this scenario and remove $(n-k)$ objects, leaving $k$ behind.



                                                                  Can you see how these two scenarios are the same?






                                                                  share|cite|improve this answer









                                                                  $endgroup$



                                                                  Imagine you have a group of $n$ objects, and you choose $k$ of those objects to remove.



                                                                  However, instead of considering it like this, consider it as dividing the group of $n$ objects into two groups, one of which has $k$ objects (and consequently, the other has $(n-k)$ objects).



                                                                  We can flip this scenario and remove $(n-k)$ objects, leaving $k$ behind.



                                                                  Can you see how these two scenarios are the same?







                                                                  share|cite|improve this answer












                                                                  share|cite|improve this answer



                                                                  share|cite|improve this answer










                                                                  answered Dec 28 '18 at 21:41









                                                                  Rhys HughesRhys Hughes

                                                                  7,0791630




                                                                  7,0791630























                                                                      0












                                                                      $begingroup$

                                                                      Short Answer: No, These numbers are related to the Pascal's triangle which is symmetrical. The third row is 1 , 3 , 3, 1. This states that (3 Choose 1) = (3 Chose 2): which you stated, also: (3 Choose 0) = (3 Choose 3). You can continue this for any number of items.






                                                                      share|cite|improve this answer









                                                                      $endgroup$









                                                                      • 1




                                                                        $begingroup$
                                                                        I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                        $endgroup$
                                                                        – hardmath
                                                                        Feb 25 at 4:00
















                                                                      0












                                                                      $begingroup$

                                                                      Short Answer: No, These numbers are related to the Pascal's triangle which is symmetrical. The third row is 1 , 3 , 3, 1. This states that (3 Choose 1) = (3 Chose 2): which you stated, also: (3 Choose 0) = (3 Choose 3). You can continue this for any number of items.






                                                                      share|cite|improve this answer









                                                                      $endgroup$









                                                                      • 1




                                                                        $begingroup$
                                                                        I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                        $endgroup$
                                                                        – hardmath
                                                                        Feb 25 at 4:00














                                                                      0












                                                                      0








                                                                      0





                                                                      $begingroup$

                                                                      Short Answer: No, These numbers are related to the Pascal's triangle which is symmetrical. The third row is 1 , 3 , 3, 1. This states that (3 Choose 1) = (3 Chose 2): which you stated, also: (3 Choose 0) = (3 Choose 3). You can continue this for any number of items.






                                                                      share|cite|improve this answer









                                                                      $endgroup$



                                                                      Short Answer: No, These numbers are related to the Pascal's triangle which is symmetrical. The third row is 1 , 3 , 3, 1. This states that (3 Choose 1) = (3 Chose 2): which you stated, also: (3 Choose 0) = (3 Choose 3). You can continue this for any number of items.







                                                                      share|cite|improve this answer












                                                                      share|cite|improve this answer



                                                                      share|cite|improve this answer










                                                                      answered Feb 24 at 4:56









                                                                      Abdullah KhalidAbdullah Khalid

                                                                      1




                                                                      1








                                                                      • 1




                                                                        $begingroup$
                                                                        I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                        $endgroup$
                                                                        – hardmath
                                                                        Feb 25 at 4:00














                                                                      • 1




                                                                        $begingroup$
                                                                        I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                        $endgroup$
                                                                        – hardmath
                                                                        Feb 25 at 4:00








                                                                      1




                                                                      1




                                                                      $begingroup$
                                                                      I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                      $endgroup$
                                                                      – hardmath
                                                                      Feb 25 at 4:00




                                                                      $begingroup$
                                                                      I think it would be a bit clearer to use a complete sentence: "Short Answer: No, it is not a coincidence." Then follow with the explanation as above. "No" is doubtless clear to you in this sense, but to other Readers "no" might mean an objection to some other aspect of the Question posed.
                                                                      $endgroup$
                                                                      – hardmath
                                                                      Feb 25 at 4:00


















                                                                      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%2f3055293%2fwhy-does-binom-3-1-binom-3-2%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

                                                                      Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

                                                                      ComboBox Display Member on multiple fields

                                                                      Is it possible to collect Nectar points via Trainline?