Combinations are a fundamental concept in combinatorics, the branch of mathematics dealing with counting and arrangements. Unlike permutations where order matters, combinations count the number of ways to select items from a larger set where the order of selection is irrelevant. For example, choosing 3 fruits from a bowl of 5 different fruits results in the same combination regardless of which fruit you pick first.

The combination formula, often written as C(n, r), nCr, or "n choose r," calculates how many different groups of r items can be formed from n total items. This is calculated by dividing the number of permutations by r! (r factorial) to eliminate the duplicate arrangements that would be counted separately in permutations but represent the same group in combinations.

The standard combination formula without repetition is C(n, r) = n! / [r! × (n-r)!]. The numerator, n!, represents all possible arrangements of n items. We divide by r! to account for the fact that the order within our selection doesn't matter, and by (n-r)! to account for the items we didn't select.

When repetition is allowed (also called combinations with replacement or multisets), the formula changes to C(n+r-1, r). This accounts for the possibility of selecting the same item multiple times. For example, choosing 3 scoops of ice cream from 5 flavors where you can repeat flavors would use this formula.

The key difference between combinations and permutations lies in whether order matters. Permutations count arrangements where order is significant (like a password or ranking), while combinations count selections where order is irrelevant (like a committee or lottery numbers). The relationship is: P(n, r) = C(n, r) × r!

To determine which to use, ask yourself: "Does rearranging the selected items create a different outcome?" If yes, use permutations. If no, use combinations. For instance, selecting 3 people for a committee uses combinations (same people = same committee), but assigning them as President, VP, and Secretary uses permutations (same people, different roles = different outcome).

Combinations have countless practical applications across various fields. In probability and statistics, they're essential for calculating odds in lotteries, card games, and other scenarios. The probability of winning a lottery that requires choosing 6 numbers from 49 is 1 in C(49, 6) = 1 in 13,983,816.

In computer science, combinations are used in algorithm design, particularly for generating all possible subsets of a set or analyzing the complexity of certain problems. In genetics, combinations help calculate possible gene combinations. In business, they're used for market research sampling, quality control, and analyzing different product combinations. Understanding combinations enables better decision-making in scenarios involving selection without regard to order.