Calculadora de Combinaciones Gratis
Calcula el número de combinaciones posibles al elegir r elementos de n sin importar el orden.
C(n, r)
120
C(n, r) vs Total Items (n)
Fórmula
## How to Calculate Combinations ### Formula **C(n, r) = n! / (r! * (n - r)!)** A combination counts the number of ways to choose r items from n distinct items where order does not matter. For example, choosing 3 team members from 10 candidates is a combination problem because the group {A, B, C} is the same regardless of selection order.
Ejemplo Resuelto
How many ways can you choose a committee of 3 from 10 people?
- 01C(10, 3) = 10! / (3! * 7!)
- 02= (10 * 9 * 8) / (3 * 2 * 1)
- 03= 720 / 6 = 120
- 04Compare with permutations: P(10,3) = 720
Preguntas Frecuentes
Why is C(n,r) always less than or equal to P(n,r)?
Because C(n,r) = P(n,r) / r!. Each unordered combination corresponds to r! ordered permutations, so dividing removes the duplicate orderings.
What is C(n, 0) and C(n, n)?
Both equal 1. There is exactly one way to choose nothing (the empty set) and exactly one way to choose everything.
What is the relationship to Pascal's triangle?
The entry in row n, position r of Pascal's triangle equals C(n, r). The recursive identity is C(n, r) = C(n-1, r-1) + C(n-1, r).
Aprender