In the video "How many ways are there to reorder the word MISSISSIPPI?" by Dr. Trefor Bazett, Dr. Bazett computes the number of reorderings as follows. First he considers the number of places to put all the "S"s, then all the "I"s, then the two "Ps", and finally the "M". The resulting expression is 0000. Yes, math profs make mistakes too... 4 Part A Find the mistake in Dr. Bazett's solution. Describe what the error is and write down the correct solution! (1) Part B Perform the same analysis, but start by placing the "M", then the two "P"s, then the four "I"s, and then the four "S"s. You should get an

College Algebra
10th Edition
ISBN:9781337282291
Author:Ron Larson
Publisher:Ron Larson
Chapter8: Sequences, Series,and Probability
Section8.6: Counting Principles
Problem 8ECP: In how many different ways can two letters be chosen from the letters A, B, C, D, E, F, and G? (The...
icon
Related questions
Question

Please help me with Problem 2

Problem 2
In the video "How many ways are there to reorder the word MISSISSIPPI?" by Dr. Trefor Bazett, Dr. Bazett computes the number of
reorderings as follows. First he considers the number of places to put all the "S"s, then all the "I"s, then the two "Ps", and finally the "M".
The resulting expression is
(1)()
Yes, math profs make mistakes too...
2
Part A
Find the mistake in Dr. Bazett's solution. Describe what the error is and write down the correct solution!
Part B
Perform the same analysis, but start by placing the "M", then the two "P"s, then the four "I"s, and then the four "S"s. You should get an
expression that is similar to your corrected answer in Part A, including some of the same numbers, but in different places.
Part C
Using the formula for (1), write a calculation to show that your answer in Part A agrees with (is the same number as) Dr. Bazett's
solution in Equation 1.
Part D
The method of combinatorial proof is used to show that two expressions are equal by demonstrating that they are different ways of
counting the same thing. Use a combinatorial proof to show that, for any integers n, k, and j such that k + j≤n,
(1)
(3) (" *) = ('?) (^z ^) .
j
k
Note: it is possible to do this with algebra, but please don't! The combinatorial proof is simpler and nicer.
Hint: consider the number of ways to reorder a word of length n containing only three kinds of distinct letters.
Transcribed Image Text:Problem 2 In the video "How many ways are there to reorder the word MISSISSIPPI?" by Dr. Trefor Bazett, Dr. Bazett computes the number of reorderings as follows. First he considers the number of places to put all the "S"s, then all the "I"s, then the two "Ps", and finally the "M". The resulting expression is (1)() Yes, math profs make mistakes too... 2 Part A Find the mistake in Dr. Bazett's solution. Describe what the error is and write down the correct solution! Part B Perform the same analysis, but start by placing the "M", then the two "P"s, then the four "I"s, and then the four "S"s. You should get an expression that is similar to your corrected answer in Part A, including some of the same numbers, but in different places. Part C Using the formula for (1), write a calculation to show that your answer in Part A agrees with (is the same number as) Dr. Bazett's solution in Equation 1. Part D The method of combinatorial proof is used to show that two expressions are equal by demonstrating that they are different ways of counting the same thing. Use a combinatorial proof to show that, for any integers n, k, and j such that k + j≤n, (1) (3) (" *) = ('?) (^z ^) . j k Note: it is possible to do this with algebra, but please don't! The combinatorial proof is simpler and nicer. Hint: consider the number of ways to reorder a word of length n containing only three kinds of distinct letters.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 15 images

Blurred answer
Recommended textbooks for you
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
Intermediate Algebra
Intermediate Algebra
Algebra
ISBN:
9780998625720
Author:
Lynn Marecek
Publisher:
OpenStax College