Let's do this one at a time.
Part a) is correct.
But in part b) you are treating losses as if they are different 'letters'.
.
Why? Where does the 13 come from?
As I prepare for finals this coming week, could someone tell me if I have answered the following problem correctly? Please point out any errors and I will attempt to correct the mistakes. Thanks.
The pro football season lasts 16 games. The list WWLTWWWWLWWWLLTW is the record of a team that won its first two games, lost its third, tied its fourth, etc., and finished with a record of 10-4-2, (10wins, 4 losses, 2 ties).
a) How many ways are there for a team to finish 10-4-2?
Note: use of multinomial coefficients
b) How many ways in part a) do not have consecutive losses?
First choose the ways to arrange the wins and ties. There are ways to arrange the wins and ties.
Next there are 13 ways to insert a loss into the above sequence. There are now 12 ways to insert the second loss into the sequence with one loss.
There are 11 ways to insert the third loss into the sequence of games. There are 10 ways to insert the fourth loss into the sequence of games. Therefore there are ways to play 16 games with 10 wins, 4 losses, and two ties so that there are no consecutive losses.
c) How many ways in part a) have a longest winning streak of six games?
There are 11 ways to place six consecutive wins in the sequence of 16 games. Two of these 11 either start the sequence with a win or end the sequence with a win, so we break into two cases.
First case: the winning streak happens from games 2-15. We have 4 ways to surround this winning streak with a non-win. (2 losses, 2 ties, or a loss before the win streak and a tie after, or a tie before the win streak and a loss after). These translate to the following: losses before and after ; ties before and after ; a tie before and loss after ; and a loss before and tie after . If the season starts with the win streak or ends with the win streak and has a loss on one end: or has a tie on one end: . There are therefore ways to have a longest win streak of six games.
My thinking was to first find the number of ways to arrange the wins and ties. For each of these arrangements, we can insert a loss as the first game played, or the second game played, etc. all the way to the 13th game played. So that is where the 13 comes from. Now we have arrangements including the first loss.
We want to include the second loss in any place except next to the first loss. There should be 12 ways to include the second loss each of which will give us another arrangement. There should be 11 ways to include the third loss that would not be next to one of the first two losses in the sequence and 10 ways to include the fourth loss. I first drew an array of 12 slots. To include the first loss, it could go before the first or after the last or between any of the first twelve games. Is this reasoning incorrect? I have made many incorrect conclusions this past month or so, but have learned much from each one.
Hello, oldguynewstudent!
The pro football season lasts 16 games.
The list WWLTWWWWLWWWLLTW is the record of a team
that won its first two games, lost its third, tied its fourth, etc.
and finished with a record of 10-4-2, (10 wins, 4 losses, 2 ties).
a) How many ways are there for a team to finish 10-4-2?
. Correct!
b) How many ways in part a) do not have consecutive losses?
First choose the ways to arrange the 10 wins and 2 ties.
There are ways to arrange the wins and ties. . Right!
I agree with Plato . . .
We have (for example):
. .
There are 13 spaces in which place the 4 losses:
. . There are: . choices.
Think about it . . . We can't number the losses.
The first loss does not have 13 choices.
Can be in the twelfth space?
. . No! . . . Then it wouldn't be (the first loss), would it?
I see this now. I didn't understand Plato. I thought he just wanted more of an explanation on how I got my numbers.
It would be distributing 4 identical losses to 13 distinct slots!
Thanks