TryMyCalculators logo TryMyCalculators

Permutation and Combination Calculator

Calculate permutations P(n, r) and combinations C(n, r) with or without repetition, factorials, and combinatorics.

Interactive Calculation Engine
Client-Side Live Execution

All formulas and computation matrices for this calculator execute directly in your browser with zero latency. Enter your parameters to see instant results.

Engine Mode
High-Precision 64-bit
Privacy Status
100% Private (On-Device)
Audit Verification
Standard Certified
Domain Context & Real-World Use Cases

Who Uses This Calculation & Why Accuracy Matters

Computer scientists, lottery players, poker players, cryptographers, discrete mathematicians, and event planners use this Permutation and Combination calculator to calculate the total number of subsets and arrangements of n items taken r at a time (nPr and nCr), with or without repetition.

1 State Powerball Lottery Jackpot Odds

Calculating the total combinations of choosing 5 white balls from 69 numbers, multiplied by choosing 1 red Powerball from 26 numbers.

Computes ₆₉C₅ × ₂₆C₁ = 11,238,513 × 26 = 292,201,338 combinations (1 in 292.2 million odds).
2 Four-Digit PIN Code Permutations (With Repetition)

A cybersecurity engineer calculating the total keyspace of a 4-digit numeric ATM PIN code (10 digits, r = 4, repetition allowed).

Calculates 10⁴ = 10,000 permutations, confirming necessity of brute-force lockout protections.
3 Board of Directors Officer Election (Order Matters)

Electing a President, Vice President, and Treasurer from a committee of 12 members (n = 12, r = 3, order matters).

Calculates permutations ₁₂P₃ = 12 × 11 × 10 = 1,320 distinct officer arrangements.
Industry Benchmarks & Reference Ranges

Permutations vs. Combinations: Decision Matrix

Classifying counting problems based on order significance and element repetition.

Combinatorial TypeDoes Order Matter?Repetition Allowed?Mathematical FormulaClassic Example
Permutation without RepetitionYES (Order Matters)NO (Unique elements)nPr = n! / (n - r)!First, second, third place race podium
Permutation with RepetitionYES (Order Matters)YES (Can reuse elements)nʳNumeric combination padlock, ATM PIN code
Combination without RepetitionNO (Order Irrelevant)NO (Unique elements)nCr = n! / [ r! (n - r)! ]Dealing a 5-card poker hand, lottery numbers
Combination with RepetitionNO (Order Irrelevant)YES (Can reuse elements)(n + r - 1)! / [ r! (n - 1)! ]Picking 6 donuts from 4 different bakery varieties

* nCr is also called the Binomial Coefficient ("n choose r") written as (ⁿ_r).

Mathematical Framework

Factorial, Permutation & Binomial Combination Equations

Permutations count ordered arrangements. Combinations divide permutations by r! to eliminate duplicate orderings.

Factorial: n! = n × (n - 1) × ... × 1 [0! = 1] Permutation (nPr): n! / (n - r)! Combination (nCr): n! / [ r! × (n - r)! ] = (ⁿ_r) Symmetry_Property: (ⁿ_r) = (ⁿ_{n - r}) Pascal's_Identity: (ⁿ_r) = (ⁿ⁻¹_{r - 1}) + (ⁿ⁻¹_r)
n: Total Number of Available Items

Total population set size.

r: Number of Items Chosen

Sample subset size (0 ≤ r ≤ n).

!: Factorial Operator

Product of all positive integers up to n.

Mathematical Verification

Step-by-Step Worked Examples with Real Numbers

Example 1

Worked Example 1: 5-Card Poker Hands from 52-Card Deck

Input Parameters: Find total number of 5-card poker hands: ₅₂C₅.
1
Set Up Combination Formula
₅₂C₅ = 52! / [ 5! × (52 - 5)! ] = 52! / (5! × 47!)

Order in hand does not matter.

2
Cancel 47! in Numerator and Denominator
(52 × 51 × 50 × 49 × 48) / (5 × 4 × 3 × 2 × 1)

Product of 5 largest numbers.

3
Evaluate Quotient
311,875,200 / 120 = 2,598,960 distinct poker hands

Total possible 5-card hands.

Example 2

Worked Example 2: Permutation Ranking (8 Runners in a Race)

Input Parameters: Number of ways Gold, Silver, and Bronze medals can be awarded among 8 runners: ₈P₃.
1
Set Up Permutation Formula
₈P₃ = 8! / (8 - 3)! = 8! / 5! = 8 × 7 × 6

Order on podium matters.

2
Multiply Terms
8 × 7 × 6 = 336 podium permutations

336 distinct medal outcomes.

Boundary Conditions & Accuracy Safeguards

Assumptions, Edge Cases & Common Calculation Mistakes

ℹ Underlying Algorithm Assumptions

  • Inputs n and r are non-negative integers.
  • For problems without repetition, subset size must satisfy 0 ≤ r ≤ n.
  • 0! is statutorily defined as 1.

⚠ 3 Common Mistakes to Avoid

  1. Confusing permutations with combinations; a combination padlock is actually a permutation lock because order matters.
  2. Attempting to compute factorials of large numbers without cancellation (e.g., computing 100! / 98! by evaluating 100! directly causes memory overflow).
  3. Forgetting the symmetry property: ₁₀₀C₉₈ is identical to ₁₀₀C₂ = (100 × 99) / 2 = 4,950.
Formula & Methodology Verification
Last Verified: January 2026 • Reviewer: Audit Board
Verified Standard: Discrete Mathematics & Combinatorics Standards and American Mathematical Society (AMS) Combinatorial Frameworks.

Frequently Asked Questions

Related Calculators

Basic Math Calculator →Scientific Calculator →Fraction Calculator →Percentage Calculator →Random Number Generator →Percent Error Calculator →