Free Permutation and Combination Calculator

This Permutation and Combination Calculator (also referred to as an nPr Calculator and nCr Calculator) provides a simple way to compute the number of possible permutations (ordered arrangements) and combinations (unordered selections) for any given set of objects. As a counting calculator and arrangements calculator, it implements the standard permutation formula and combination formula, making it ideal for probability calculations, scheduling tasks, or any problem that requires counting distinct outcomes.

Understanding Permutations and Combinations

A permutation counts the number of ways a subset of items can be arranged when order is important. For instance, the sequences ABC and BCA are considered two different permutations because the order of letters differs. Permutations are commonly used in situations that involve rankings, codes, or sequential assignments (e.g., assigning gold, silver, and bronze medals).

A combination, on the other hand, counts the number of ways to select a subset without regard to order. Here, ABC and BCA represent the same combination because they contain the same three letters. Combinations appear in contexts like drawing lottery numbers, forming committees, or selecting a group of winners where the order does not matter.

Both metrics are fundamental in combinatorics and probability. Understanding when to apply each is crucial for correctly interpreting results.

Calculating Permutations and Combinations: Step‑by‑Step

Both formulas rely on the factorial operation, where $n!$ denotes the product of all positive integers from 1 to $n$. By definition, $0! = 1$.

Permutation Formula

The number of permutations of $n$ distinct objects taken $r$ at a time is:

$$P(n, r) = \dfrac{n!}{(n - r)!}$$

Example: Suppose you have 6 items ($n = 6$) and you want to form ordered sequences of size 3 ($r = 3$).

1. Identify the total number of objects: $n = 6$.
2. Determine the sample size: $r = 3$.
3. Substitute into the formula:

$$P(6, 3) = \dfrac{6!}{(6-3)!} = \dfrac{6!}{3!} = \dfrac{720}{6} = 120$$

Thus, there are 120 distinct ordered arrangements.

Combination Formula

The number of combinations of $n$ objects taken $r$ at a time is:

$$C(n, r) = \dfrac{n!}{r! \, (n - r)!}$$

Example: You have 7 items ($n = 7$) and wish to select groups of 4 ($r = 4$), with order irrelevant.

1. Total objects: $n = 7$.
2. Sample size: $r = 4$.
3. Apply the formula:

$$C(7, 4) = \dfrac{7!}{4! \, (7-4)!} = \dfrac{7!}{4! \cdot 3!} = \dfrac{5040}{24 \times 6} = \dfrac{5040}{144} = 35$$

So there are 35 different groups of 4 that can be chosen.

Key Differences Between Permutation and Combination

Aspect	Permutation (nPr)	Combination (nCr)
Order significance	Order matters – different sequences count separately	Order does not matter – different sequences count as the same
Formula	$P(n,r) = \dfrac{n!}{(n-r)!}$	$C(n,r) = \dfrac{n!}{r!(n-r)!}$
Typical applications	Arranging items in a line, setting passwords, assigning roles	Selecting members for a committee, lottery draws, hand of cards
Value relation	Always greater than or equal to the corresponding combination for same $n$ and $r$	Smaller or equal

When you encounter a problem that involves picking items, ask yourself: “Does the order of selection affect the outcome?” If yes, use the nPr calculation; if no, use the nCr calculation.

This calculator not only returns the final count but can also illustrate the step‑by‑step reasoning behind each computation. Whether you are a student studying combinatorics or a professional dealing with probability, the Permutation Calculator and Combination Calculator functionality saves time and reduces errors.

All results are positive integers for any valid input where $n \ge r \ge 0$. The tool also handles large numbers efficiently, making it suitable for real‑world scenarios.