Combination Calculator
Type the total items n and how many you pick r, then Calculate. You get both the combination count C(n,r) and the permutation count P(n,r) for classroom, lottery-style, and sampling problems.
Enter n and r, then click Calculate.
About this tool
Combinations ignore order using C(n,r)=n!/(r!(n-r)!). Permutations keep order with P(n,r)=n!/(n-r)!. Values are computed with integer BigInt steps so modest n stays exact. Non-integers, negatives, or r>n produce an error.
How to use
- Open the calculator: Load the page with fields for n and r.
- Enter n: Type the total number of items available.
- Enter r: Type how many items you select.
- Calculate both counts: Click Calculate and read C(n,r) and P(n,r) in the result.
Common use cases
- Check textbook answers for C(n,r) homework without a graphing calculator.
- Count unordered teams of r people from a class of n.
- Compare how order changes the count when seating r guests from n.
- Sanity-check lottery-style “choose r from n” odds numerators.
Tips
- r cannot exceed n; that case returns an error instead of zero-by-guess.
- Use whole numbers only—decimals and negatives are rejected.
FAQ
What is the difference between C and P?
C ignores order; P treats different orders as distinct.
Can r be larger than n?
No. That input is rejected with an error message.
Are results exact?
Yes for whole-number inputs; BigInt avoids floating rounding.
What about n equals r?
C(n,n) is 1 and P(n,n) is n!.