Ask your own question, for FREE!
Mathematics 13 Online
OpenStudy (anonymous):

Product or Subtraction Rule (Discrete Math)?

OpenStudy (anonymous):

There are 10 people in line, where each person is either male or female. How many different lineups are there, where there are either 5 consecutive mean, or 5 consecutive women?

OpenStudy (anonymous):

@Hero

OpenStudy (anonymous):

Well, they have to be 5 consecutive men or women in a row, which means 5 men need to be behind each other...So if Im reading the question right, there should be only 2 ways if you're allowed to be Symmetric.

OpenStudy (anonymous):

thanks @Yuba how would I represent that? like this? N1 = 10 people in line N2 = 2 (either male or female) N3 = 2 (5 consecutive men or women) N1 + N2 - N3 = 10 +2 - 2(5) = 2 Is this right?

OpenStudy (anonymous):

Im honestly not sure :/ I was already unsure with the question itself honestly

hero (hero):

511111 151111 115111 111511 111151 111115 That's six possibilities assuming the 5 represents 5 consecutive men Now multiply that by 2 to get the possibilities for both men and women. 6 x 2 = 12 possibilities.

hero (hero):

So addition property 6 + 6 = 12

OpenStudy (anonymous):

ohhhh i thought I would like take it as just 5 5 (men women) 5 5 (women men) so you have to break the rest into 1 because it could either be male or female, is this right? @Hero

hero (hero):

The key word phrase is "either...or" It wants to know the number of possibilities assuming 5 consecutive men or 5 consecutive women. If we consider the case where there are 5 consecutive men, then that means the women are not required to be consecutive. That's where using the 1 comes in. Then we consider the case where there are 5 consecutive women and the men are nto required to be consective. Then we add to get the total number of possibilities of consecutive men or women.

OpenStudy (anonymous):

ahhhh, i get it now. Thank you so much. I wish you're my teacher.

hero (hero):

I think Open Study provides a means for better communication that in many ways is more effective than a classroom.

hero (hero):

The possible race results are: 1st 1st 1st 1st <4 way tie for 1st> 1st 1st 1st 4th <3 way tie for 1st> 1st 1st 3rd 3rd <2 way tie for 1st><2 way tie for 3rd> 1st 1st 3rd 4th <2 way tie for 1st only> 1st 2nd 2nd 2nd <3 way tie for 2nd> 1st 2nd 2nd 4th <2 way tie for 2nd> 1st 2nd 3rd 3rd <2 way tie for 3rd> 1st 2nd 3rd 4th <no ties> There is only 1 way to get a four way tie: 4C4 or {A B C D} There are 4 ways to get a 3 way tie for 1st: 1st 3rd {ABC} {D} {ABD} {C} {ACD} {B} {BCD} {A} There are 6 ways to get a 2 way tie for 1st and 2 way tie for 2nd: 1st 4th {AB} {CD} {BC} {AD} {CD} {AB} {AD} {BC} {AC} {BD} {BD} {AC} There are 12 ways to get a 2 way tie for 1st There are 4 ways to get a 3 way tie for 2nd There are 12 ways to get a 2 way tie for 2nd as the only tie There are 12 ways to get a 2 way tie for 3rd as the only tie There are 24 ways to get a result with no ties so the total number of possible results is 1 + 4 + 6 + 12 + 4 + 12 + 12 + 24 = 75

hero (hero):

You can study that if you want.

hero (hero):

@lynncake

hero (hero):

Actually, I think I will re-post this as an Open Challenge. It was a true brain wrecker.

hero (hero):

But 75 possibilities is correct.

hero (hero):

Nevertheless, I'm going to allow the Open Study community to tackle this one.

OpenStudy (anonymous):

so this conclude that the problem is a sum. The question asks just to use product and subtraction rule.

OpenStudy (anonymous):

thank you ^_^

hero (hero):

Hmmm. Interesting.

hero (hero):

It is possible it could be solved that way. The approach I took avoids overcounting

hero (hero):

I would rather avoid over-counting. Any time you have to subtract, it means you have over counted.

OpenStudy (anonymous):

I have a question @Hero we could have have 1 1 3 3 without a 2nd?

hero (hero):

Yes, that is possible. The reason is the 2nd slot is being held by a first place winner.

hero (hero):

If two people finish 1st, the 3rd person automatically gets third place, and NOT second.

OpenStudy (anonymous):

you said there's 1 way to get four way tie? 1 1 1 1 could it be 2 2 2 2 3 3 3 3 4 4 4 4

hero (hero):

What does 1111 represent?

OpenStudy (anonymous):

1st 1st 1st 1st

hero (hero):

And I suppose you are assuming it is possible for there to be a 2nd 2nd 2nd 2nd. If that's the case, then who finishes first?

OpenStudy (anonymous):

ohhhh right >.< no one

OpenStudy (anonymous):

person: a b c d [1st] [2nd] [3rd] [4th] ways abcd 1 abc d 4 ab cd 6 a bcd 4 a bc d 4 a b cd 4 a b c d 4 = 27

hero (hero):

Nice, try but there are some flaws in this approach. You seem to have left out many possibilities.

OpenStudy (anonymous):

If there are no ties how many ways can we put 4 participants in the race result? is this right? 4^4?

OpenStudy (anonymous):

@Hero

hero (hero):

4P4 = 24 for no ties.

OpenStudy (anonymous):

what's P stands for?

hero (hero):

permutation

OpenStudy (anonymous):

why is it not 4^4?

hero (hero):

Because that would create more possibilities than allotted for that specific scenario.

OpenStudy (anonymous):

In a best of (2n-1) series, two teams play until one of the teams accumulates n wins. How many different sequences of results are possible? A best of 7 series? A best of 7 series between A and B where A win the 1st game? @Hero

hero (hero):

Another counting problem

OpenStudy (anonymous):

I did it like this: 2n-1=7 -> n=4 wins C(n+r-1, r) -> combination C(4+7-1, 7) = 120 -> for the first question is this right? @Hero

hero (hero):

For this question, I'm pretty sure you have to count.

OpenStudy (anonymous):

I don't understand the series and the game. Does a series have 7 games?

hero (hero):

The only thing is, A winning and B losing represents the same results B winning and A losing represent the same results. So it is either 8 possible or 16 possible for a 7 game series.

hero (hero):

You're not going to always be able to use combinations/permutations to solve every counting problem. For some of them you're going to have to actually think.

hero (hero):

Basketball has seven game series so I'm familiar with it.

hero (hero):

Well, actually, now that I think about it, the question might be a bit more involved than I originally thought.

hero (hero):

Yeah, I think there are more possibilities

hero (hero):

This is a very involved problem so perhaps using combinations and permutations would be a good approach. If only there were some general formulas for dealing with game series.

OpenStudy (anonymous):

Was my approach right though?

hero (hero):

Let A = Team A wins Let B = Team B wins Then some of the possibilities are ABABABA BABABAB

hero (hero):

AABBAA is a possibility

OpenStudy (anonymous):

yeah

hero (hero):

AAAA is also a possibility

hero (hero):

Because team A can win four in a row

hero (hero):

So this is a very involved problem

hero (hero):

I'll have to get back to you later on this.

hero (hero):

Looks like your 120 possibilities for 7 game series might be correct.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!