Permutation & Combination Calculator


Count ordered selections, unordered selections, circular arrangements or linear arrangements with identical items. Useful for combinatorics and probability sample-space counts.

Each field is labelled with its meaning. Use consistent units within one calculation. Results are rounded for display.

Choose a mode, enter values and calculate. Use decimal points; lists accept commas or spaces.

Choose or arrange r of n

Insira os valores:
Resultados:

Formula and method

Without repetition: nPr=n!/(n-r)!, nCr=n!/[r!(n-r)!]. With repetition: ordered=n^r; unordered=C(n+r-1,r). Circular arrangements of n distinct items up to rotation=(n-1)!. Identical-group arrangements=n!/Π(gi!).

Worked example

Selecting 2 of 5 distinct items gives 5P2=20 ordered choices and 5C2=10 unordered choices. Five items in identical groups of sizes 2 and 3 have 5!/(2!3!)=10 arrangements.

Read the result

Order matters for permutations, not combinations. Circular mode arranges all n distinct items, not just r of them. Identical-group mode is linear, not circular.

Limits and edge cases

n and r are whole numbers from 0 to 1000. Without repetition r≤n. Circular mode requires n≥1 and treats reflections as different. Group sizes must be positive integers summing to n. Exact integer output can be very long.

Frequently asked questions

Are mirror images the same in circular mode?

No. Rotations are identified, but reflections are counted separately.

How many ways are there to select nothing?

One empty selection. This convention gives nP0=nC0=1, including n=0.