Permutation and Combination Calculator
Calculate permutations and combinations to solve counting and probability problems accurately.
Share
https://www.solvezi.com/statistics/permutation-combination-calculator
Calculate permutations and combinations to solve counting and probability problems accurately.
https://www.solvezi.com/statistics/permutation-combination-calculator
Calculate arrangements and selections with ease
Order matters in permutations
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.
Arrangements where ORDER MATTERS
P(n,r) = n! / (n−r)!Switching positions creates a different outcome
Selections where ORDER DOESN'T MATTER
C(n,r) = n! / (r! × (n−r)!)Only who/what is chosen matters, not the order
| Aspect | Permutation | Combination |
|---|---|---|
| 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!
P(n,r) = n! / (n−r)!P(n,n) = n!(n−1)!C(n,r) = n! / (r! × (n−r)!)C(n,r) = C(n, n−r)C(n,0) + C(n,1) + ... + C(n,n) = 2ⁿnʳC(n+r−1, r)Dₙ = ⌊n!/e + 1/2⌋Gold, Silver, Bronze medals - order matters (1st ≠ 2nd ≠ 3rd)
5-card hand from 52 cards - only which cards matter, not order
Choosing 5 players from 12 - who plays matters, not order chosen
4-digit PIN from 10 digits - 1234 ≠ 4321
Choosing 3 toppings from 8 - pepperoni+mushroom = mushroom+pepperoni
Arranging 5 books on a shelf - order creates different arrangements
Order of nucleotides (A,T,C,G) determines genetic information
Selecting random samples from population - only composition matters
Possible energy level occupations in quantum systems
Cancel common terms before calculating: 7!/5! = 7×6
C(n,r) = C(n, n−r) - choose smaller r for easier calculation
Remember P = C × r! and C = P ÷ r!
You can't choose more items than available (r ≤ n)
P(n,n)=n!, C(n,0)=1, C(n,1)=n
Early work on permutations in Sanskrit poetry (6th century BC)
Study of meter and rhythm patterns
Blaise Pascal's triangle (1654)
Binomial coefficients and combination properties
Jacob Bernoulli's Ars Conjectandi (1713)
Systematic study of permutations and combinations
Applications in cryptography and computer science
Password security, algorithm analysis, data structures
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.