Combinations Calculator (nCr)
Count how many ways r items can be chosen from n items when the order does not matter.

| Property | Value |
|---|
Formula & Notes
- Combinations (order ignored)
C(n, r) = n! / (r! × (n − r)!)- Permutations (order matters)
P(n, r) = n! / (n − r)!
- Both n and r must be whole numbers, with 0 ≤ r ≤ n.
- C(n, r) always equals C(n, n − r), so choosing 3 of 10 has the same count as leaving 7 of 10.
- Results use exact big-integer arithmetic, so very large counts stay precise.
How to use it
- Enter Your Values Input your numbers or parameters into the Combinations Calculator (nCr). Fill in all required fields for an accurate calculation.
- Calculate Results Click the calculate button to process your inputs. The Combinations Calculator (nCr) delivers instant, accurate results.
- Review and Use Review your calculated results, explore the breakdown, and copy or share the output for your needs.
Tip Run the Combinations Calculator (nCr) multiple times with edge-case values to stress-test your assumptions before committing.
Reviews and questions
Whether this tool gave people the answer they needed, and what they asked about it.
Sign in to review this tool.
Sign In to ReviewNo reviews yet
Be the first to say whether this tool gave you what you needed.
Ask how to read the result, or what the tool does with an edge case — or answer someone else.
Sign In to AskNo questions yet
Not sure how to read a result? Be the first to ask.