Skip to main content

Permutation Combination Calculator

Use this Permutation Combination Calculator to quickly find ordered arrangements and unordered selections with simple steps, formulas, and examples.

Permutation & Combination Calculator

Calculate nPr and nCr - arrangements and selections

Enter Values

Total items in the set

Number of items to select/arrange

A Permutation Combination Calculator helps you count how many outcomes are possible when you choose items from a set. It is useful for students, teachers, exam prep, probability problems, statistics work, and everyday counting tasks. You enter the total number of items and the number you want to choose, and the tool returns the correct result based on whether order matters. This saves time and helps prevent mistakes with large factorial values. It is especially helpful when you need a fast answer but still want to understand the logic behind the result.

How to Use This Calculator

  1. Enter the total number of available items as n.
  2. Enter how many items you want to select or arrange as r.
  3. Decide whether the order of the chosen items matters.
  4. Use the permutation option when different orders count as different results.
  5. Use the combination option when only the group matters and order does not change the result.
  6. Click calculate to see the answer instantly.
  7. Review the output and compare it with your problem to confirm you picked the correct method.

In simple terms, the tool asks one main question: are you arranging items, or are you only choosing them? That single choice changes the result completely.

What This Calculator Measures

This calculator measures the number of possible outcomes when you take some items from a larger set. It usually returns one of two values: a permutation result or a combination result. A permutation is the count of possible arrangements. In a permutation, the order matters. If the same items appear in a different order, that counts as a different outcome. For example, ABC and BAC are not the same arrangement. A combination is the count of possible selections. In a combination, the order does not matter. If the same items are chosen, changing their order does not create a new result. For example, choosing A and B is the same as choosing B and A. The calculator also depends on factorials, which are repeated multiplications of whole numbers. Factorials grow very quickly, so using a tool is much easier than doing the full calculation by hand for larger values. This makes the calculator useful for: seating or ranking problems; team or committee selection; lottery-style counting; probability and statistics questions; classroom practice and test preparation.

Formula or Logic (Easy Explanation)

The calculator uses two common counting rules. One is for ordered outcomes, and one is for unordered outcomes. For permutations, the logic is: start with the total number of choices for the first position, then fewer choices for the next position, and keep going until you fill all required positions. That is why the permutation formula uses factorials and removes the unused part at the end. The standard form is nPr = n! / (n − r)!. For combinations, the logic starts with permutations, then removes duplicate counts caused by different orders of the same chosen group. Since the same set can be arranged in many ways, the calculator divides by the number of ways those selected items can be rearranged. The standard form is nCr = n! / (r! × (n − r)!). You do not need to memorize every step to use the tool well. Just remember: Use permutation when position matters; Use combination when the position does not matter. That one idea solves most confusion. In real use, many wrong answers happen not because the math is hard, but because the wrong method was chosen first.

Example Calculations

Example 1: Ranking winners – Suppose 5 people are competing, and you want to know how many ways 3 winning positions can be assigned. Input: n = 5, r = 3. Since 1st, 2nd, and 3rd place are different positions, order matters. Use permutation. Result: 5P3 = 5 × 4 × 3 = 60. This means there are 60 different ordered ways to assign the three places.

Example 2: Choosing a committee – Suppose you need to pick 3 people from a group of 5. Input: n = 5, r = 3. Order does not matter because the committee is just a group. Use combination. Result: 5C3 = 10. This means there are 10 different groups of 3 people.

Example 3: Picking 2 letters from A, B, C, D – Input: n = 4, r = 2. If order matters: 4P2 = 4 × 3 = 12. If order does not matter: 4C2 = 6. This shows why permutation results are often larger. The same pair gets counted more than once when order is included.

Understanding Your Results

The final number tells you how many valid outcomes are possible for the exact conditions you entered. It does not show probability by itself. It only shows the count of possible arrangements or selections. That count can then be used in a larger probability or statistics problem. If your result comes from a permutation, the number represents distinct ordered outcomes. This is common in ranking, scheduling, codes, and seat placement. If your result comes from a combination, the number represents distinct groups without regard to order. This is common in team selection, survey sampling, and committee building. A larger number usually means there are more possible ways the event can happen. One practical tip: if you compare the same n and r, the combination result will usually be smaller than the permutation result because repeated orderings are removed in combinations. If the tool gives an error, check whether r is greater than n. In most standard no-repetition problems, you cannot choose more items than the total available set.

Common Mistakes to Avoid

  • Using permutation when order does not matter
  • Using a combination when ranking or position matters
  • Entering a sample size larger than the total set
  • Forgetting that factorial values grow very fast
  • Treating the same group in a new order as a new combination
  • Misreading words like “arrange,” “select,” “rank,” or “choose”
  • Ignoring whether repetition is allowed in the original problem
  • Checking the math but not checking the method

A Permutation Combination Calculator makes counting problems faster, clearer, and easier to check. It helps you choose the right method, avoid common mistakes, and handle factorial-based calculations without stress. Once you understand the basic rule about order, most problems become much simpler. Try the calculator above to see your results.

Frequently Asked Questions

A permutation counts ordered results. A combination counts unordered results. The difference is whether order changes the outcome.
Use a permutation when positions matter, such as rankings, seat order, or arranged codes.
Use a combination when you only care which items were chosen, not their order.
Yes. It helps count outcomes, which is often a key part of probability.
n is the total number of available items in the full set.
r is the number of items you want to choose or arrange.
A factorial means multiplying a whole number by all smaller whole numbers down to 1.
Because permutations count different orders separately, while combinations merge those repeats into one group.
Not in standard no-repetition permutation and combination problems.
Because factorials become extremely large very quickly, which makes manual work slow and error-prone.
Yes. It is very helpful for homework, revision, and checking answers.
Yes. It is useful for explaining counting methods with clear examples.
No. If the same items are selected, the order does not create a new combination.
Yes. The idea behind permutations is arrangement, sequence, or position.
Yes. Many lottery problems use combinations because the selected numbers are usually treated as a set.
Yes. Seating order is a classic permutation use case because position matters.
No. It is also useful in statistics, data analysis, coding logic, and planning scenarios.
Make sure you entered the correct values and selected the correct method based on whether order matters.
Then you need to confirm whether repetition is allowed, because that changes the counting method. Some tools support repetition, and some do not.
Ask yourself: "Would changing the order create a different result?" If yes, use permutation. If no, use combination.