In Exercises 1–8, evaluate the given binomial coefficient.

A binomial coefficient, denoted as (n choose k) or C(n, k), represents the number of ways to choose k elements from a set of n elements without regard to the order of selection. It is calculated using the formula C(n, k) = n! / (k!(n-k)!), where '!' denotes factorial, the product of all positive integers up to that number.

The factorial of a non-negative integer n, denoted as n!, is the product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. Factorials are fundamental in combinatorics, particularly in calculating binomial coefficients, as they provide the necessary counts of arrangements and selections.

The combinatorial interpretation of binomial coefficients provides a way to understand their significance in counting problems. For instance, C(100, 2) represents the number of ways to select 2 items from a group of 100, which can be visualized as choosing pairs from a larger set. This interpretation is crucial for applying binomial coefficients in real-world scenarios, such as probability and statistics.