Chapter 12: Problem 13
Evaluate each expression. $$ _{13} C_{11} $$
Short Answer
Expert verified
\( _{13} C_{11} = 78 \).
Step by step solution
01
Understand the Notation
The expression \(_{13} C_{11}\) is a binomial coefficient, often read as '13 choose 11.' It represents the number of ways to choose 11 elements from a set of 13 elements.
02
Use the Formula for Binomial Coefficient
The formula for the binomial coefficient \(_{n} C_{k}\) is \[ \frac{n!}{k! (n-k)!} \] where \( n \) is the total number of items and \( k \) is the number of items to choose.
03
Substitute the Values
Substitute \( n = 13 \) and \( k = 11 \) into the formula: \[ _{13} C_{11} = \frac{13!}{11! (13-11)!} = \frac{13!}{11! \cdot 2!} \]
04
Calculate the Factorials
Calculate the factorials: \[ 13! = 13 \times 12 \times 11! \] Since \( 11! \) is in both the numerator and the denominator, they cancel out: \[ \frac{13 \times 12 \times 11!}{11! \cdot 2!} = \frac{13 \times 12}{2!} = \frac{13 \times 12}{2 \times 1} = \frac{156}{2} = 78 \]
05
Write the Final Answer
Thus, \( _{13} C_{11} = 78 \).
Unlock Step-by-Step Solutions & Ace Your Exams!
-
Full Textbook Solutions
Get detailed explanations and key concepts
-
Unlimited Al creation
Al flashcards, explanations, exams and more...
-
Ads-free access
To over 500 millions flashcards
-
Money-back guarantee
We refund you if you fail your exam.
Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
combinatorics
Combinatorics is a branch of mathematics dealing with combinations of objects. It explores how objects can be selected and arranged without breaking rules. For example, choosing a committee of 3 from 10 people involves combinatorics.
Key concepts in combinatorics include:
By understanding and applying these principles, you can solve many real-world problems, from simple group selections to complex probability computations.
Key concepts in combinatorics include:
- Permutations: Arrangements of objects in a specific order.
- Combinations: Selections of objects where order doesn’t matter, like our exercise evaluating \(_{13} C_{11}.\)
By understanding and applying these principles, you can solve many real-world problems, from simple group selections to complex probability computations.
factorials
Factorials are products of all positive integers up to a certain number. Represented by the symbol \(!\). For example, \(5!\) is calculated as:
\[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \]
Factorials are foundational in combinatorics. They help simplify expressions and calculate permutations and combinations. In our example, \(_{13} C_{11} \), we used factorials of 13 and 11:
A special case to remember: \(0! = 1\), which is important in many combinatorial formulas.
\[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \]
Factorials are foundational in combinatorics. They help simplify expressions and calculate permutations and combinations. In our example, \(_{13} C_{11} \), we used factorials of 13 and 11:
- \[ 13! = 13 \times 12 \times 11! \]
- \[ 2! = 2 \times 1 = 2 \]
A special case to remember: \(0! = 1\), which is important in many combinatorial formulas.
binomial theorem
The binomial theorem describes the expansion of powers of binomials. A binomial is an algebraic expression with two terms, such as \((a + b)\). The binomial theorem states:
\[(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k \]
This allows us to expand and simplify expressions like \((a + b)^4\). Binomial coefficients in the theorem represent the number of ways to choose elements, similar to our exercise with \(_{13}C_{11}\).
In our case, evaluating \(_{13} C_{11}\) simplifies understanding how combinations work within the context of the binomial theorem.
\[(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k \]
This allows us to expand and simplify expressions like \((a + b)^4\). Binomial coefficients in the theorem represent the number of ways to choose elements, similar to our exercise with \(_{13}C_{11}\).
In our case, evaluating \(_{13} C_{11}\) simplifies understanding how combinations work within the context of the binomial theorem.
- Applications: The binomial theorem is vital in probability, algebra, and calculus.
- Pascal’s Triangle: A useful tool for quickly finding binomial coefficients.