Permutation Calculator

Count ordered selections of distinct items without repetition using exact integer arithmetic.

Order matters; each item can be selected at most once. Enter integers with 0 ≤ r ≤ n ≤ 1,000.

Inputs are processed in this browser and are not uploaded.

Permutation Calculator: supported calculation

Count ordered selections of distinct items without repetition using exact integer arithmetic. Order matters; each item can be selected at most once. Enter integers with 0 ≤ r ≤ n ≤ 1,000.

Enter the inputs

Enter the available count n and selection count r, then choose Calculate. The example button replaces both inputs with five available items and three selected items.

Worked example

Choosing first, second and third place from five distinct entries gives 5 × 4 × 3 = 60 ordered outcomes. The example uses n = 5 and r = 3.

Formula and assumptions

The formula is nPr = n!/(n − r)!. The implementation multiplies only the r required factors using exact integers. Selecting zero items gives one empty arrangement, including n = 0, r = 0.

Unsupported cases and common mistakes

This calculation assumes distinct items and selection without repetition. It does not count arrangements of repeated letters, circular arrangements, selections with replacement or constrained schedules. For example, ABC and BAC count separately here.

Limits and result precision

Counts up to 1,000 are accepted. The result is an exact integer, even when it is longer than ordinary numeric display formats can represent. Long answers wrap on screen; Copy results retains every digit. Inputs must be unsigned whole numbers, without commas, decimal points or exponent notation.

Editing any field clears the previous result. Calculate again after a change; Copy results includes the displayed labels and answers.

Use Combination Calculator to count the corresponding groups when order is irrelevant.