Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
Don't ask to ask, just ask
 
PerlMonks  

Re: Birthday Chances

by ehdonhon (Curate)
on Feb 15, 2002 at 18:17 UTC ( [id://145788]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Birthday Chances

The question here is: What are the chances of any n people not having unique birthdays? That's a difficult question. But the cool thing about probability is that you can always find the probability of something by subtracting the probability of its inverse from one. So instead, ask: What are the chances of any n people having unique birthdays? That would be:

(1/365) * ( 1/365 -1) * (1 /365 -2 ) * ... ( 1/365 - (n-1))

And once you have that, the answer to the original question is:

1 - ( (1/365) * ( 1/365 - 1 ) * ( 1/365 - 2) * ... ( 1/365 - (n-1)))

Now just plug in different values of n to find the odds of n people not having unique birthdays.

Replies are listed 'Best First'.
Re: Re: Birthday Chances
by Merlin42 (Friar) on Feb 18, 2002 at 09:36 UTC
    You might want to adjust your parenthization(is that a word?) ;)
    I think what you really want is:
    1 - ( 1/365 * 1/(365 - 1) * 1/(365 - 2) * ... * 1/(365 - (n-1)) )

    Kevin

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://145788]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.