Calculadora de Combinações

Calcule o número de combinações possíveis ao escolher r de n elementos.

Combinações

C(10, 3) = 120

n!

10! = 3,628,800

r!

3! = 6

(n-r)!

(10-3)! = 5,040

Combinações

Fórmula: n! / (r! × (n-r)!)

Valor rCombinações
C(10, 0)1
C(10, 1)10
C(10, 2)45
C(10, 3)120
C(10, 4)210
C(10, 5)252
C(10, 6)210
C(10, 7)120
C(10, 8)45
C(10, 9)10
C(10, 10)1

Compreendendo as Combinações

What Are Combinations?

In mathematics, a combination is a selection of items from a larger set where the order of selection does not matter. If you have a deck of 52 cards and want to know how many different 5-card hands are possible, you use combinations. The answer is C(52,5) = 2,598,960 possible hands. This fundamental concept appears throughout probability, statistics, and everyday problem-solving.

The Combination Formula

The number of combinations of n items taken r at a time is calculated using the formula C(n,r) = n! / (r! × (n-r)!), where the exclamation mark denotes factorial. A factorial is the product of all positive integers up to that number. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. The formula divides by r! and (n-r)! to eliminate counting the same selections in different orders.

Combinations vs Permutations

The key difference is whether order matters. Combinations count selections where order does not matter (choosing 3 flavors of ice cream). Permutations count arrangements where order matters (arranging 3 books on a shelf). The permutation formula is P(n,r) = n! / (n-r)!, which is always greater than or equal to the combination count. When r = n, there is only one combination but n! permutations.

Real-World Applications

Combinations appear in lottery probability calculations (choosing 6 numbers from 49), team selection (choosing 5 players from 12), menu planning (choosing 3 dishes from 10), committee formation, and quality control sampling. In computer science, combinations are used in algorithm analysis, cryptography, and network design. The binomial coefficient C(n,r) also appears in the binomial theorem and Pascal's triangle.

Properties of Combinations

Several important properties make combinations easier to work with. C(n,r) = C(n,n-r), known as the symmetry property. C(n,0) = 1 (there is one way to choose nothing). C(n,1) = n. C(n,n) = 1. The sum of all C(n,r) for r from 0 to n equals 2^n. These properties are useful for verification and simplification in combinatorial calculations.

Exemplo Prático

Scenario: Committee Selection

A company needs to form a 3-person committee from 10 employees. Using combinations: C(10,3) = 10! / (3! × 7!) = 120 possible committees. If 4 of the 10 employees are women, the number of committees with exactly 2 women is C(4,2) × C(6,1) = 6 × 6 = 36 possible committees.

Perguntas Frequentes

O que é uma combinação?

Uma seleção de r elementos de um conjunto de n onde a ordem NÃO importa. Exemplo: escolher 3 sabores de sorvete de 10 opções.

Diferença entre combinação e permutação?

Na combinação a ordem não importa. Na permutação importa. Combinações são sempre ≤ permutações.

Como calcular C(n,r)?

C(n,r) = n! / (r! × (n-r)!). Exemplo: C(5,2) = 120/(2×6) = 10 formas de escolher 2 de 5.

O que é coeficiente binomial?

C(n,r), também escrito nCr, é o número de formas de escolher r de n. Aparece no Triângulo de Pascal e no Binômio de Newton.

Para que se usam combinações?

Probabilidade, estatística, loterias, design de experimentos, teoria dos grafos, criptografia e mais.

Disclaimer: Esta calculadora usa a fórmula padrão C(n,r) = n! / (r! × (n-r)!). Resultados exatos para os parâmetros inseridos.

Fontes e Referências

  1. Wikipedia. "Combination." en.wikipedia.org
  2. Wikipedia. "Binomial coefficient." en.wikipedia.org
  3. Wikipedia. "Pascal's triangle." en.wikipedia.org

Comentários