Here are the essential concepts you must grasp in order to answer the question correctly.
Combinations
Combinations refer to the selection of items from a larger set where the order of selection does not matter. In this context, when hiring 2 people from 13 applicants, we are interested in how many unique groups of 2 can be formed, regardless of the order in which they are chosen.
Recommended video:
Factorial
The factorial of a non-negative integer n, denoted as n!, is the product of all positive integers up to n. Factorials are essential in calculating combinations and permutations, as they help determine the total arrangements of items. For example, 5! equals 5 × 4 × 3 × 2 × 1 = 120.
Recommended video:
Binomial Coefficient
The binomial coefficient, often represented as C(n, k) or n choose k, quantifies the number of ways to choose k items from n items without regard to the order of selection. It is calculated using the formula C(n, k) = n! / (k!(n-k)!), which is crucial for solving the hiring problem by determining how many ways 2 applicants can be selected from 13.
Recommended video:
Coefficient of Determination