Permutations and combinations

Compute nPr, nCr, and combinations with repetition (nHr) as exact integers — no rounding, even for huge answers.

Count

Calculated in this browser with exact integer math. Nothing is sent anywhere.

n and k are whole numbers up to 5,000. For nPr and nCr, k cannot exceed n. nHr lets k exceed n. Results are exact integers — large answers may run to thousands of digits.

How to use

  1. Pick the count: nPr, nCr, or nHr.
  2. Enter n (total items) and k (how many you choose).
  3. Read the exact result and copy it.

What it supports

n and k are whole numbers up to 5,000. For nPr and nCr, k cannot exceed n; nHr allows it. Results are exact BigInt values — C(5000, 2500) prints all ~1,500 digits.

Related tools

Related guides