 |
|  |
 |
|
Ramo
|
 |
Austin, Texas, USA
Oct 1999 time: 23:17
|
|
quote: If I have a random number generator that randomly pulls a number between 1 and 365.
And I choose any number, every time I run the number generator will give me a 1 in 365 chance of hitting my number. Every subsequent pull would be additive. I don't see the difference. |
That isn't quite true. First of all, the probability that person one doesn't have the same birthday as you and the probility that person 2 doesn't have the same birthday as you aren't distinct events; that is, there's some intersection between the two events that must be taken into account.
For an example, let's say if we call the probability that Chow has the same birthday as you E1 and the probability that Rex has the same birthday as you E2, and so forth up till we get to all member so 'Poly, the last being En. If we go on your theory that P(E1 U E2U....U En) is simply the sum of individual the probabilities, we obviously end up with counterintuitive result that the probability well exceeds 1.
Another misconception is that you're mathematically introducing the union of the sets, which is the wrong operator in this case. Think of a Venn diagram - the union of two sets includes areas in which the events don't intersect; that is, E1 can be true, while all other events being false. So we get a pretty useless result.
It should indeed be the intresection of two sets, which, as previously indicated, is represented by the product of the two probabilities. Think of one coin. If you flip it, there are two possibilities - {H, T}. So, the probability of either event is 1/2. Now, think of two coins. If you flip both coins, there are four possible results - {HH, HT, TH, TT}. The probability that both are heads is obviously 1/4, which is the product of the individual probabilities, (1/2)(1/2). This situation is analagous to Chow's second problem.
quote: Anyone care to guess the mathematically expected number of different birthdays which would be covered by a random group of 183 people? I don't know the answer; I might be able to figure it out, or hopefully Chowlett can enlighten us. |
Like in the previous problem, there are 365^183 total possibilities.
If we assume there are n (n is an integer such that 0 <= n, <= 183) conflicting birthdays, the first person has 365 possible choices. The second has 365 OR 364 possible choices. The next has 365 OR 364 OR 363 possible chioces. The nth has 365 OR 364 OR 363 OR.... 365-n possible choices.
That was pretty futile , let's look at it another way. There is one situation in which there 365^n*365!/(182 + n)! possibilities. There is another such that there are 365^(n-1)364*365!/(182 + n)!. Hell, this may seem hasty given my small expansion but it stands to reason that there are 365!/(182 + n)!(365^n + 364^n +... (182 + n)^n + 365^(n-1)364^n +... [all of those various combinations]). Set this function equal to 1/2, and solve for n, and that would give you the answer.
I don't know how to elegantly write the function, but I gather it shouldn't be too hard just to use a simple program to approximate the solution.
|
|
|  |
 |
|
Rex Little
|
|
To answer my own question (how many different birthdays are expected in a group of 183 people), I used the following reasoning. I'm not certain it's valid; if not, I hope someone will correct me.
Definition: B(N) is the number of different birthdays expected in a group of N people. Obviously, B(1) = 1.
Assumption: If you add 1 person to a group of N, his chance of matching one of the existing birthdays in the group is (B(N)/365). Subtract this number from 1 and you get the increase in B resulting from the addition of that person to the group. Thus, for B > 1, B(N+1) = B(N) + 1 - (B(N)/365). (Making the standard assumptions of evenly-distributed birthdays and no leap year.)
Running this equation through an Excel spreadsheet gives the result that B(183) = 144 (rounded off).
Some interesting results for higher values of N. For N=253, B=183, which agrees with Chowlett's answer on his second problem. For N=730--twice the number of days in a year--B=316, which means you'd still expect to have 49 birthdays uncovered in a group that size.
Last edited by Rex Little on 08-02-2002 at 22:52
|
|
|  |
 |
|
Rex Little
|
|
For n=1, SD's formula gives 365 - (364/1) = 1. So it's actually a formula for birthdays rather than non-birthdays, but other than that it's correct.
Edit: this was in response to Krazy's post directly above, which he then edited. I think we're all now in agreement.
|
|
|  |
All times are GMT. The time now is 05:17. Apolyton Time is 00:17. |
top of page
|
| archivepost |
|
Forum Rules:
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
|
HTML code is ON
vB code is ON
Smilies are ON
[IMG] code is ON
|
|
|
|
|
|