Skip to content
CalcWorld

Browse all tools

All Possible Combinations Generator

The all possible combinations generator writes out every group of a chosen size from your list. Four items taken two at a time give 6 combinations, or 10 if an item may repeat.

Sources: Wikipedia, NIST DLMF Updated

How the combinations generator works

This tool generates all possible combinations of items you provide. For example, if you enter "apple, banana, cherry" and choose length 2, you'll get combinations like "apple, banana", "apple, cherry", and "banana, cherry".

Generated combinations

Total combinations: 0

What the combinations generator lists

The generator writes out combinations: groups where order does not matter. It walks the list from left to right and only pairs an item with items after it, so apple, banana is listed once and banana, apple never appears.

The "Allow repetition" box is labelled with the word permutations, but it still lists combinations. It only lets an item appear more than once in a group, as in apple, apple. To count arrangements where order matters, use the permutation and combination calculator.

How to list all combinations of 4 items in pairs

  1. Type the items separated by commas: apple, banana, cherry, date.
  2. Set the length to 2 and leave "Allow repetition" unticked.
  3. Press Generate. The tool returns 6 rows: apple, banana · apple, cherry · apple, date · banana, cherry · banana, date · cherry, date.

That matches the formula C(4, 2) = 4! ÷ (2! × 2!) = 24 ÷ 4 = 6, where each ! is a factorial. Length 3 with the same items gives C(4, 3) = 4 rows. Ticking "Allow repetition" at length 2 gives 10 rows, because the four doubled pairs are added.

Grid of apple, banana, cherry and date against each other. The 6 cells above the diagonal are the combinations of two; the 4 diagonal cells are the repeated pairs, making 10 with repetition.
Above the diagonal: each pair once. The diagonal adds the repeats. Below it: the same pairs in the other order, which a combination does not count again.

How many combinations to expect

Without repetition the count is the binomial coefficient n! ÷ (k! × (n − k)!), the number NIST lists in its table of binomial coefficients. With repetition it is (n + k − 1)! ÷ (k! × (n − 1)!).

ItemsGroup sizeWithout repetitionWith repetition
42610
43420
521015
632056
103120220

When the group is longer than the list

Without repetition the tool blocks a length greater than the number of items, since 5 different items cannot come from a list of 4. With repetition there is no such limit, because items can repeat to fill any length.

Uses for a full list of combinations

People use the list to plan team pairings, try two-ingredient menu pairs or build small sample spaces for probability homework. For the chance of one particular group, divide 1 by the count from the combination calculator.

Past a couple of dozen items the list grows fast: 20 items in groups of 10 give 184,756 rows. More counting and data tools are on the statistics calculators page.

All Possible Combinations Generator: FAQ

How many combinations are there of 4 items taken 2 at a time?

6. The formula is n! ÷ (k! × (n − k)!) = 24 ÷ (2 × 2) = 6. With repetition allowed there are 10, because the four pairs such as apple, apple are added.

Does the generator list permutations?

No. Both modes list combinations, where order does not matter, so apple, banana appears once and banana, apple does not. To count ordered arrangements, use the permutation and combination calculator.

How many combinations can it list?

It writes out every one, so long lists get slow. 20 items taken 10 at a time already give 184,756 rows.

Sources