CALCULATORby General Informatics

Permutation and combination calculator

Count combinations and ordered permutations of distinct items without replacement.

Inputs

Result

Permutation and combination calculator
—
—
—

Formula and method

Count combinations and ordered permutations of distinct items without replacement.

C(n,k)=n!/(k!(n−k)!); P(n,k)=n!/(n−k)!.

Worked example

Selecting 3 out of 10 yields 120 combinations or 720 ordered permutations.

Frequently asked questions

How is this calculated?

C(n,k)=n!/(k!(n−k)!); P(n,k)=n!/(n−k)!.

What assumptions apply?

Assumes distinct items and no replacement; results can be very large.

Limitations and notes

Assumes distinct items and no replacement; results can be very large.

Choose language

Deutsch (DE)English (EN)Polski (PL)Español (ES)Français (FR)Italiano (IT)Nederlands (NL)

Legal notice