Solvezi.com
Home
Tools
Blog
About
Contact
  1. Home
  2. Statistics
  3. Permutation and Combination Calculator

Permutation and Combination Calculator

Calculate permutations and combinations to solve counting and probability problems accurately.

Related Tools

More in Statistics

Standard Deviation CalculatorNumber Sequence CalculatorSample Size CalculatorProbability CalculatorStatistics CalculatorMean, Median, Mode, Range CalculatorZ-score CalculatorConfidence Interval CalculatorLinear Regression CalculatorCorrelation Coefficient CalculatorChi-Square CalculatorT-Test CalculatorANOVA CalculatorQuartile CalculatorInterquartile Range (IQR) CalculatorOutlier DetectorBox Plot GeneratorHistogram GeneratorNormal Distribution CalculatorBinomial Distribution CalculatorPoisson Distribution CalculatorVariance & Standard Deviation CalculatorCoefficient of Variation CalculatorStandard Error CalculatorMargin of Error CalculatorP-Value Calculator
Explore Other Categories

Share

https://www.solvezi.com/statistics/permutation-combination-calculator

Solvezi.com

Solve Easy
Privacy PolicyTerms
© 2026 Solvezi.com. All rights reserved.

Permutation & Combination Calculator

Calculate arrangements and selections with ease

Enter Values

Order matters in permutations

Permutation & Combination Guide

Permutations and combinations are fundamental counting techniques in combinatorics. They help answer questions about arrangements and selections in mathematics, computer science, statistics, and everyday life.

Permutation
Combination
Factorial
Order Factor

Fundamental Concepts

Permutation (P)

Arrangements where ORDER MATTERS

P(n,r) = n! / (n−r)!
Key Example:
ABC, ACB, BAC, BCA, CAB, CBA are different
Common Use Cases:
Passwords & PINsRace rankingsSeating arrangements

Switching positions creates a different outcome

Combination (C)

Selections where ORDER DOESN'T MATTER

C(n,r) = n! / (r! × (n−r)!)
Key Example:
ABC = ACB = BAC (same selection)
Common Use Cases:
Committee selectionLottery numbersPizza toppings

Only who/what is chosen matters, not the order

Key Differences

AspectPermutationCombination
Order Importance
CRITICAL (ABC ≠ CBA)
IRRELEVANT (ABC = CBA)
Formula Relationship
P(n,r) = C(n,r) × r!
C(n,r) = P(n,r) ÷ r!
When to Use
When arrangement/sequence matters
When only selection matters
Number of Outcomes
Always larger or equal
Always smaller or equal

← Scroll horizontally for more →

Quick rule: Permutation = P(n,r) = n!/(n−r)!, Combination = C(n,r) = P(n,r)/r!

Formulas Reference

Permutation

Standard Permutation
P(n,r) = n! / (n−r)!
Permutation (n = r)
P(n,n) = n!
Circular Permutation
(n−1)!

Combination

Standard Combination
C(n,r) = n! / (r! × (n−r)!)
Symmetry Property
C(n,r) = C(n, n−r)
Sum of Combinations
C(n,0) + C(n,1) + ... + C(n,n) = 2ⁿ

Special Cases

Permutation with Repetition
nʳ
Combination with Repetition
C(n+r−1, r)
Derangements
Dₙ = ⌊n!/e + 1/2⌋

Real World Applications

Sports & Games

Tournament Podium
P

Gold, Silver, Bronze medals - order matters (1st ≠ 2nd ≠ 3rd)

Poker Hand
C

5-card hand from 52 cards - only which cards matter, not order

Starting Lineup
C

Choosing 5 players from 12 - who plays matters, not order chosen

Daily Life

Password Creation
P

4-digit PIN from 10 digits - 1234 ≠ 4321

Pizza Toppings
C

Choosing 3 toppings from 8 - pepperoni+mushroom = mushroom+pepperoni

Book Arrangement
P

Arranging 5 books on a shelf - order creates different arrangements

Mathematics & Science

DNA Sequencing
P

Order of nucleotides (A,T,C,G) determines genetic information

Sampling Statistics
C

Selecting random samples from population - only composition matters

Quantum States
C

Possible energy level occupations in quantum systems

Calculation Tips & Tricks

1

Simplify factorials

Cancel common terms before calculating: 7!/5! = 7×6

P(7,2) = 7!/5! = 7×6 = 42
2

Use symmetry property

C(n,r) = C(n, n−r) - choose smaller r for easier calculation

C(100,98) = C(100,2) = 4950
3

Convert between P and C

Remember P = C × r! and C = P ÷ r!

If P(5,3)=60, then C(5,3)=60÷6=10
4

Check r ≤ n

You can't choose more items than available (r ≤ n)

P(5,7) is undefined
5

Watch for special cases

P(n,n)=n!, C(n,0)=1, C(n,1)=n

P(5,5)=120, C(5,0)=1, C(5,1)=5

Common Mistakes to Avoid

