Skip to content
Loading the tool…

Combination
calculator

Count unordered groups from
distinct items, without repeats.

Find the exact number of groups.

Possible groups

56

C(8, 3)

One example group: 1, 2, 3

One group shown; 56 possible groups.

How it works

1

Count distinct items

Start with n different
items.

2

Choose the group size

Pick a group size r,
with 0 ≤ r ≤ n.

3

Read the exact total

The number of unordered
groups is C(n, r).

Worked example

C(8, 3) = (8 ×7 ×6) / (3 ×2 ×1) = 56

Questions, Answered.

Why does choosing zero items give one group?

There is one empty selection, so C(n,0)=1, including C(0,0)=1.

How are combinations different from permutations?

Combinations ignore order. The same three items in a different order still form one group. Permutations count different arrangements.

Do large counts lose precision?

No. The calculation uses exact integers for0 ≤ r ≤ n ≤ 1000. Copy or download the complete result.

Does the picture show every possible group?

No. It is one labeled example, not a complete enumeration. Large pools show only their first eight items schematically.

THE PICNIC MENU CHALLENGE

Three sides. Your choice.

Pick a menu that fits both rules, then invite a
friend to make their own.

Build a valid combo →