Combinations & Permutations Calculator (nCr & nPr)

A smart tool to solve the question: “can i calculate n using r”. Easily compute combinations and permutations.

Breakdown Table

r Value	Combinations (nCr)	Permutations (nPr)

Table showing how results change for a fixed ‘n’ as ‘r’ increases.

What is “Can I Calculate n using r”?

The question “can I calculate n using r” delves into the mathematical concepts of **Combinations and Permutations**. In this context, ‘n’ represents the total number of distinct items in a set, and ‘r’ represents the number of items you are choosing from that set. This calculator helps you determine the number of possible arrangements or selections based on these two inputs.

The key difference lies in whether the **order** of selection matters. If the order of the chosen items doesn’t matter, you are dealing with a **Combination (nCr)**. If the order is important, it’s a **Permutation (nPr)**. For instance, picking a team of 3 people from 10 is a combination, but awarding 1st, 2nd, and 3rd place prizes to 3 people from 10 is a permutation. You can explore more about this in our guide on Probability Theory.

Formula and Explanation

The Permutation (nPr) Formula

A permutation calculates the number of ways to arrange ‘r’ items from a set of ‘n’ items where order is important.

P(n,r) = n! / (n-r)!

The Combination (nCr) Formula

A combination calculates the number of ways to choose ‘r’ items from a set of ‘n’ items where order does not matter.

C(n,r) = n! / [r! * (n-r)!]

Variables Table

Variable	Meaning	Unit	Typical Range
n	Total number of items in the set.	Unitless Integer	0 or greater
r	Number of items to be chosen/arranged.	Unitless Integer	0 to n
!	Factorial (e.g., 5! = 5*4*3*2*1).	N/A	Applied to non-negative integers.

Practical Examples

Example 1: Combination (Order Doesn’t Matter)

Scenario: A committee of 4 people is to be selected from a group of 15 people. How many different committees can be formed?

• Inputs: n = 15, r = 4
• Units: These are unitless counts.
• Calculation: C(15, 4) = 15! / (4! * (15-4)!) = 1,365
• Result: There are 1,365 possible combinations for the committee.

Example 2: Permutation (Order Matters)

Scenario: In a race with 12 runners, how many different ways can the 1st, 2nd, and 3rd place medals be awarded?

• Inputs: n = 12, r = 3
• Units: These are unitless counts.
• Calculation: P(12, 3) = 12! / (12-3)! = 1,320
• Result: There are 1,320 different permutations for the top three finishers.

How to Use This Calculator

Follow these simple steps to calculate n using r:

1. Select Calculation Type: First, decide if the order of selection matters for your problem. Choose ‘Combinations (nCr)’ if order doesn’t matter, or ‘Permutations (nPr)’ if it does.
2. Enter Total Items (n): In the “Total Number of Items (n)” field, input the size of the entire set you are choosing from.
3. Enter Items to Choose (r): In the “Number of Items to Choose (r)” field, input how many items you are selecting.
4. Review the Results: The calculator will instantly update. The main result is shown in the green box, with intermediate factorial calculations shown below. The chart and table also provide further insights.
5. Interpret the Results: The numbers are unitless and represent the total number of ways your selection or arrangement can be made. For more on how to use these numbers, see our article on Statistical Analysis.

Key Factors That Affect the Result

• The value of ‘n’: As the total number of items increases, the number of possible combinations and permutations grows exponentially.
• The value of ‘r’: The number of outcomes is usually highest when ‘r’ is about half of ‘n’.
• Order (Permutation vs. Combination): For any given n and r (where r > 1), there will always be more permutations than combinations because every unique group of items can be arranged in multiple ways.
• Value of (n-r): When ‘n’ and ‘r’ are very close, the number of combinations is small. For example, choosing 9 items from a set of 10 (C(10,9)) gives only 10 combinations.
• Repetition: This calculator assumes no repetition (you can’t pick the same item twice). If repetition is allowed, the formulas change (n^r for permutations with repetition).
• The factorial function: This function grows extremely quickly, meaning that even moderately large values of ‘n’ can lead to enormous results. Our calculator has limits to prevent browser performance issues. Learn more about Large Number Arithmetic.

Frequently Asked Questions (FAQ)

What is the main difference between combinations and permutations?

The key difference is order. In permutations, the order of selection matters (e.g., a lock combination). In combinations, it does not (e.g., picking lottery numbers).

What happens if r > n?

It is impossible to choose more items than exist in the set. The calculator will return 0, as there are no valid combinations or permutations.

Why are the values unitless?

Combinations and permutations are counts of possibilities or arrangements. They do not have a physical unit like meters or kilograms; they are pure numbers.

Can I calculate n using r if n or r is not an integer?

No. The concepts of combinations and permutations apply to discrete, countable items, so ‘n’ and ‘r’ must be non-negative integers.

What does ‘n!’ (n factorial) mean?

It is the product of all positive integers up to ‘n’. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By definition, 0! = 1.

Why does the result become so large so quickly?

Factorial growth is extremely rapid. The number of ways to arrange items increases very fast with each new item added to the set, a core concept in Discrete Mathematics.

When is nCr equal to nPr?

When r = 0 or r = 1. If you choose 0 or 1 item, the order doesn’t matter, so the number of combinations and permutations is the same.

What is a “combination lock” in mathematical terms?

Ironically, a “combination lock” should be called a “permutation lock” because the order in which you enter the numbers is critical.