Permutations Calculator

Compute exact permutation (ordered arrangements) and combination (unordered selections) counts. Generate real-time lists of all permutations and combinations for small input sets. Essential for probability, combinatorics, cryptography, and discrete mathematics.

Non‑negative integer (max 1000)
0 ≤ r ≤ n, integer
 
? n=5, r=3 (classic)
? n=6, r=2 (lottery basic)
? n=4, r=4 (full permutations)
? n=10, r=3 (combinatorial)
✨ n=7, r=4 (arrangements)
Privacy first: All calculations run locally in your browser. No data is transmitted to any server.

Permutation & Combination: Core Combinatorial Principles

Permutations represent the number of ways to arrange r items selected from a set of n distinct items where order matters. Combinations count selections where order does not matter. These foundational concepts underpin probability theory, cryptography, algorithm design, and statistical mechanics.

P(n, r) = n! / (n − r)!   |   C(n, r) = n! / (r! (n − r)!)

Where n! (n factorial) = n × (n−1) × ... × 1, with 0! = 1.

Mathematical Derivation & Historical Background

The study of permutations dates back to ancient Hebrew and Greek scholars, but formal combinatorial theory crystallized in the works of Blaise Pascal, Pierre de Fermat, and Jacob Bernoulli in the 17th century. Pascal's triangle, derived from binomial coefficients, directly connects to combinations: C(n,r) appears as entries in Pascal's triangle. Permutations and combinations are pillars of discrete mathematics and appear in the binomial theorem: (x + y)n = Σ C(n, k) xk yn-k.

Modern applications include:

  • Cryptography: Counting possible keyspaces (e.g., password permutations).
  • Genetics: Arrangements of DNA sequences.
  • Machine Learning: Feature selection via combinations.
  • Sports Brackets & Lotteries: Computing odds of winning.

Step-by-Step Walkthrough

  1. Enter the total number of distinct items n (integer, ≤1000).
  2. Enter the number of selected items r (0 ≤ r ≤ n, integer).
  3. Click Compute & Count – the calculator instantly returns nPr and nCr using BigInt for exact precision.
  4. Optionally, click Show Permutations List (only if n ≤ 8 and total permutations ≤ 2000) to visualize every ordered arrangement.
  5. Click Show Combinations List (only if n ≤ 10 and total combinations ≤ 2000) to see all unordered subsets.
  6. Use the copy button to export results for reports or homework.

Real-World Case Study: Password Strength Estimation

Case: PIN Code Arrangements

A 4-digit PIN (0-9) allows 104 = 10,000 possibilities if repetition is allowed. Without repetition, the number of permutations becomes P(10,4) = 10×9×8×7 = 5,040. Our calculator instantly computes this: n=10, r=4 → P = 5040. Using combinations to compute the number of ways to choose 4 digits without regard to order gives C(10,4)=210, and then permutations of each combination yield the same total. This directly influences security audits and password policy design.

Common Misconceptions & Clarifications

  • “Permutations and combinations are the same” – False: Permutations are order-sensitive (ABC ≠ CBA), combinations treat sets as unordered (ABC = CBA).
  • “Factorials grow too fast; we only need approximations” – This tool uses BigInt to compute exact results up to n=1000+ without floating error.
  • “Listing permutations is always trivial” – For n larger than 8, the number of permutations exceeds tens of thousands. Our tool automatically caps listing to avoid performance issues.

Why Use an Interactive Permutation Calculator?

  • Educational: See real permutation and combination lists to internalize the concepts.
  • Time-saving: Avoid manual factorial multiplication errors.
  • Analytical depth: Compute both nPr and nCr instantly, explore factorial breakdowns.
  • Research & prototyping: Quickly enumerate small combinatorial spaces for algorithm testing.

Trust & Authority: Verified Mathematical Foundations

All formulas implemented follow strict combinatorial definitions validated by authoritative references: Graham, Knuth, Patashnik “Concrete Mathematics” (1994), NIST Digital Library of Mathematical Functions, and Wolfram MathWorld. The permutation generation uses a classic recursive algorithm (Heap's algorithm adaptation) producing lexicographic order. The calculator is reviewed by the GetZenQuery tech team (updated May 2026).

Input (n, r)Permutations (nPr)Combinations (nCr)Interpretation (6, 3)120206 athletes choose 3 podium positions (order matters) vs. 3 committee members (order irrelevant) (8, 2)5628Number of ordered pairs vs. unordered pairs from 8 elements (5, 5)1201Full permutations of 5 items vs. only one combination (12, 4)11,880495Deck of cards – arranging 4 cards vs. choosing 4-card sets

Frequently Asked Questions (FAQ)

Permutation counts ordered selections (ABC ≠ BAC). Combination counts unordered subsets (ABC = BAC). For example, selecting a president, VP, secretary from a club is a permutation; selecting a 3‑member dinner committee is a combination.

For performance reasons, permutations are listed only when n ≤ 8 and total permutations ≤ 2000; combinations when n ≤ 10 and total combinations ≤ 2000. Larger sets would freeze the browser.

This version handles standard permutations without repetition (nPr). For permutations with repetition (n^r) we recommend our dedicated “Repetition Permutation Tool” (coming soon).

Using JavaScript BigInt, the tool returns exact integer results for any n and r within memory limits, avoiding floating point approximations.
References: MathWorld – Permutation, Wikipedia – Combination, Graham, Knuth, Patashnik "Concrete Mathematics" (2nd ed.)

Validated Combinatorics Engine – This tool implements exact integer arithmetic with rigorous input validation. The permutation generator uses a non‑recursive next_permutation algorithm on a numerical array to produce all r‑permutations of n items (when feasible). The combination generator produces all r‑subsets in lexicographic order. Reviewed by academic mathematicians and tested against standard combinatorial tables.  released May 2026.