'selfish' set to be a set which has its own cardinality (number of elements) as an element












4














Define a selfish set to be a set which has its own cardinality (number of elements) as an element. Find, with proof, the number of subsets of ${1, 2, ldots, n}$ which are minimal selfish sets, that is, selfish sets none of whose proper subsets is selfish.



My Attempt:
Assume $textbf{A}$ to be a selfish set. If the cardinality of $textbf{A}$ is $c$, then can $textbf{A}$ contain $1,2,3....c-1$. Definitely answer is no. because if it contains $k<c$ then deleting $c-k$ elements except $k$ from $textbf{A}$ gives a subset of k elements contradicting the fact that $textbf{A}$ is minimal selfish.
Thus $textbf{A}$ must contain elements greater than or equal to $c$. But how do I find the minimal selfish sets with order $c$?






combinatorics discrete-mathematics







share|cite|improve this question
























  • Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
    – jmerry
    Dec 8 at 7:51
















4














Define a selfish set to be a set which has its own cardinality (number of elements) as an element. Find, with proof, the number of subsets of ${1, 2, ldots, n}$ which are minimal selfish sets, that is, selfish sets none of whose proper subsets is selfish.



My Attempt:
Assume $textbf{A}$ to be a selfish set. If the cardinality of $textbf{A}$ is $c$, then can $textbf{A}$ contain $1,2,3....c-1$. Definitely answer is no. because if it contains $k<c$ then deleting $c-k$ elements except $k$ from $textbf{A}$ gives a subset of k elements contradicting the fact that $textbf{A}$ is minimal selfish.
Thus $textbf{A}$ must contain elements greater than or equal to $c$. But how do I find the minimal selfish sets with order $c$?






combinatorics discrete-mathematics







share|cite|improve this question
























  • Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
    – jmerry
    Dec 8 at 7:51














4












4








4


1





Define a selfish set to be a set which has its own cardinality (number of elements) as an element. Find, with proof, the number of subsets of ${1, 2, ldots, n}$ which are minimal selfish sets, that is, selfish sets none of whose proper subsets is selfish.



My Attempt:
Assume $textbf{A}$ to be a selfish set. If the cardinality of $textbf{A}$ is $c$, then can $textbf{A}$ contain $1,2,3....c-1$. Definitely answer is no. because if it contains $k<c$ then deleting $c-k$ elements except $k$ from $textbf{A}$ gives a subset of k elements contradicting the fact that $textbf{A}$ is minimal selfish.
Thus $textbf{A}$ must contain elements greater than or equal to $c$. But how do I find the minimal selfish sets with order $c$?






combinatorics discrete-mathematics







share|cite|improve this question















Define a selfish set to be a set which has its own cardinality (number of elements) as an element. Find, with proof, the number of subsets of ${1, 2, ldots, n}$ which are minimal selfish sets, that is, selfish sets none of whose proper subsets is selfish.



My Attempt:
Assume $textbf{A}$ to be a selfish set. If the cardinality of $textbf{A}$ is $c$, then can $textbf{A}$ contain $1,2,3....c-1$. Definitely answer is no. because if it contains $k<c$ then deleting $c-k$ elements except $k$ from $textbf{A}$ gives a subset of k elements contradicting the fact that $textbf{A}$ is minimal selfish.
Thus $textbf{A}$ must contain elements greater than or equal to $c$. But how do I find the minimal selfish sets with order $c$?






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








edited Dec 8 at 10:20









Mutantoe

562411




562411










asked Dec 8 at 6:03







user408906



















  • Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
    – jmerry
    Dec 8 at 7:51


















  • Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
    – jmerry
    Dec 8 at 7:51
















Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
– jmerry
Dec 8 at 7:51




Reference note: This question, including the terminology, was problem B1 on the 1996 Putnam.
– jmerry
Dec 8 at 7:51










2 Answers
2






active

oldest

votes


















4














Your argument is correct.



Lets see if recursion helps.



