Permutation Calculator
P(n, k) = n! / (n − k)! for ordered selections. n at most 170 on this page.
Rated 4.7 out of 5 based on 340 reviews
How to use Permutation Calculator
- Enter n, k. Leave a field blank only when the page says the value is missing.
- Read the result rows under the form. Errors appear in the status line. Nothing is uploaded.
- Rounding follows IEEE floating point in this browser unless the page says it uses integers or BigInt.
Permutation Calculator
P(n, k)
| Computes | P(n, k) = n! / (n − k)! for ordered selections. n at most 170 on this page. |
|---|---|
| Includes | P(n, k) |
| Includes | n at most 170 |
| Engine | percentage |
| Upload | None |
| Advice | Arithmetic only |
What Permutation Calculator is
Permutations count ordered tuples. P(10, 3) = 10 × 9 × 8 = 720. k cannot exceed n. Unordered selections are combinations.
The formula runs in this tab. CZNull does not receive the numbers.
How this page computes
Factorial alone is the factorial page. Results are integers in IEEE range up to 170!.
Entities and related jobs
P(n, k) = n! / (n − k)! for ordered selections. n at most 170 on this page. Named features: P(n, k), n at most 170.
See also Combination Calculator, Factorial Calculator, Prime Checker, Percentage Calculator, Scientific Calculator, Fraction Calculator.
Use cases
PINs, race finishing orders, and password length counting when order matters and repeats are not allowed.
Limits
Invalid input appears in the status line. IEEE floating point applies unless a row says otherwise. CZNull does not receive the numbers.