Combination calculator

Calculate combinations without repetition using n choose k. Select k items from n when order does not matter, with exact results for up to 1,000 items.

Your inputs stay herePUFFINMINT

Set your data

Set your data

Count selections without order or repetition. Integers with 0 ≤ k ≤ n ≤ 1000. n=10 and k=3 gives 120; k=0 gives 1. Exact integer result.

Result

Enter your data and run the tool. Your result will appear here.

The values you enter stay on this page. Reloading or closing it clears them.

We count which tools are used most, without including entered values or file contents in the statistics. Privacy

How to use the tool

  1. Fill in these fields: Total items n (0–1000), Selected items k.
  2. Select “Calculate” to obtain the result.
  3. Count selections without order or repetition.
  4. Integers with 0 ≤ k ≤ n ≤ 1000.
  5. n=10 and k=3 gives 120; k=0 gives 1.
  6. Exact integer result.
  7. Compare choosing what to keep with choosing what to leave out.
  8. One possible selection, with the chosen items highlighted.

Method and principles

Formula

C(n,k)= n !k !× ( n − k ) !

Example and interpretation

Combinations count selections where order does not change the group and each item can appear only once. Choosing 2 people from 5 gives 10 pairs: Anna and Luca form the same pair as Luca and Anna. If order matters, use a different model rather than applying this result to arrangements or sequences.

Practical example

Input
  • Total items n (0–1000): 10
  • Selected items k: 3
Result
10 × 9 × 8 3 × 2 × 1 = 120

Calculation steps

  1. Substitute the example values into the formula.

    C(n,k)= 10 !3 !× ( 10 − 3 ) !

Limits and checks

Limits and checks
ParameterValue
Total items n (0–1000)≥ 0; ≤ 1000
Selected items k≥ 0; ≤ 1000

Favorites