Combination Formula:
From: | To: |
A combination is a selection of items from a larger set where the order of selection does not matter. It's a fundamental concept in combinatorics and probability.
The calculator uses the combination formula:
Where:
Explanation: The formula calculates how many ways you can choose r items from n items without regard to order.
Details: Combinations are used in probability, statistics, and many real-world applications like lottery odds, team selection, and experiment design.
Tips: Enter positive integers where n ≥ r ≥ 0. The calculator will compute the number of possible combinations.
Q1: What's the difference between combination and permutation?
A: Combinations consider selection order irrelevant (AB = BA), while permutations treat them as different.
Q2: What if r > n?
A: By definition, C(n, r) = 0 when r > n since you can't choose more items than you have.
Q3: What is 0! (zero factorial)?
A: 0! is defined as 1, which makes the formula work when r = 0 or r = n.
Q4: How does this relate to Pascal's Triangle?
A: Each entry in Pascal's Triangle corresponds to C(n, r) for row n and position r.
Q5: What are some practical applications?
A: Used in probability calculations, lottery odds, statistical sampling, and combinatorial design.