Permutation & Combination Calculator
Solve linear permutations (nPr), combinations (nCr), circular arrangements, and multiset anagrams with or without repetition. Explore step-by-step factorial breakdowns and Pascal's triangle binomial coefficients.
Total Arrangement Combinations
120
Alternate Counting Perspectives
Pascal's Triangle Alignment Map (Row n = 10)
Pascal row highlighted bubble matches combinations select parameter index (r = 3).
Factorial Cancellation Steps
Mathematical Foundations of Combinatorics & Counting Principles
Rigorous mathematical formulations for factorials, permutations, combinations, and multiset partitions
Combinatorics is the branch of discrete mathematics dedicated to counting, arranging, and grouping finite sets of discrete objects. The fundamental governing question is two-fold: Does the sequential order of elements matter? and Can an individual element be selected more than once (repetition/replacement)?
Circular and Multiset Anagram Formulations
When arrangements are arranged around a circle with rotational symmetry, or when rearranging strings with duplicated characters, specialized divisor corrections apply:
The Four Combinatorial Counting Regimes: Comparative Matrix
Systematic classification across order dependency, repetition allowances, and sample evaluations for n=5, r=3
| Counting Regime | Order Matters? | Repetition Allowed? | Mathematical Formula | Representative Real-World Scenario | Evaluation (n=5, r=3) |
|---|---|---|---|---|---|
| Linear Permutations (nPr) | Yes | No | n! / (n - r)! | Awarding Gold, Silver, Bronze medals to 3 racers | 60 arrangements |
| Permutations with Repetition | Yes | Yes | n^r | 3-digit PIN codes formed using digits 1 through 5 | 125 sequences |
| Linear Combinations (nCr) | No | No | n! / [r!(n - r)!] | Electing a 3-person delegation from 5 candidates | 10 groups |
| Combinations with Repetition | No | Yes | (n + r - 1)! / [r!(n - 1)!] | Selecting 3 scoops of gelato from 5 available flavors | 35 selections |
| Circular Permutation | Relative | No | (n - 1)! | Seating 5 board members around an unnumbered table | 24 round seatings |
| Multiset Anagram Permutation | Yes | Fixed Freq | n! / (k₁! k₂! ...) | Letter rearrangements of the word “APPLE” (P repeats 2x) | 60 anagrams |
Frequently Asked Questions
Authoritative mathematical explanations of permutations, combinations, multisets, and factorial algorithms
What is the fundamental mathematical distinction between permutations (nPr) and combinations (nCr)?
In permutations, the sequential order of selection matters strictly (e.g., electing President, Vice President, and Treasurer where {A, B, C} is distinct from {B, A, C}). In combinations, order is irrelevant (e.g., picking a 3-person delegation where {A, B, C} and {B, A, C} represent the identical group). Consequently, nPr is always equal to nCr multiplied by r! (the number of ways to arrange the selected r elements).
How does the combination formula with repetition (multisets) work mathematically?
Combinations with repetition allow selecting r elements from n categories where elements can be chosen more than once. Using the classical 'stars and bars' theorem, this is modeled as partitioning r identical objects among n distinct bins using n - 1 dividers: (n + r - 1) choose r = (n + r - 1)! / [r! × (n - 1)!]. For example, selecting 3 donuts from 4 varieties yields (4 + 3 - 1) choose 3 = 6 choose 3 = 20 distinct flavor bundles.
Why does circular permutation use the formula (n - 1)! instead of n!?
In a linear arrangement of n objects, there are n distinct positions (first through last). In a circle without fixed reference seats, rotating every person one position clockwise creates a geometrically identical relative arrangement. Because every circular configuration can be rotated into n equivalent linear permutations, we divide linear permutations by n: n! / n = (n - 1)!. If reflections (flipping a necklace over) are also identical, the formula becomes (n - 1)! / 2.
How are permutations of multisets with duplicate elements calculated?
When rearranging a set of n total items containing duplicate identical symbols (such as letters in the word MISSISSIPPI where n=11 with 1 M, 4 Is, 4 Ss, and 2 Ps), standard n! overcounts identical permutations. The multinomial coefficient formula divides n! by the product of the factorials of each item's frequency: n! / (k_1! × k_2! × ... × k_m!). For MISSISSIPPI, this yields 11! / (1! × 4! × 4! × 2!) = 34,650 unique anagrams.
Why is zero factorial (0!) mathematically defined as 1?
In combinatorics, 0! represents the number of ways to arrange zero items, which is exactly one way (the empty set). Algebraically, the recursive definition of factorial states that n! = n × (n - 1)!. Setting n = 1 yields 1! = 1 × (1 - 1)! = 1 × 0!. Dividing both sides by 1 gives 0! = 1. This definition preserves the consistency of the combination formula n choose n = n! / [n! × 0!] = 1.