General Discussion Undecided where to post - do it here. |
Reply to Thread New Thread |
![]() |
#1 |
|
I'm working on a logic problem. Maybe there are some math whizzes among us.
There are two parties happening on a Friday night. The two parties happen to be going on in opposing sides of a duplex house. Each attendee is given a hand stamp upon entry into each party, which allows the attendee to leave and return freely. Each party has it's own hand-stamp, and party attendees are only stamped once. We don't know how many people were at these parties, but we know how we can classify them. Here are some variables to consider (these are categories of attendees): for PARTY #1: CRASHER_1 = an attendee who crashed the party -- no hand-stamp present (i.e., they sneaked in) FLOATER_1 = an attendee of both parties (both hand-stamps present) LOYALIST_1 = an attendee with only party #1's hand-stamp DEFECTOR_1 = an attendee with only THE OTHER PARTY'S hand-stamp (how would this happen?) for PARTY #2: CRASHER_2 = an attendee who crashed the party -- no hand-stamp present (i.e., they sneaked in) FLOATER_2 = an attendee of both parties (both hand-stamps present) LOYALIST_2 = an attendee with only party #2's hand-stamp DEFECTOR_2 = an attendee with only THE OTHER PARTY'S hand-stamp (how would this happen?) How do we calculate the net, overall direction of traffic from one party to the other? In other words, which party was more popular? Are any of the variables USELESS? Good luck! ![]() |
![]() |
![]() |
#3 |
|
The party without the logic problem creator apparently rocked [thumbup]
However on a more serious note... I don't believe there's enough data to work the variables into any finite answer. IMO Short of writing you an algebraic equation to express how I cannot find an answer, I don't know what else to say. |
![]() |
![]() |
#4 |
|
|
![]() |
![]() |
#5 |
|
|
![]() |
![]() |
#7 |
|
|
![]() |
![]() |
#8 |
|
|
![]() |
![]() |
#9 |
|
Crasher1 would be defector2 Crasher and defectors would NOT be the same thing of course, a defector has a stamp for party A but went to party B (or the other way around) and Crashers have no stamp at all. Floaters are useless in determining which one was more popular as they were present on both. Assuming you want to see the results of people actually staying at a party and not how much income from the stamps they generated it should be something like this: Total1 = Crasher1 + Defector1 + Loyalist1 Total2 = Crasher2 + Defector2 + Loyalist2 Again, you could add up the floaters to find out how much of a % lead one party had over the other, but other than that floater1=floater2 so you can omit it if you just want to figure out which is more popular. As for the direction of traffic, it's only really the defectors you want to look at, all the other variables (Crasher + Loyalist) are static for both parties. That's if I understood it correctly ![]() |
![]() |
![]() |
#10 |
|
A defector has a stamp for one party, but goes to the other party as well, but without the second stamp - only way for that would be if they crashed the second party.
That's why I have each representing two of the descriptions. Least ways, that's the way I interpreted it. I'm sure Will will come in and correct everyone, though ![]() |
![]() |
![]() |
#11 |
|
|
![]() |
Reply to Thread New Thread |
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
|