Let $[n]$ denote the set ${1,2,ldots,n}$, and let $f_n$ denote the
number of minimal selfish subsets of $[n]$. Then the number of
minimal selfish subsets of $[n]$ not containing $n$ is equal to
$f_{n-1}$. On the other hand, for any minimal selfish subset of $[n]$
containing $n$, by subtracting 1 from each element, and then taking
away the element $n-1$ from the set, we obtain a minimal selfish
subset of $[n-2]$ (since $1$ and $n$ cannot both occur in a selfish
set). Conversely, any minimal selfish subset of $[n-2]$ gives rise to
a minimal selfish subset of $[n]$ containing $n$ by the inverse
procedure. Hence the number of minimal selfish subsets of $[n]$
containing $n$ is $f_{n-2}$. Thus we obtain $f_n=f_{n-1}+f_{n-2}$.
Since $f_1=f_2=1$, we have $f_n=F_n$, where $F_n$ denotes the $n$th
term of the Fibonacci sequence.






share|cite|improve this answer





























    1














    Your logic so far is fine. So what you know is that, since $c$ is in the set, then the other $c-1$ elements must all be at least $c+1$. There are $binom{n-c}{c-1}$ ways to choose them.



    Summing over these gives you the total count. It turns out that this gives you the $n^{th}$ Fibonacci number, which you can prove by induction (hint: use Pascal’s identity).






    share|cite|improve this answer





















      Your Answer





      StackExchange.ifUsing("editor", function () {
      return StackExchange.using("mathjaxEditing", function () {
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      });
      });
      }, "mathjax-editing");

      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "69"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3030745%2fselfish-set-to-be-a-set-which-has-its-own-cardinality-number-of-elements-as%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown
























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      4














      Your argument is correct.



      Lets see if recursion helps.



      Let $[n]$ denote the set ${1,2,ldots,n}$, and let $f_n$ denote the
      number of minimal selfish subsets of $[n]$. Then the number of
      minimal selfish subsets of $[n]$ not containing $n$ is equal to
      $f_{n-1}$. On the other hand, for any minimal selfish subset of $[n]$
      containing $n$, by subtracting 1 from each element, and then taking
      away the element $n-1$ from the set, we obtain a minimal selfish
      subset of $[n-2]$ (since $1$ and $n$ cannot both occur in a selfish
      set). Conversely, any minimal selfish subset of $[n-2]$ gives rise to
      a minimal selfish subset of $[n]$ containing $n$ by the inverse
      procedure. Hence the number of minimal selfish subsets of $[n]$
      containing $n$ is $f_{n-2}$. Thus we obtain $f_n=f_{n-1}+f_{n-2}$.
      Since $f_1=f_2=1$, we have $f_n=F_n$, where $F_n$ denotes the $n$th
      term of the Fibonacci sequence.






      share|cite|improve this answer


























        4














        Your argument is correct.



        Lets see if recursion helps.



        Let $[n]$ denote the set ${1,2,ldots,n}$, and let $f_n$ denote the
        number of minimal selfish subsets of $[n]$. Then the number of
        minimal selfish subsets of $[n]$ not containing $n$ is equal to
        $f_{n-1}$. On the other hand, for any minimal selfish subset of $[n]$
        containing $n$, by subtracting 1 from each element, and then taking
        away the element $n-1$ from the set, we obtain a minimal selfish
        subset of $[n-2]$ (since $1$ and $n$ cannot both occur in a selfish
        set). Conversely, any minimal selfish subset of $[n-2]$ gives rise to
        a minimal selfish subset of $[n]$ containing $n$ by the inverse
        procedure. Hence the number of minimal selfish subsets of $[n]$
        containing $n$ is $f_{n-2}$. Thus we obtain $f_n=f_{n-1}+f_{n-2}$.
        Since $f_1=f_2=1$, we have $f_n=F_n$, where $F_n$ denotes the $n$th
        term of the Fibonacci sequence.






        share|cite|improve this answer
























          4












          4








          4






          Your argument is correct.



          Lets see if recursion helps.



          Let $[n]$ denote the set ${1,2,ldots,n}$, and let $f_n$ denote the
          number of minimal selfish subsets of $[n]$. Then the number of
          minimal selfish subsets of $[n]$ not containing $n$ is equal to
          $f_{n-1}$. On the other hand, for any minimal selfish subset of $[n]$
          containing $n$, by subtracting 1 from each element, and then taking
          away the element $n-1$ from the set, we obtain a minimal selfish
          subset of $[n-2]$ (since $1$ and $n$ cannot both occur in a selfish
          set). Conversely, any minimal selfish subset of $[n-2]$ gives rise to
          a minimal selfish subset of $[n]$ containing $n$ by the inverse
          procedure. Hence the number of minimal selfish subsets of $[n]$
          containing $n$ is $f_{n-2}$. Thus we obtain $f_n=f_{n-1}+f_{n-2}$.
          Since $f_1=f_2=1$, we have $f_n=F_n$, where $F_n$ denotes the $n$th
          term of the Fibonacci sequence.






          share|cite|improve this answer












          Your argument is correct.



          Lets see if recursion helps.



          Let $[n]$ denote the set ${1,2,ldots,n}$, and let $f_n$ denote the
          number of minimal selfish subsets of $[n]$. Then the number of
          minimal selfish subsets of $[n]$ not containing $n$ is equal to
          $f_{n-1}$. On the other hand, for any minimal selfish subset of $[n]$
          containing $n$, by subtracting 1 from each element, and then taking
          away the element $n-1$ from the set, we obtain a minimal selfish
          subset of $[n-2]$ (since $1$ and $n$ cannot both occur in a selfish
          set). Conversely, any minimal selfish subset of $[n-2]$ gives rise to
          a minimal selfish subset of $[n]$ containing $n$ by the inverse
          procedure. Hence the number of minimal selfish subsets of $[n]$
          containing $n$ is $f_{n-2}$. Thus we obtain $f_n=f_{n-1}+f_{n-2}$.
          Since $f_1=f_2=1$, we have $f_n=F_n$, where $F_n$ denotes the $n$th
          term of the Fibonacci sequence.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 8 at 6:10









          Rakesh Bhatt

          851114




          851114























              1














              Your logic so far is fine. So what you know is that, since $c$ is in the set, then the other $c-1$ elements must all be at least $c+1$. There are $binom{n-c}{c-1}$ ways to choose them.



              Summing over these gives you the total count. It turns out that this gives you the $n^{th}$ Fibonacci number, which you can prove by induction (hint: use Pascal’s identity).






              share|cite|improve this answer


























                1














                Your logic so far is fine. So what you know is that, since $c$ is in the set, then the other $c-1$ elements must all be at least $c+1$. There are $binom{n-c}{c-1}$ ways to choose them.



                Summing over these gives you the total count. It turns out that this gives you the $n^{th}$ Fibonacci number, which you can prove by induction (hint: use Pascal’s identity).






                share|cite|improve this answer
























                  1












                  1








                  1






                  Your logic so far is fine. So what you know is that, since $c$ is in the set, then the other $c-1$ elements must all be at least $c+1$. There are $binom{n-c}{c-1}$ ways to choose them.



                  Summing over these gives you the total count. It turns out that this gives you the $n^{th}$ Fibonacci number, which you can prove by induction (hint: use Pascal’s identity).






                  share|cite|improve this answer












                  Your logic so far is fine. So what you know is that, since $c$ is in the set, then the other $c-1$ elements must all be at least $c+1$. There are $binom{n-c}{c-1}$ ways to choose them.



                  Summing over these gives you the total count. It turns out that this gives you the $n^{th}$ Fibonacci number, which you can prove by induction (hint: use Pascal’s identity).







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 8 at 6:08









                  platty

                  3,360320




                  3,360320






























                      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.





                      Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                      Please pay close attention to the following guidance:


                      • 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.


                      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%2f3030745%2fselfish-set-to-be-a-set-which-has-its-own-cardinality-number-of-elements-as%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

                      How to change which sound is reproduced for terminal bell?

                      Image
                      3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
                      Read more

                      Can I use Tabulator js library in my java Spring + Thymeleaf project?

                      Image
                      0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
                      Read more

                      Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

                      Image
                      up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
                      Read more