Calculate Permutations on a Calculator

To calculate permutations, enter the total number of items, n, and the number of positions to fill, r; the calculator returns nPr, the number of ordered arrangements. For example, choosing and ranking three people from eight gives 336 possible outcomes.

Formula

The permutation formula for choosing and ordering r distinct items from n distinct items, without replacement, is:

nPr = n! / (n − r)!

• n is the total number of available items; it is a count, with no physical unit.
• r is the number of positions filled; it is also a count.
• ! means factorial: n! = n × (n − 1) × … × 2 × 1, and 0! = 1.

The calculator also displays combinations for comparison. Their formula is nCr = n! / (r! × (n − r)!). Combinations count selections where order does not matter; permutations count arrangements where it does. Both outputs are counts of possible outcomes.

Worked Example

With the calculator defaults, n = 8 and r = 3. The total number of ordered arrangements is:

1. Use nPr = n! / (n − r)!.
2. Substitute the values: 8P3 = 8! / (8 − 3)! = 8! / 5!.
3. Cancel 5!: 8 × 7 × 6 = 336 permutations.

If order does not matter, the corresponding combination count is 8C3 = 8! / (3! × 5!) = (8 × 7 × 6) / (3 × 2 × 1) = 56 combinations. Thus, the calculator returns 336 for permutations and 56 for combinations with these same default inputs.

How to Calculate Permutations on a Calculator

Many scientific calculators have an nPr function, often accessed through a probability menu or a secondary key. The exact button sequence varies by model, so check its key labels or manual. The usual entry is n, then nPr, then r, followed by the equals key. For 8P3, enter 8, choose nPr, enter 3, and evaluate; the result is 336.

If your calculator has no nPr key, apply the factorial formula. You can reduce the work by multiplying only the r descending factors beginning with n:

• For 8P3, calculate 8 × 7 × 6.
• For 10P4, calculate 10 × 9 × 8 × 7 = 5,040.
• For nP0, the result is 1: there is exactly one way to select and arrange nothing.

For large values, direct multiplication is often more manageable than calculating two large factorials and dividing. Factorials grow quickly, and some calculators cannot display very large exact integers.

When to Use Permutations

Use a permutation when each different order represents a different outcome. This applies to arranging objects, filling distinct roles, or assigning ranked positions, provided the items are distinct and cannot be reused.

For example, if five finalists compete for first, second, and third place, the number of possible ordered podiums is 5P3 = 5 × 4 × 3 = 60. A podium with Alice first and Ben second is different from one with Ben first and Alice second. If instead the question is simply how many groups of three finalists can be selected, order does not matter, so use combinations: 5C3 = 10.

A quick test is to ask whether swapping two selected items makes a new outcome. If yes, use permutations; if no, use combinations. When selecting all n items, nPn = n!, because every arrangement of the full set counts.

Common Mistakes and Limits

• Using the wrong function: nPr and nCr answer different questions. A selection can have several arrangements, which is why nPr is larger when 0 < r < n.
• Entering r greater than n: this is not a valid selection without replacement. The standard permutation formula requires 0 ≤ r ≤ n.
• Counting repeated items as distinct: the formula assumes all n items are distinguishable. If some items are identical, treating each copy as unique overcounts arrangements.
• Allowing reuse unintentionally: nPr assumes an item cannot be selected again. If each of r positions can independently use any of n items and repetition is allowed, the count is n^r instead.
• Rounding or display limits: permutation counts are whole numbers. A calculator may show a large result in scientific notation or round it when its display capacity is exceeded; do not mistake that display for an exact integer.

The calculator covers the standard case: a finite set of distinct items, ordered selections, and no replacement. It does not automatically account for identical items, restrictions on which items may occupy certain positions, or other special rules; those require a modified count.

Frequently Asked Questions

How do I find the nPr button on my calculator?
Look for nPr on a key, as a secondary function, or inside a probability or counting menu. Button locations differ by model. If the function is unavailable, calculate n × (n − 1) × … for r factors.

What is the difference between nPr and nCr?
nPr counts ordered arrangements, while nCr counts unordered selections. For instance, 8P3 is 336, but 8C3 is 56 because each group of three can be arranged in 3! = 6 orders.

Can r be greater than n?
Not for a standard permutation without replacement: you cannot fill more positions with distinct items than are available. If reuse is allowed, use a different model; with n choices independently available in each of r positions, the count is n^r.

What is 0! and why is nP0 equal to 1?
By convention, 0! = 1. There is one way to make an empty arrangement: choose nothing and place nothing. Substituting r = 0 in the formula gives n! / n! = 1.

Do permutations allow repeated items?
The standard nPr formula assumes no item is selected more than once. If repeats are allowed, the answer depends on the rules; when every position can be any of n choices, including repeats, there are n^r ordered sequences.

Related

• Calculate Equation: Formula, Steps, and Examples
• Calculate Ellipse Area, Perimeter, and Dimensions
• Differential Equations Calculator: Solve and Understand

in n | Total items (n) | - | 8 | 0
in r | Positions filled (r) | - | 3 | 0
out permutations | Permutations (nPr) | ways | npr(n,r) | 0
out combinations | Combinations (nCr) | ways | ncr(n,r) | 0