Ma1310 Week 10 Binomial Theorem Counting Principle Permutati

Ma1310 Week 10binomial Theorem Counting Principle Permutation And

Evaluate a binomial coefficient. Expand a binomial raised to a power. Find a particular term in a binomial expansion. Use the fundamental counting principle. Use the permutations formula. Distinguish between permutation problems and combination problems. Use the combinations formula.

The expression of Binomial Theorem occurs in computer science, statistics, finite mathematics, and calculus. Permutations and combinations are used in our daily life all the time. The number of ways an event is performed can be counted based on these principles and methods. Some of the specific examples are the ways a committee can be formed or a football team can be formed.

Ideally, we would live in a risk-free world. However, almost every action exposes people to some risk. Recognizing relative risks is important for a long and healthy life. Probability provides us with a measure of the likelihood that an event will occur. Knowledge about probability allows individuals to make informed decisions about their lives.

Paper For Above instruction

1. Define Binomial Coefficient. Give an example. Write the steps of a Graphing Utility to evaluate your Binomial Coefficient and the final answer.

The binomial coefficient, often denoted as n choose k or C(n, k), represents the number of ways to select k elements from a set of n elements without regard to the order. It is calculated using the formula:

C(n, k) = n! / (k! * (n - k)!)

For example, to compute C(5, 2), which is the number of ways to choose 2 items from 5, we process as follows:

  • Calculate factorials: 5! = 120, 2! = 2, (5-2)! = 3! = 6
  • Apply the formula: C(5, 2) = 120 / (2 * 6) = 120 / 12 = 10

Using a graphing utility (like a TI-83/84 calculator), the process involves:

  1. Access the MATH menu
  2. Select the PROB submenu
  3. Choose nCr
  4. Enter inputs: 5 nCr 2
  5. Press ENTER

The calculator displays the final answer, which is 10 in this case.

2. Explain the fundamental counting principle in two to three sentences. Give an example.

The fundamental counting principle states that if there are multiple events to occur sequentially, then the total number of possible outcomes is the product of the number of options for each event. Essentially, if one event can occur in m ways and another independently in n ways, then the total combined outcomes are m × n.

For example, if a restaurant offers 3 appetizers and 4 main courses, then the total number of different meal combinations (appetizer and main course) is 3 × 4 = 12.

3. State the difference between permutation and combination.

A permutation considers the arrangement or order of objects, meaning different arrangements of the same items are counted separately. In contrast, a combination involves selecting items without regard to their order, so different arrangements of the same selected items are considered identical. For instance, selecting 3 books from a shelf (permutation accounts for different orderings), whereas choosing 3 friends to form a committee (combination treats different orderings as the same group).

4. There are 14 performers who will present their comedy acts this weekend at a comedy club. One performer insists on being the last stand-up comic of the evening, and one wants to be the first. If these requests are granted, how many different ways are there to schedule the appearances?

Since two performers have fixed positions—one must be first, and one must be last—the remaining 12 performers can be arranged in the middle in any order. The total number of arrangements is given by:

  1. Fix the first performer (already determined)
  2. Fix the last performer (already determined)
  3. Arrange the remaining 12 performers in the 12 middle positions: 12! ways

Therefore, total different scheduling arrangements are:

12! = 479,001,600

5. Of the 100 people in the U.S. Senate, 18 serve on the Foreign Relations Committee. How many ways are there to select Senate members for this committee (assuming party affiliation is not a factor in selection)?

This is a combination problem, where 18 members are to be selected from 100 senators without regard for order. The number of combinations is calculated as:

C(100, 18) = 100! / (18! * 82!)

Using calculator or software, this yields approximately 1.186 x 1020 different possible committees.

6. A fair coin is tossed two times in succession. The set of equally likely outcomes is {HH, HT, TH, TT}. Find the probability of getting exactly two tails.

The total outcomes are 4, and only one of these outcomes, TT, contains exactly two tails. Therefore, the probability is:

P(exactly two tails) = 1 / 4 = 0.25

References

  • Allen, E., & Rossi, P. (2015). Fundamentals of Probability: Introduction for Data Science and Analytics. Academic Press.
  • Blitzstein, J., & Hwang, J. (2014). Introduction to Combinatorics. CRC Press.
  • Grinstead, C. M., & Snell, J. L. (1997). Introduction to Probability. American Mathematical Society.
  • Larson, D., & Farber, M. (2014). Mathematics: A Simplified Approach. Pearson.
  • Ross, S. M. (2014). Introduction to Probability Models. Academic Press.
  • Swokowski, E. (2018). Algebra and Trigonometry with Analytic Geometry. Cengage Learning.
  • Stewart, J. (2016). Calculus: Early Transcendentals. Cengage Learning.
  • Velleman, P., & Hoefling, J. (2013). Problem Solving and Object-Oriented Programming. Pearson.
  • Wackerly, D., Mendenhall, W., & Scheaffer, R. (2014). Mathematical Statistics with Applications. Cengage.
  • Yates, F., & Moore, D. S. (1997). The Art of Data Analysis. Springer.

Related Assignments