Combination Calculator

Count unordered selections of distinct items without repetition using an exact binomial coefficient.

Order does not matter; no item is selected twice. Enter integers with 0 ≤ r ≤ n ≤ 1,000.

Inputs are processed in this browser and are not uploaded.

Combination Calculator: supported calculation

Count unordered selections of distinct items without repetition using an exact binomial coefficient. Order does not matter; no item is selected twice. Enter integers with 0 ≤ r ≤ n ≤ 1,000.

Enter the inputs

Enter the available count n and selection count r, then choose Calculate. The example button replaces both inputs with five available items and three selected items.

Worked example

Choosing three members from five distinct candidates gives 10 groups. The example uses n = 5 and r = 3. A group containing A, B and C is the same group regardless of listing order.

Formula and assumptions

The formula is nCr = n!/[r!(n − r)!]. Symmetry allows the implementation to use the smaller of r and n − r. Integer multiplication and division preserve the exact result without floating-point rounding.

Unsupported cases and common mistakes

Choosing none or all of the available items gives one selection. This tool does not allow repetition, so it does not count multisets or replacement draws. It also cannot enforce exclusions, quotas or other selection rules.

Limits and result precision

Counts up to 1,000 are accepted. The result is an exact integer, even when it is longer than ordinary numeric display formats can represent. Long answers wrap on screen; Copy results retains every digit. Inputs must be unsigned whole numbers, without commas, decimal points or exponent notation.

Editing any field clears the previous result. Calculate again after a change; Copy results includes the displayed labels and answers.

Use Permutation Calculator to count arrangements where order changes the outcome.