Combinations
C(n,r) = n! / (r! × (n-r)!)Count the number of ways to choose r items from n items where order does not matter.
Where:
n= Total number of itemsr= Number of items chosenAt Least Once
99.90%
P(A)
50.00%
Expected
5.00
C(n,r) = n! / (r! × (n-r)!)Count the number of ways to choose r items from n items where order does not matter.
Where:
n= Total number of itemsr= Number of items chosenP(n,r) = n! / (n-r)!Count the number of ordered arrangements of r items chosen from n items.
Where:
n= Total number of itemsr= Number of items chosenP(at least one) = 1 - (1 - p)^nCalculate the probability of an event occurring at least once over multiple independent trials.
Where:
p= Probability of the event in a single trialn= Number of independent trialsInputs
Result
P(at least one heads) = 1 - (1 - 0.5)^5 = 1 - 0.03125 = 0.96875 = 96.88%.
Inputs
Result
C(49,6) = 49! / (6! × 43!) = 13,983,816. This means there are nearly 14 million possible lottery combinations.
Combinations count the number of ways to choose items where order does not matter (e.g., picking 3 team members from 10 people). Permutations count arrangements where order matters (e.g., assigning 1st, 2nd, 3rd place). C(10,3) = 120 but P(10,3) = 720, because each combination of 3 can be arranged in 6 different orders.
| Scenario | Type | Formula | Result |
|---|---|---|---|
| 3 from 10 (committee) | Combination | C(10,3) | 120 |
| 3 from 10 (ranked) | Permutation | P(10,3) | 720 |
| 5 from 52 (poker hand) | Combination | C(52,5) | 2,598,960 |
| 6 from 49 (lottery) | Combination | C(49,6) | 13,983,816 |
Use the complement rule: P(at least one) = 1 - P(none). For independent events with probability p over n trials: P(at least once) = 1 - (1-p)^n. For example, the chance of rolling at least one 6 in 4 rolls is 1 - (5/6)^4 = 51.77%.
The complement of an event A, written P(A'), is the probability that event A does NOT occur. It equals 1 - P(A). If the probability of rain is 0.30 (30%), the complement (no rain) is 0.70 (70%). The sum of an event and its complement always equals 1.
C(n,r) means 'n choose r' — the number of ways to choose r items from n items without regard to order. The formula is C(n,r) = n! / (r! × (n-r)!). For example, C(5,2) = 5! / (2! × 3!) = 120 / (2 × 6) = 10.
Use permutations when the order of selection matters: arranging books on a shelf, assigning ranked positions, creating passwords. Use combinations when order does not matter: choosing team members, selecting lottery numbers, picking items from a menu.
Probability is the mathematical study of likelihood and uncertainty. It provides tools for quantifying how likely events are to occur, from simple coin flips to complex statistical models. Basic probability concepts apply across statistics, data science, gambling, insurance, and everyday decision-making.
Combinations and permutations are fundamental counting techniques in probability. Combinations (C(n,r)) count the number of ways to select r items from n items when order does not matter. Permutations (P(n,r)) count the arrangements when order matters. The key formula difference is that C(n,r) = P(n,r) / r!, because each combination can be arranged in r! different orders.
The complement rule is one of the most useful tools in probability. Instead of calculating the probability of a complex event directly, it is often easier to calculate the probability that the event does NOT happen (the complement) and subtract from 1. This technique is especially powerful for 'at least one' problems.
Last Updated: Mar 9, 2026
This calculator is provided for informational and educational purposes only. Results are estimates and should not be considered professional financial, medical, legal, or other advice. Always consult a qualified professional before making important decisions. UseCalcPro is not responsible for any actions taken based on calculator results.