Permutation & Combination
Calculate square roots, cube roots, and more.
Choose between Permutation (nPr) or Combination (nCr) based on your needs:
Enter the total number of distinct items in your set. This must be a non-negative integer.
Enter the number of items you want to select from the set. This must be a non-negative integer and cannot exceed the total number of items.
Click the "Calculate" button to get your result. The calculator will display the result along with the formula used.
Problem: In how many ways can 3 people be selected from 8 people and arranged in a line?
Solution: This is a permutation problem because the order matters (different arrangements in line).
Problem: In how many ways can a committee of 4 people be formed from 10 people?
Solution: This is a combination problem because the order doesn't matter (just who is on the committee).
No calculations yet. Your history will appear here.
Permutations and combinations are fundamental concepts in combinatorics, a branch of mathematics dealing with counting and arrangement. They help us determine the number of ways to select or arrange objects under specific conditions.
Permutations refer to the number of ways to arrange a set of objects where the order matters. For example, arranging the letters A, B, and C in different orders (ABC, BAC, CBA) counts as different permutations.
Combinations refer to the number of ways to select a subset of objects where the order does not matter. For example, selecting 2 letters from A, B, and C (e.g., AB and BA are the same combination).
The number of permutations of \( n \) distinct objects taken \( r \) at a time is given by:
Where \( n! \) (n factorial) is the product of all positive integers up to \( n \) (e.g., \( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \)).
The number of combinations of \( n \) distinct objects taken \( r \) at a time is given by:
The extra \( r! \) in the denominator accounts for the fact that order does not matter in combinations.
Permutations and combinations are essential tools in mathematics and related fields because they help solve problems involving counting and arrangement efficiently. Here are some key reasons to use them:
By understanding and applying permutations and combinations, you can tackle a wide range of problems with precision, making them invaluable tools in both theoretical and practical contexts.
The key difference is that permutations consider the order of arrangement (e.g., ABC and BAC are different), while combinations do not (e.g., AB and BA are the same). This is why the combination formula includes an extra \( r! \) in the denominator to eliminate duplicate arrangements.
If \( r > n \), the permutation or combination is not possible because you cannot select or arrange more items than are available. Mathematically, the formula will result in a denominator larger than the numerator, yielding zero or an undefined result.
Factorials represent the number of ways to arrange objects. For example, \( n! \) gives the total arrangements of \( n \) distinct objects. In permutations and combinations, factorials help calculate the total possibilities and adjust for constraints like order or selection size.
In probability, they help calculate the total number of possible outcomes. For example, to find the probability of drawing 2 aces from a deck of 52 cards, you use combinations: \( C(4, 2) \) for the favorable outcomes (4 aces, choose 2) and \( C(52, 2) \) for the total outcomes (52 cards, choose 2).