flâneur

combinatorics - How do I find the number of subsets of a specific cardinality - Mathematics Stack Exchange

math.stackexchange.com · saved by 1 readers

Mathematics is part of Stack Overflow’s open communities: specialist spaces where curiosity is welcome, knowledge is shared freely, and the best answers rise to the top. Bring the best of human thought and AI automation together at your work. Learn more Looking for your teams? Stack Internal has its own domain! You can now access your teams at stackoverflowteams.com. Teams no longer appear in the left sidebar on stackoverflow.com. Check your email to learn more about these changes. Stack Internal Knowledge at work Bring the best of human thought and AI automation together at your work. Given a set S with cardinality N, does a formula exist to calculate the number of subsets with cardinality M? For instance, if N=5, and M=3; how many subsets are there within S with cardinality M? Here is some extra info for each cardinality...maybe it helps. So, set S contains 32 subsets total, but I just want to find the number of subsets for M. Thanks for your insight...I thought this would be easy, b

saved by