TaskEaser
Back to home

Math

Combinatorics

C(n,k), P(n,k), and n!

Runs locally in your browser

Parameters

Results

C(n,k)
120
P(n,k)
720
n!
3,628,800

n! is exact up to n=20; above that, scientific notation is used.

How it works

Compute combinations C(n,k), permutations P(n,k), and factorial n!.

Who it's for: Statistics students, lottery analysts, and anyone counting arrangements.

C(n,k) counts unordered selections; P(n,k) counts ordered arrangements.

Requires k ≤ n.

n! is shown exactly up to n = 20, then in scientific notation.

How to use

  1. Enter n (total items) and k (chosen items).
  2. Read C(n,k), P(n,k), and n! in the results.