Calculadora de Subconjunto (contagem)

The Subset Calculator determines the number of subsets with exactly k elements that can be formed from a set of n elements. This calculation is based on simple combinations, denoted C(n,k), which counts how many ways to choose k items from a total of n, disregarding order. The formula used is C(n,k) = n! / (k!(n−k)!), where n! is the factorial of n. For example, in a set of 5 elements, the number of 2-element subsets is C(5,2) = 10.

This calculator is useful in various practical situations, such as combinatorial analysis in mathematics, probability problems, forming teams or committees, and card games. It helps answer questions like: how many committees of 3 people can be formed from a group of 10? Or how many different 5-card hands exist in a 52-card deck? The result is an integer representing the distinct possibilities.

When using the calculator, remember that n and k must be non-negative integers, with k ≤ n. If k is greater than n, the result is zero, as it is impossible to choose more elements than available. Additionally, very large n values can generate huge numbers due to rapid factorial growth. The calculator handles this internally, but users should be aware that results may be large.

Common pitfalls include ensuring the problem involves simple combinations (where order does not matter) and not permutations (where order matters). For instance, selecting 2 representatives from a class of 30 is a combination, but selecting a president and vice-president is a permutation. This calculator is specific to combinations, so ensure the context is appropriate.