|
|
|
|
|
by Chinjut
3299 days ago
|
|
There are 2 * 7 * 2 * 7 ways to assign gender and birth-day-of-week to two children. By convention, all are considered equiprobable (this is the same as assuming kids' genders and birth day-of-weeks are independent of each other and of all facts about other kids, and that both genders are equally likely and all 7 days are equally likely for any given kid.) Of these possibilities, 27 are situations where one kid is a Tuesday boy. [Do you dispute this count?] Of those, 14 are situations where one kid is a girl. [Do you dispute this count?] The answer to "What proportion of cases where there is at least one Tuesday boy also have a girl?" is thus 14/27. You have stated by fiat that certain things are irrelevant to certain other things, that certain things have probability 50%, etc, but in doing so, you have not considered the count correctly. You are likely misled by phrasing such as "the boy", when there are families with two boys in which there is no proper referent of "the boy" and no particular answer to question like "Which day was 'the boy' born?". |
|
In this problem, as you've described it, we're enumerating "ways to assign gender and birth-day-of-week." We can do this because there are a countable number of "days of the week" (so we can map to the integers: 1-6) AND there is also a surjective function of [child] -> [day of the week they were born]. Am I right so far?
Now let's replace the set [1-6] with another countable set that also maintains the surjective function. We could say "day in the lunar cycle" (so ~27 options), or better "day of the year" (366 options), for example. Do we now need to consider the 23662366 ways to assign gender and birth-day-of-the-year? Take it further with whatever you want: "birth weight in milligrams" or "number of freckles" (as I previously suggested). All countable things that meet the surjective requirement.
This is starting to smell funny, right? So let's take a look at the math.
You say there are 2727 ways to configure day+gender, assuming independence for kid 1 (k1) and kid 2 (k2). This represents: (k1 gender options * k1 day of week options) * (k2 gender options * k2 day of week options). Right? I'm with you so far. Then you say "Of these possibilities, 27 are situations where one kid is a Tuesday boy." Hold up.
We are given two pieces of information: that one of the kids is a boy, and that particular boy was born on a Tuesday. Let's say the boy is k1 (this is an assignment of enumeration, not of "who came first;" just like Sunday = 1 does not mean that any kid born on a Sunday was born before every kid born on Monday = 2). So now the k1 options are [11] (boy, tuesday), and the total number of options are: [11] * [27] = 14. Of those 14, 7 are girl options. And we're back to a straight 50%.
So yes, I dispute the 27 number. It seems like it is arrived at by 2127, minus one for an apparent duplicate. But the 212*7 represents maintaining gender non-specificity for Tuesday boy, which should be incorrect, no?
> You have stated by fiat that certain things are irrelevant to certain other things...
Yes, but that's what "independent" means, right? You also stated that you're assuming these two things are independent, hence equiprobability. But independence is defined by P(A) = P(A|B). The probability of A is completely unaffected by B. Yet the outcome you arrive at is that P(A) IS affected by B, so the math presented is internally inconsistent.
What am I missing here? I'm fascinated by the uncertainty around this little problem.