MHB Solving Sour Milk Problem: Find Least Tasting Bottles

  • Thread starter Thread starter OhMyMarkov
  • Start date Start date
OhMyMarkov
Messages
81
Reaction score
0
Hello everyone!

I'm confusing conditional and joint probability again, here is the problem:

Given 4 bottles of milk, one of them is sour. We need to find out which of the bottles is sour by tasting the least number of bottles. By inspection, we can roughly tell the probability of every bottle being sour. Therefore we rank the bottles in non-ascending order of probability that the bottle is sour. Assume that these probabilities are $p_1, p_2, p_3,$ and $p_4$.

We also define an RV $X$ that is equal to the number of bottles we taste before determining what bottle is sour: $X\in\{1,2,3\}$.

Here is where I'm confused:

$P\{X=1\}=P\{b_1 \text{bad}\}=p_1$

Now, which of the following is correct?

(1) $P\{X=2\}=P\{b_2 \text{bad} \; | \; b_1 \text{good}\}$, $P\{X=3\}=P\{b_3 \text{bad} \;|\; b_1, b_2 \text{good}\}$
(2) $P\{X=2\}=P\{b_2 \text{bad and} \; b_1 \text{good}\}$, $P\{X=3\}=P\{b_3 \text{bad} \; \text{and} \; b_1 \text{good and} \; b_2 \text{good}\}$

Thanks!:o
 
Last edited:
Physics news on Phys.org
Hi there,

Can you clean up your notation please? It's hard to follow and I see you tried to use a Latex command but it's not rendering. The way I see this written most often is in the following way [math]P \left[ X=x \right][/math]. To see how I wrote that you can quote this post and copy the Latex code. I think if you make a couple quick edits the question will be much more likely to be answered.

Jameson
 
I've been thinking over this for a bit and I'm not certain I have a full solution but hopefully some helpful comments.

$P[B_n]$ is the probability that the sour milk is located in the nth container. From the OP the order of the bottles is always $(B_1, B_2, B_3,B_4)$ with corresponding probabilities of $P[B_1] < P[B_2] < P[B_3]<P[B_4]$. The sum of these four probabilities is 1.

$P[X=1]=P[B_1]$ if the first bottle is sour.

What does $P[X=2]$ mean? It means that the first bottle was not sour and the second one was. You could write this as $P[B_2|(B_1)']$ but this isn't necessary because there can be just one success in the experiment before it's finished. All of the probabilities correspond to the three other bottles not being sour by the conditions of the situation so because of that I don't think finding $P[X=2,3,4]$ will involve conditional formulas.

When X=2 the only way that happens is bottle 1 to not be sour and then bottle two is so it seems that [math]P[X=2]=P[(B_1)'] \cap P[B_2][/math] or the second choice you posted.

This seems correct but I wouldn't be shocked if I have not accounted for something. Forcing the order that we choose the bottles is a restriction so it makes sense that the probabilities where failures are counted before the success should be smaller than the chance of it just being sour.

Hopefully there is something useful here for you and sorry in advance if there turn out to be errors.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top