Using permutation when combination is needed
Choosing lottery numbers (order doesn't matter)
Use C(n,r) not P(n,r)
Forgetting factorial in denominator
Calculating C(5,3) as 5!/2! instead of 5!/(3!×2!)
Remember: C(n,r) = n!/(r! × (n−r)!)
Confusing with/without repetition
Password with repeated digits uses nʳ, not P(n,r)
Identify if repetition is allowed
Incorrect n and r values
Selecting president and vice-president from 10 people: P(10,2) not C(10,2)
Clearly identify distinct positions vs identical selections

Memory Aids & Mnemonics

Permutation = Position matters
Think 'P' for Position - where things are placed is important
Combination = Collection matters
Think 'C' for Collection - only what's in the group matters
Permutation → Performance order
Like performance rankings (1st, 2nd, 3rd)
Combination → Committee selection
Like picking committee members (names matter, not order)

Quick Practice Problems

How many ways to arrange 4 different books?
Permutation
Answer:
4! = 24 permutations
Choose 2 toppings from 5 options for pizza?
Combination
Answer:
C(5,2) = 10 combinations
3-digit PIN with digits 0-9 (no repetition)?
Permutation
Answer:
P(10,3) = 720 permutations
Select 3 committee members from 8 candidates?
Combination
Answer:
C(8,3) = 56 combinations

Historical Context

1

Ancient India

Early work on permutations in Sanskrit poetry (6th century BC)

Study of meter and rhythm patterns

2

17th Century

Blaise Pascal's triangle (1654)

Binomial coefficients and combination properties

3

18th Century

Jacob Bernoulli's Ars Conjectandi (1713)

Systematic study of permutations and combinations

4

Modern Era

Applications in cryptography and computer science

Password security, algorithm analysis, data structures

52! ≈
8.07×10⁶⁷
Card shuffles
C(49,6) =
13,983,816
6/49 odds
P(10,4) =
5,040
PINs (no repeat)
C(5,3) =
10
Choose 3 from 5

Using This Calculator - Best Practices

Click examples to see common scenarios
Switch between P and C to compare
Check step-by-step calculations
Read real-world examples for context
Note: n must be ≤ 170 to avoid overflow
Auto-calculates on input change

Frequently Asked Questions About Permutations & Combinations

What is the difference between permutation and combination in mathematics?

Permutation considers order important (ABC ≠ CBA), while combination considers order irrelevant (ABC = CBA). Use permutations for arrangements like passwords, rankings, and seating. Use combinations for selections like lottery numbers, committee members, and pizza toppings.

How do I calculate permutations with the formula P(n,r) = n! / (n−r)!?

To calculate permutations, multiply n × (n-1) × (n-2) × ... × (n-r+1). For example, P(10,3) = 10 × 9 × 8 = 720. Our calculator shows step-by-step calculations with factorial cancellation for efficiency.

What is the combination formula C(n,r) = n! / (r! × (n−r)!) and how do I use it?

Combination formula counts selections without regard to order. Example: C(10,3) = 10!/(3!×7!) = 120. Use symmetry property C(n,r) = C(n,n-r) for easier calculation when r > n/2. Our calculator handles large numbers with BigInt precision.

How many 4-digit PIN codes can be formed from digits 0-9 without repetition?

This is a permutation problem: P(10,4) = 10 × 9 × 8 × 7 = 5,040 possible PINs. If digits can repeat, use nʳ = 10⁴ = 10,000 possibilities. Our calculator helps distinguish between permutations with and without repetition.

How do I calculate the number of ways to choose a committee of 5 from 12 people?

Use combination formula C(12,5) = 12!/(5!×7!) = 792 possible committees. Order doesn't matter because all committee members have equal positions. Our calculator shows both the result and the step-by-step calculation.

What is the relationship between permutations and combinations?

Permutations = Combinations × r! (P = C × r!). Conversely, Combinations = Permutations ÷ r! (C = P ÷ r!). This relationship exists because each combination of r items can be arranged in r! different orders.

How many ways can 5 books be arranged on a shelf?

This is a permutation of all 5 items: P(5,5) = 5! = 5 × 4 × 3 × 2 × 1 = 120 different arrangements. This is also called '5 factorial' and represents all possible orderings.

What are the odds of winning the 6/49 lottery?

The number of possible combinations is C(49,6) = 49!/(6!×43!) = 13,983,816. Your chance of winning with one ticket is 1 in approximately 14 million. This is why lotteries have such low odds.

How do I calculate permutations with repetition allowed?

When repetition is allowed, use nʳ formula. Example: 3-digit PIN from digits 0-9 with repetition allowed = 10³ = 1,000 possibilities. Without repetition, it's P(10,3) = 720. Our calculator helps identify which formula to use.

What is the factorial function and how is it used in combinatorics?

Factorial (n!) = n × (n-1) × (n-2) × ... × 1. It's fundamental to combinatorics: permutations use n!/(n-r)!, combinations use n!/(r!×(n-r)!). For large n (≤170), our calculator uses BigInt for exact results.

How do I choose between permutation and combination for real-world problems?

Ask: Does order matter? If yes (passwords, rankings, arrangements) → use permutation. If no (team selection, lottery numbers, ingredients) → use combination. Our calculator includes real-world examples to guide your choice.

What are circular permutations and how are they calculated?

Circular permutations count arrangements around a circle, where rotations are considered identical. Formula: (n-1)! for distinct items. Example: 5 people around a table = (5-1)! = 4! = 24 arrangements.