Combinations & Permutations Calculator
Statistics & probability • 2026 edition
Combinations & Permutations Formulas:
Show the calculatorPermutations: \( P(n,r) = \frac{n!}{(n-r)!} \)
Combinations: \( C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!} \)
Where:
- \( n \) = Total number of items
- \( r \) = Number of items to choose
- \( n! \) = n factorial = n × (n-1) × ... × 2 × 1
Permutations consider order (arrangements), while combinations ignore order (selections). For example, selecting 2 letters from {A, B, C}: Permutations (AB, BA, AC, CA, BC, CB) = 6, Combinations (AB, AC, BC) = 3.
Example: For n=5, r=3:
Permutations: \( P(5,3) = \frac{5!}{(5-3)!} = \frac{120}{2} = 60 \)
Combinations: \( C(5,3) = \frac{5!}{3!(5-3)!} = \frac{120}{6 \times 2} = 10 \)
Input Parameters
Permutations
Combinations
Factorial
Advanced Options
Results
Comprehensive Statistics Guide
Combinations and permutations are fundamental counting techniques in probability and statistics. Permutations count the number of ways to arrange objects where order matters, while combinations count the number of ways to select objects where order does not matter. These concepts are essential for calculating probabilities in various scenarios from lottery odds to quality control.
Essential formulas for counting problems:
Key relationships between permutations and combinations:
- \( P(n,r) = C(n,r) \times r! \)
- \( C(n,r) = C(n, n-r) \)
- \( C(n,0) = C(n,n) = 1 \)
- \( C(n,1) = C(n,n-1) = n \)
- Lottery Odds: Calculating winning probabilities
- Genetics: Counting possible gene combinations
- Computer Science: Algorithm complexity analysis
- Quality Control: Sampling inspection plans
- Cryptography: Password and key space calculations
Statistics Fundamentals
Counting techniques for arrangements (permutations) and selections (combinations) of objects.
\( P(n,r) = \frac{n!}{(n-r)!} \) and \( C(n,r) = \frac{n!}{r!(n-r)!} \)
Where n=total items, r=selected items, !=factorial operation.
- Order matters in permutations
- Order doesn't matter in combinations
- 0! = 1 by definition
Applications
Used in probability calculations, experimental design, and combinatorial analysis.
- Determine if order matters
- Select appropriate formula
- Identify n and r values
- Apply the formula
- Interpret the result
- Without replacement scenarios
- Distinct vs identical objects
- Constraints on selections
- Large number computations
Statistics Learning Quiz
Which of the following scenarios requires using permutations rather than combinations?
The answer is B) Awarding 1st, 2nd, and 3rd place prizes to 10 competitors. This requires permutations because the order matters (who gets 1st, 2nd, or 3rd place is important). In contrast, selecting a committee, choosing marbles, or dividing into groups doesn't depend on the order of selection.
This question tests the fundamental distinction between permutations and combinations. The key is to ask: "Does the order of selection matter?" If yes, use permutations; if no, use combinations. In prize awards, the distinction between 1st, 2nd, and 3rd is crucial, making order important.
Permutation: Arrangement where order matters
Combination: Selection where order doesn't matter
Factorial: Product of all positive integers up to n
• Use permutations when order matters
• Use combinations when order doesn't matter
• Permutations always yield more results than combinations
• Think about whether ABC is different from BAC
• If positions/labels matter, use permutations
• If only membership matters, use combinations
• Confusing permutations with combinations
• Not recognizing when order matters
• Misidentifying n and r values
Calculate the number of ways to arrange 4 books on a shelf from a collection of 7 different books. Show your work.
This is a permutation problem because the order in which books are arranged on the shelf matters.
Formula: \( P(n,r) = \frac{n!}{(n-r)!} \)
Given: n = 7 (total books), r = 4 (books to arrange)
Step 1: Apply formula: \( P(7,4) = \frac{7!}{(7-4)!} = \frac{7!}{3!} \)
Step 2: Calculate factorials: 7! = 5,040, 3! = 6
Step 3: Divide: \( P(7,4) = \frac{5,040}{6} = 840 \)
Therefore, there are 840 different ways to arrange 4 books from 7 on a shelf.
This problem demonstrates a classic permutation scenario. The key insight is that arranging books on a shelf creates distinct arrangements based on their positions. Each position on the shelf is unique, so order matters. The calculation shows how quickly arrangements multiply when considering position.
Arrangement: Specific ordering of selected objects
Factorial: n! = n × (n-1) × ... × 2 × 1
Without Replacement: Each object can only be used once
• Order matters in permutations
• Objects cannot be reused (without replacement)
• P(n,r) = n!/(n-r)!
• Cancel out common factorial terms
• P(n,r) = n × (n-1) × ... × (n-r+1)
• Verify: P(n,n) = n!
• Using combination formula for permutation problem
• Miscalculating factorials
• Not recognizing order matters
A club has 12 members and needs to select a 4-person executive committee. How many different committees are possible? What if the positions of President, Vice-President, Secretary, and Treasurer need to be filled?
Part A - Committee selection (order doesn't matter):
This is a combination problem since committee members don't have distinct roles.
\( C(12,4) = \frac{12!}{4!(12-4)!} = \frac{12!}{4! \times 8!} = \frac{12 \times 11 \times 10 \times 9}{4 \times 3 \times 2 \times 1} = \frac{11,880}{24} = 495 \)
There are 495 different possible committees.
Part B - Officer positions (order matters):
This is a permutation problem since each position is distinct.
\( P(12,4) = \frac{12!}{(12-4)!} = \frac{12!}{8!} = 12 \times 11 \times 10 \times 9 = 11,880 \)
There are 11,880 different ways to assign the officer positions.
This problem beautifully illustrates the difference between combinations and permutations. The same basic scenario (selecting 4 people from 12) yields dramatically different results depending on whether the positions are distinct. This demonstrates why correctly identifying when order matters is crucial in counting problems.
Committee Selection: Combination since members are equivalent
Officer Positions: Permutation since roles are distinctDistinct Roles: Positions where order/identity matters
• Committees → Combinations
• Positions/Roles → Permutations
• P(n,r) = C(n,r) × r!
• Look for keywords like "position," "rank," "order"
• Consider if swapping two selections changes the outcome
• Remember: Permutations = Combinations × r!
• Using permutations for committee problems
• Using combinations for ranking problems
• Confusing n and r values
A computer system requires a password consisting of 6 characters, which can be any of the 26 letters of the alphabet. If no character can be repeated, how many possible passwords are there? What is the probability of guessing the password correctly on the first try?
Since the password has ordered positions and no repetition is allowed, this is a permutation problem.
We need to select and arrange 6 letters from 26 available letters.
\( P(26,6) = \frac{26!}{(26-6)!} = \frac{26!}{20!} = 26 \times 25 \times 24 \times 23 \times 22 \times 21 \)
\( P(26,6) = 165,765,600 \)
So there are 165,765,600 possible passwords.
The probability of guessing correctly on the first try is:
\( P(\text{correct guess}) = \frac{1}{165,765,600} \approx 6.03 \times 10^{-9} \)
This is approximately 0.00000000603 or about 1 in 166 million.
This problem demonstrates the practical application of permutations in cybersecurity. The extremely low probability of guessing correctly highlights why permutation-based passwords are secure. The calculation shows how quickly the number of possibilities grows with each additional character position, making brute-force attacks computationally difficult.
Password Space: Total number of possible passwords
Brute Force Attack: Trying all possible combinations
Security Through Complexity: Using large permutation spaces
• Character positions are distinct → use permutations
• No repetition → decreasing available choices
• Probability = 1 / total possibilities
• More characters greatly increase security
• Including numbers/symbols increases possibilities
• P(n,r) grows rapidly with n and r
• Using combinations instead of permutations
• Forgetting that positions matter
• Miscalculating factorial expressions
Which of the following statements about factorials is TRUE?
The answer is C) 0! = 1 by mathematical convention. This is a fundamental definition in mathematics. Factorials grow extremely rapidly (faster than exponential functions), and 0! is defined as 1 to maintain consistency in combinatorial formulas. Factorials are only defined for non-negative integers.
The definition 0! = 1 might seem counterintuitive but is essential for mathematical consistency. It ensures that formulas like C(n,0) = 1 and C(n,n) = 1 work correctly. Factorials grow incredibly fast - 10! = 3,628,800, and 20! is already over 2 trillion. This rapid growth explains why counting problems can have enormous solution spaces.
Factorial Convention: 0! = 1 by definition
Combinatorial Consistency: Mathematical rules that preserve formulas
Asymptotic Growth: How functions behave as inputs increase
• 0! = 1 by definition
• Factorials grow faster than exponentials
• Defined only for non-negative integers
• Remember 0! = 1 for all calculations
• Factorials grow very rapidly
• Use approximations for large n (Stirling's formula)
• Thinking 0! = 0
• Underestimating factorial growth
• Applying factorial to negative numbers
FAQ
Q: What's the difference between P(n,r) and C(n,r)?
A: The key difference is whether order matters:
Permutations P(n,r): Order matters (arrangements)
\( P(n,r) = \frac{n!}{(n-r)!} \)
Combinations C(n,r): Order doesn't matter (selections)
\( C(n,r) = \frac{n!}{r!(n-r)!} \)
Relationship: \( P(n,r) = C(n,r) \times r! \)
Example: Selecting 2 letters from {A, B, C}
- Permutations: AB, BA, AC, CA, BC, CB (6 arrangements)
- Combinations: AB, AC, BC (3 selections)
Q: Why is 0! = 1?
A: 0! = 1 is a mathematical convention that maintains consistency in combinatorial formulas:
1. Empty Product Rule: The product of no numbers is 1
2. Combinatorial Meaning: There's exactly 1 way to arrange 0 objects (do nothing)
3. Formula Consistency: Ensures \( C(n,0) = \frac{n!}{0!n!} = 1 \)
4. Recursive Definition: n! = n × (n-1)! requires 1! = 1 × 0!, so 0! = 1
This convention is essential for mathematical consistency in probability, combinatorics, and calculus.