Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^2: Birthday Chances

by Anonymous Monk
on Jul 29, 2010 at 22:55 UTC ( #852011=note: print w/replies, xml ) Need Help??


in reply to Re: Birthday Chances
in thread Birthday Chances

Well if you just use the idea that choosing 2 people out of a group has a certain number of possibilities, it would stand to reason when the possibilities get larger than 366, you are probably going to have two people with the same birthday. If you choose two people out of a group of 28 people, there are 378 ways to do this without repeats! That makes the odds pretty good that two of them with have the same birthday.

Replies are listed 'Best First'.
Re^3: Birthday Chances
by morgon (Priest) on Jul 29, 2010 at 23:14 UTC
    it would stand to reason when the possibilities get larger than 366, you are probably going to have two people with the same birthday

    Not probably but definitely.

    If you have a group of 366 (or more) people you always have 2 people that share the same birthday (assuming a non-leap year).

    This reasoning is called "pigeonhole principle".

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://852011]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2022-08-09 01:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?