You are not logged in.
I don't think this is important, because we are looking for the "expected" number of games (the problem is symmetric).
Can we differentiate between the two teams? If so, which one gets the first game at home?
My fault again. I corrected my previous comment. WLW is not correct, it must be WLWW. It doesn't matter which team gets the home court first. We must examine both cases and calculate the expected number of games.
I am confused over the wording of the problem. How is WLW 2 more? Also which team gets the home court first?
So maybe it's my fault; I did not express it correctly: the winning team is the one who achieves exactly 2 wins more than its opponent (not necessarily 2 consecutive wins. For example, it can be WLWW or WW or LWWW).
I took it that the winner was the first to win two games in a row. Is that correct?
How do you take into account the requirement for the winning team to achieve a winning streak of 2 games (i.e. to have exactly 2 more winning games from its opponent)?
Okay, I think I've worked it out. Is it...
[list=*]
[*][/*]
[/list]
Yes, two teams.
I assume that a final is between two teams?
Any ideas??
Are we given that the sum of the two bad apples ≠ sum of two good apples?
In the final open polo tournament, the games are held alternatively in each team's home court and away court and the home advantage is 75%. The champion team will be the one to achieve exactly 2 wins more than its opponent. What is the expected number of games in the tournament?
It seems that, as per the puzzle specs, we cannot rely upon differences in d1 and d2. Only information we can get from each weighting is whether the left side is heavier, or the right side is heavier or balance.
It turns out that the third possibilty could be solved just in three weighing attempts, so the test ,in its three attempts and restrictions, is in fact conclusive!!!
In the third possibility, when we weigh the subgruops of group A and the subgroups of group B (using the first two attempts). We will have, in group A, one of the scale's arm be lifted and the same for group B, but we are using a scale!!, so we can know the following results:
the difference between the lighter and the heavier arms in in the first weighing attempt (weighing the subgroups of A), call it "d1", is equal to or more or less then the same difference in the second attempt (when weighing group B), call it "d2".
Now if they are equal then the two rotten apples are equal in weight to two good apples. If they are not, we cann't know which side of the balance contains the rotten apple in both weighing attempts of each group, so we remove the lighter subgroup of B from the arm (in the second attempt) and put on it the lighter side of the subgroups of A (using the third and last attempt), If the two arms balanced then we know ,for sure, that group A contains the heavier rotten apple and group B have the lighter one, So we have:
1) d1>d2 (in this case the two rotten apples weigh more then two normal ones)
2) d1<d2 ( in this case the two rotten apples weigh less then two normal)Finally, if in the theird attempt, the scale which contains the heavier subgroup of group B remains unlifted, then we know, for sure, that group B contains the heavier rotten apple, and we have the results:
1) d2>d1 (the two rotten apples are more in weight then two normal ones)
2) d2<d1 (the two rotten are less in weight then two normal).Note: the third possible case (the heavier subgroup of group B in the third attempt is lifted) can not happen, since the heavier rotten apple must be either in group "A" or in group "B".
Q.E.F
Dear Grantingriver and Phrontister,
Many thanks for your efforts
It appears we must keep trying because the problem does have a solution, with the current restrictions and number of weightings
This is pretty much how far I could get myself...
So any further thoughts or ideas are most welcome!!
Correct! Great job!!
No, I don't think there is such a possibility, I understand that ALL 2 rotten apples are in the same collection. They can either be at the left arm OR at the right arm, BUT in any case, together! ONLY THAT we don't know in which arm!! So, if we see, for example, that one side is raised and the other is lowered, we don't know which side has the good apples and which one has the rotten.
You think that ... there is a possibility that the good apples will be mixed with a subgroup which contains a rotten apple.
@Grantingriver: Thank you for your patience!!
I perfectly understand that by mixing the subgroups together, in the form of A2+B1 versus A1+B2, the two rotten apples are found together on one arm of the scale. This is clear.
For the sake of the example, let's suppose that A1>A2 and B1>B2. If A1 contains only good apples, then A2 contains the lighter rotten, so the other rotten must be the heavier, so it's in B1. So we have one rotten apple in A2 and one in B1. We put them together on one disk, while on the other we put A1 and B2, which we know that only contain good apples. Then of course we can deduce whether the two rotten apples are heavier or lighter, depending on which arm of the scale is lifted.
BUT: when we mix the subgroups, we DO NOT KNOW beforehand if A1 contains good or rotten apples. It might be that A1 contains the heavier rotten apple, in which case, B2 contains the lighter. So the two rotten apples are in A1+B2 (while in the first case, they were in A2+B1).
SO, how can you tell if they lighter or heavier, as compared to 2 good ones???
You don't have to know which side of the scale (in both group) contains the rotten apple!!! Why? To explain this situation suppose "without loss of generality" that group A contains the heavier rotten apple in subgroup A1, then when you weigh the subgroups of this group (group A) the arm of the scale containing the subgroup which include the heavier rotten apple (it could be A1 or A2) will lift the other arm which containing the subgroup of the normal apples and when you do the same with group B which contains the lighter rotten apple the subgroup which contains that apple (it could be B1 or B2 no matter) will be lifted, so when you cross mix the subgroups of each group, the lifting side will match the lifted side and the rotten apples will be in the same collections.
Note: it is obvious that the thing which made you miss the point is confusing the heavier and the lighter sides with the notations of the subgrouops. I think you asked yourself the following question:
"If I donate a particular subgroup of group A "A1" and the other subgroup "A2" and do the same for group B then after weighing, the cross mix will be as follow :(A1+B2) and (A2+B1) but wait a minute!! How the hell could I know that B2 contains the lighter rotten apple or the heavier one and the same for B1?!!!" This is the mistake which you have made. We did not talk about the notations we talked about the heavier and the lighter sides!! So if group A contais the heavier side it could be A1 or A2 no matter and the same for the lighter side it could be B1 or B2 so focus on the heavier and the lighter side not on the notations. I think it is very clear now (please let me know in any case).
Right, I agree. The rotten apples will be either in A1+B2 or in A2+B1 and the scale will NOT balance. But how will we know which side contains the rotten apples and which side the good ones?
It is very obvious. When you make in the third possibility the two collections (A1+B2) and (A2+B1) they will be "exactly" like the two collections formed in the second possibility. Why?!! Because their are just two rotten apples one less in weight then normal and the other more in weight then normal, so in the third possibility one of these two apples will be in a certain subgroup of group A and the other in a certain subgroup of group B, therefore when weighing the subgroups of the group which contains the less weight apple the subgroup of the normal apples will be heavier. On the other hand, when you weigh the subgroups of the group which contains the over weight apple the normal group will be lighter, so when you cross mix these subgroups of each group (the over weighted with the less weighted and vice veras) to form two new collections, one of them will contain the both rotten apples while the other will be compeletly normal!! So you will reach the same final situation of the second possibility.
Q.E.F
In the third possibility, I understand that if the two sides balance, then the two rotten apples weight the same as two good ones.
However, if they do not balance, and say, A1+B2>A2+B1 - how do we know in which side we have the rotten apples? So, in essence, how do we deduce if they are lighter or heavier?
Finally, if you get the third possibility, put the subgroup of the group A which weighs less with the subgroup of group B which weighs more and vice versa, and put on each arm of the scale one collection (using the third attempt), then you will get the same results that we get in the second prossibility hence you know either the two rotten apples are equal to or more or less in weight then two good apple.
Clear cache / browsing history
2. Let S = 80 miles be the distance from Sherry’s home to City A, V1 her speed when driving from her home to A and V2 her speed when returning home.
Also let t1 be the time to go and t2 the time to return.
V2=V1+12
t2=5/6.t1
V1.t1=80
(V1+12).5/6.t1=80
By dividing both parts we get:
V1/(V1+12)=5/6
So V1=60mph and t1=80/60 hours = 80 minutes.
I guess you can now easily solve Nr. 3.
If you still need help, let me know.
1. Let x be the distance we are looking for, t1 the time to go and t2 the time to return.
x = 480.t1 so t1=x/480
x = 320.t2 so t2=x/320
t1+t2 = 2,5 hours
so:
x/480+x/320 = 2,5 so
x=480 km
No, it may also be equal. I will update the wording. Thanks for noticing!!
Are we given that the sum of the two bad apples ≠ sum of two good apples?
Yes but we are not looking for the exact rotten apples, only if the two of them together weight more or less than two of the good ones.
John, Chris and Adrian are stuck in traffic on a bridge in LA. They must be arrive at the office the soonest possible for a very important meeting but they are 30 miles away!
At the edge of the road they find a motor-bike and a racing bicycle, which they decide to “borrow”, as a last desperate effort to finally get to the office on time!
The motorbike is quite old and can only run at a maximum speed of 30 miles per hour, while the bicycle can run at 20 miles per hour. Fortunately, all three are very fit and can also run at 10 miles per hour. If they want, they can leave the motorbike or the bicycle at the edge of the street, for someone else to take it. What is the minimum time they will require to reach the office (all three of them), assuming that the streets are always open for motorbikes / bicycles and joggers?
Me neither and I'm struggling to find it!
No chance to make apple pie...
A great solution also!
Respect!!!
anna_gg wrote:How do you calculate first-choice v2 and v3 and also all the second choice varieties? I only understand 1st choice v1=120 (permutation of 5 numbers / 5)
Sorry, Anna, but I only have a very basic understanding of permutations, which is mainly from research I've done since you started posting permutation problems. I wasn't taught permutations at school.
anonimnystefy and others here can help you with the formulas you need.
Anyway, for what it's worth, here's how I calculated the first-choice v2 and v3 and all the second-choice varieties:
I went with what I know and like to use - an Excel spreadsheet, even though I knew it would be the long way round compared to using permutation formulas (which I did try to write, btw, but your problem had too many tricks for my basic knowledge, and my research didn't unearth the info I was looking for).
I got Mathematica to list all 3125 (ie, 5^5) permutations (with repeat digits) of 5-digit numbers comprising the digits 1 to 5 and copied the list into an Excel spreadsheet, which I used for the rest of the project. There I whittled the list down to 2220 by eliminating permutations that contained the same digit more than twice.
I then got Excel to count the permutations that had distinct digits of specified lengths for first-choice questions:
(a) 5 distinct digits for v1 (no repeat digits)............of which there were 120 )
(b) 4 distinct digits for v2 (1 pair of repeat digits)...of which there were 1200 ) total 2220
(c) 3 distinct digits for v3 (1 pair of repeat digits)....of which there were 900 )I could simply have deducted 120 and 1200 from 2220 to get 900, but I used the Excel count to verify that this component was going well.
Directly underneath the row of 2220 first-choice permutations I created a row of corresponding second-choice permutations, with each one formed from leftover question numbers after taking into account those that were used by first-choice permutations. I got Excel to display them with their digits in ascending order to help with eliminating duplicates.
And that's all there was to that!
How do you calculate first-choice v2 and v3 and also all the second choice varieties? I only understand 1st choice v1=120 (permutation of 5 numbers / 5)
This is my post #9 method:
Subject to the rule "each question must be chosen by exactly 2 students", there are 2220 different sets (permutations) of first-choice questions, and any set chosen determines which question numbers (but not their exact order) form the set of second-choice questions. No student has the same two questions (not exactly stated, but implied, I'd say).
Here's an explanation of the table below:
The first-choice questions only have three varieties (v1, v2, v3), and their second-choice partners the same. Examples are given.
There are different quantities of these varieties: v1=120, v2=1200, v3=900, which total 2220.
The number of permutations of second-choice questions is constant for each of the varieties: v1=44, v2=32, v3=24.
So now we can calculate the total number of different possible ways the questions can be picked:
v1 + v2 + v3 = (120 x 44) + (1200 x 32) + (900 x 24) = 5280 + 38400 + 21600 = 65280But half of the combinations of first and second-choice sets are duplicates (eg, 1st choice 1,1,2,3,4 & 2nd choice 4,5,5,2,3 = 1st choice 4,5,5,2,3 & 2nd choice 1,1,2,3,4).
Therefore the answer is 65280/2 = 32640.
1st choice | 2nd choice A B C D E | A B C D E varieties 2nd choice perms varieties x perms v1: no repeat digits 1 2 3 4 5 | 2 3 1 5 4 120 44 5280 v2: 1 pair of repeat digits 1 1 2 3 4 | 4 5 3 2 5 1200 32 38400 v3: 2 pairs of repeat digits 1 1 2 2 3 | 5 4 3 4 5 900 24 21600 Totals 2220 65280...less 50% duplicates = 32640