Permutation and Combination Calculator

Calculator for permutation and combination problems in probability and statistics.

How to Use the Permutation and Combination Calculator

Enter total items n and selected items r to compute permutations and combinations for counting problems.

Formula: Permutation nPr = n!/(n-r)!; Combination nCr = n!/(r!(n-r)!).

Order Sensitivity

Core difference is whether arrangement order affects outcome count.

Factorial Mechanics

Both formulas rely on factorial cancellation structure.

Probability Integration

Counting outcomes is foundational for event probability models.

Constraint Checking

Valid n and r constraints prevent undefined calculations.

Scalability Limits

Large combinatoric counts require high-precision arithmetic in advanced cases.

Frequently Asked Questions

What is permutation?+

Permutation counts ordered arrangements of selected items.

What is combination?+

Combination counts unordered selections.

How to choose between nPr and nCr?+

If order matters use permutation; otherwise use combination.

Can r be greater than n?+

No, valid selection size cannot exceed total items.

Why factorial grows quickly?+

Factorial multiplies descending integers and scales superlinearly.

Can large n overflow?+

Yes, very large factorial values can exceed standard numeric bounds.

Where are these used?+

Used in probability, cryptography, scheduling, and combinatorics.

Can repeated elements change formulas?+

Yes, multiset and repeated-choice variants use different formulas.

Is this same as binomial coefficient?+

Combination nCr is the binomial coefficient.

Can zero selection be valid?+

Yes, nC0 equals 1 by convention.

💡 Did you know?

NumerixHub has over 200 free calculators across finance, health, math, and utility categories. All are free to use with no registration required.

Browse all calculators →