Permutation and Combination Calculator

Count ordered and unordered selections of r items from n distinct items without repetition.

Your workspace

Server processing

Review the example values, then run the tool.

This tool calculates the number of ways to select r items from a set of n distinct items, providing both ordered permutations and unordered combinations.

How to calculate selections

  1. Enter the total number of distinct items in the 'n' field.
  2. Enter the number of items to be selected in the 'r' field.
  3. Review the calculated values for both permutations (ordered) and combinations (unordered) in the results.

Understanding the calculations

Permutations count the number of ways to select and arrange items where the order of selection matters. Combinations count the number of ways to select items where the order does not matter.

The tool processes these values based on standard mathematical formulas for n distinct items without repetition.

Data limits and processing

The calculator supports values for n and r up to 1000. Because these calculations can result in extremely large numbers, ensure your inputs remain within the supported range to receive a valid numeric output.

All calculations are performed on the server. Results are temporary and expire after 15 minutes, so please save any data you need to retain.

Example calculation

n = 10, r = 3

Permutations: 720, Combinations: 120

Common questions

What is the difference between permutations and combinations?

Permutations account for the order of the selected items, while combinations treat the selection as a group where order is irrelevant.

Can I use this for selections with repetition?

No, this tool is designed specifically for selections without repetition where each item is distinct.

Continue your workflow