☜ Navigate through the Combinatorics pages ☞ Next


Combinations of a set are choices (subsets) of its elements. Order does not matter, so the combination {a,b,c} is considered the same as {a,c,b}. (For cases where order matters, see the previous page.)

Brief Explanation

This page constructs (as opposed to merely counting) the combinations for (modestly-sized) sets. It is a well-known result that for an N-element set, there are 2N different combinations (subsets).

However, this fact does not tell you what those subsets are. In the next section you can list these subsets. The elements in the sets will always be the letters a, b, c, etc.

Try It Yourself

Each bulleted line finds one or more combinations, explained below. To calculate, enter the required numbers in the round text fields, and click the in the same line.



The code I am using is all visible: just do a “View Page Source” or its equivalent on this Web page.

The next page ... does not yet exist. But I have so many ideas I don’t know where to begin!

☜ Navigate through the Combinatorics pages ☞ Next