Combinations is a popular topic within discrete math and is used heavily for counting problems. Our combinations calculator solves for the number of subsets (arrangements or groups) that can be a taken from a set of objects. Unlike permutations however, the order of the subset does not matter, so it isn't as restricting as permutations. Basically, combinations let you know how many different subsets can be created using the same items, unordered. For example, the subsets {c, s, l} and {l, s, c} from the set {a, c, b, l, d, s} would count as 1 in combinations (order doesn't matter), but 2 separate subsets in permutations (since the order is strict).