SlideShare a Scribd company logo
1 of 4
Download to read offline
Solution
Week 46 (7/28/03)
The birthday problem
(a) Given n people, the probability, Pn, that there is not a common birthday
among them is
Pn = 1 −
1
365
1 −
2
365
· · · 1 −
n − 1
365
. (1)
The first factor is the probability that two given people do not have the same
birthday. The second factor is the probability that a third person does not
have a birthday in common with either of the first two. This continues until
the last factor is the probability that the nth person does not have a birthday
in common with any of the other n − 1 people.
We want Pn < 1/2. If we simply multiply out the above product with suc-
cessive values of n, we find that P22 = .524, and P23 = .493. Therefore, there
must be at least 23 people in a room in order for the odds to favor at least
two of them having the same birthday.
Remark: This answer of n = 23 is much smaller than most people expect, so it
provides a nice betting opportunity. For n = 30, the odds of a common birthday
increase to 70.6%, and most people still find it hard to believe that among 30 people
there are probably two who have the same birthday. The table below lists various
values of n and the probabilities, 1 − Pn, that at least two people have a common
birthday.
n 10 20 23 30 50 60 70 100
1 − Pn 11.7% 41.1% 50.7% 70.6% 97.0% 99.4% 99.92% 99.9994%
Even for n = 50, most people would be happy to bet, at even odds, that no two
people have the same birthday. If they seem a bit hesitant, however, you can simply
offer them the irrefusable odds of 10 to 1. (That is, you put down, for example, $10
on the table, and they put down $1. If there is a common birthday, you take all the
money. If there is no common birthday, they take all the money.) Since there is a
97.0% chance of a common birthday among 50 people, a quick calculation shows that
you will gain, on average, 67 cents for every $10 you put down.
One reason why many people do not believe the n = 23 answer is correct is that they
are asking themselves a different question, namely, “How many people need to be
present for there to be a 1/2 chance that someone else has my birthday?” The answer
to this question is indeed much larger than 23. The probability that no one out of n
people has a birthday on a given day is (1 − 1/365)n
. For n = 252, this is just over
1/2. And for n = 253, it is just under 1/2. Therefore, you need to come across 253
other people in order to expect that at least one of them has your birthday.
(b) First Solution: Given n people, and given N days in a year, the reasoning in
part (a) shows that the probability that no two people have the same birthday
is
Pn = 1 −
1
N
1 −
2
N
· · · 1 −
n − 1
N
. (2)
1
If we take the natural log of this equation and use the expansion,
ln(1 − x) = −(x + x2
/2 + · · ·), (3)
then the requirement Pn ≤ 1/2 becomes
−
1
N
+
2
N
+ · · ·
n − 1
N
−
1
2
1
N2
+
4
N2
+ · · ·
(n − 1)2
N2
−· · · ≤ − ln 2. (4)
Using the sums,
n
1
k =
n(n + 1)
2
, and
n
1
k2
=
n(n + 1)(2n + 1)
6
, (5)
we can rewrite eq. (4) as
n(n − 1)
2N
+
n(n − 1)(2n − 1)
12N2
+ · · · ≥ ln 2. (6)
For large N, the first term will be of order 1 when n ≈
√
N, in which case
the second- and higher-order terms are negligible. Therefore, keeping only the
first term (which behaves like n2/2N), we find that Pn is equal to 1/2 when
n ≈
√
2 ln 2
√
N. (7)
Let’s look at a few cases:
• For N = 365, eq. (7) gives n = 22.5. Since we must have an integral
number of people, this agrees with the exact result, n = 23.
• For N = 24 · 365 = 8760 (that is, for births in the same hour), we find
n = 110.2. This agrees with the exact result, n = 111, obtained by
multiplying out eq. (2).
• For N = 60 · 24 · 365 = 525, 600 (that is, for births in the same minute),
we find n = 853.6. This agrees with the exact result, n = 854, obtained
by multiplying out eq. (2) (not by hand!). This is a very small number
compared to the more than half a million minutes in a year.
Remarks:
(1) If we wish to ask how many people need to be in a room in order for the
probability to be at least p that some two have the same birthday, then the
above derivation is easily modified to yield
n ≈ 2 ln( 1
1−p )
√
N. (8)
(2) The alternative question introduced in part (a), “How many people need to be
present for there to be a 1/2 chance that someone else has my birthday?”, may
also be answered in the large-N limit. The probability that no one out of n
people has a birthday on a given day is
1 −
1
N
n
= 1 −
1
N
N(n/N)
≈ e−n/N
. (9)
2
Therefore, if n > N ln 2, you can expect that at least one of the n people has
your birthday. For N = 365, we find that N ln 2 is slightly less than 253, so
this agrees with the result obtained in part (a). Note that this result is linear in
N, whereas the result of the original problem in eq. (7) behaves like
√
N. The
reason for this square-root behavior can be seen in the next solution.
Second Solution: Given a large number, n, of people, there are n
2 =
n(n − 1)/2 ≈ n2/2 pairs of people. The probability that a given pair has
the same birthday is 1/N, so the probability that they do not have the same
birthday is 1 − 1/N.1 Therefore, the probability that no pair has a common
birthday is
Pn = 1 −
1
N
n2/2
≈ 1 −
1
N
N(n2/2N)
≈ e−n2/(2N)
. (10)
This equals 1/2 when
n ≈
√
2 ln 2
√
N. (11)
in agreement with eq. (7).
Remark: We assumed above that all the pairs are independent, as far as writing
down the 1 − 1/N probability goes. Let us now show that this approximately true.
We will show that for large N and n, the assumptions on the coincidence of birthdays
in some pairs do not significantly affect the probability of coincidence in other pairs.
More precisely, the relation Pn ≈ e−n2
/(2N)
is true if n N2/3
. The reasoning is as
follows.
Consider n people and N days in a year. Assumptions on the coincidence of birthdays
in some pairs will slightly affect the probability of coincidence in other pairs, because
the given assumptions restrict the possible birthdays of these other pairs. For example,
if it is given that A and B do not have the same birthday, and also that B and C do
not, then the probability that A and C do not have the same birthday is 1 − 1/364
(instead of 1 − 1/365), because they are both restricted from having a birthday on
B’s birthday, whatever it may be.
The maximal restriction that can be placed on the possible birthdays of a given pair
occurs when it is known that neither of them has a birthday in common with any of
the other n − 2 people. In this case, the possible birthdays for the last two people are
restricted to N − (n − 2) days of the year. Therefore, the probability that the last
pair does not have a common birthday is 1 − 1/(N − n + 2) > 1 − 1/(N − n). This is
the most that any such probability can differ from the naive 1 − 1/N. Therefore, we
may say that
1 −
1
N − n
n2
/2
≤ Pn ≤ 1 −
1
N
n2
/2
=⇒ e−n2
/2(N−n)
≤ Pn ≤ e−n2
/(2N)
. (12)
The ratio of these upper and lower bounds on Pn is
exp −
n2
2N
+
n2
2(N − n)
= exp
n3
2N(N − n)
. (13)
1
This is not quite correct for all the pairs, because two pairs are not independent if, for example,
they share a common person. But it is accurate enough for our purposes in the large-N limit. See
the remark below.
3
For large N, this ratio is essentially equal to 1, provided that n N2/3
. Therefore,
Pn ≈ e−n2
/(2N)
if n N2/3
. And since the result in eq. (11) is in this realm, it is
therefore valid.
Extension: We can also ask the following question: How many people must
be in a room in order for the probability to be greater than 1/2 that at least b
of them have the same birthday? (Assume that there is a very large number,
N, of days in a year, and ignore effects that are of subleading order in N.)
We can solve this problem in the manner of the second solution above. Given
a large number, n, of people, there are n
b groups of b people. This is approx-
imately equal to nb/b! (assuming that b n).
The probability that a given group of b people all have the same birthday
is 1/Nb−1, so the probability that they do not all have the same birthday is
1 − (1/Nb−1). 2 Therefore, the probability, P
(b)
n , that no group of b people all
have the same birthday is
P(b)
n ≈ 1 −
1
Nb−1
nb/b!
≈ e−nb/b!Nb−1
. (14)
This equals 1/2 when
n ≈ (b! ln 2)1/b
N1−1/b
. (15)
Remarks:
(1) Eq. (15) holds in the large-N limit. If we wish to make another approximation,
that of large b, we see that the quantity (b! ln 2)1/b
goes like b/e, for large b. (This
follows from Sterling’s formula, m! ≈ mm
e−m
√
2πm.) Therefore, for large N,
n, and b (with b n N), we have P
(b)
n = 1/2 when
n ≈ (b/e)N1−1/b
. (16)
(2) The right-hand side of equation eq. (15) scales with N according to N1−1/b
.
This means that if we look at the numbers of people needed to have a greater
than 1/2 chance that pairs, triplets, etc., have common birthdays, we see that
these numbers scale like
N1/2
, N2/3
, N3/4
, · · · . (17)
For large N, these numbers are multiplicatively far apart. Therefore, there are
values of n for which we can say, for example, that we are virtually certain that
there are pairs and triplets with common birthdays, but also that we are virtually
certain that there are no quadruplets with a common birthday. For example, if
n = N17/24
(which satisfies N2/3
< n < N3/4
), then eq. (14) shows that the
probability that there is a common birthday triplet is 1 − e− 1
6 N1/8
≈ 1, whereas
the probability that there is a common birthday quadruplet is 1 − e− 1
24 N−1/6
≈
1
24 N−1/6
≈ 0.
2
Again, this is not quite correct, because the groups are not all independent. But I believe it is
accurate enough for our purposes in the large-N limit. I have a proof which I think is correct, but
which is very ugly. If anyone has a nice clean proof, let me know.
4

More Related Content

What's hot

Mathematical Induction
Mathematical InductionMathematical Induction
Mathematical InductionEdelyn Cagas
 
11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)Nigel Simmons
 
Yet another prime formula to prove open problems
Yet another prime formula to prove open problemsYet another prime formula to prove open problems
Yet another prime formula to prove open problemsChris De Corte
 

What's hot (7)

Mathematical Induction
Mathematical InductionMathematical Induction
Mathematical Induction
 
Proof By Contradictions
Proof By ContradictionsProof By Contradictions
Proof By Contradictions
 
Sol80
Sol80Sol80
Sol80
 
Joint variation
Joint variationJoint variation
Joint variation
 
11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)11X1 T14 09 mathematical induction 2 (2010)
11X1 T14 09 mathematical induction 2 (2010)
 
Yet another prime formula to prove open problems
Yet another prime formula to prove open problemsYet another prime formula to prove open problems
Yet another prime formula to prove open problems
 
Discrete Math Lecture 03: Methods of Proof
Discrete Math Lecture 03: Methods of ProofDiscrete Math Lecture 03: Methods of Proof
Discrete Math Lecture 03: Methods of Proof
 

Viewers also liked (20)

Barangolások a baltikumban észtország tallinn városháza, kadriorg park
Barangolások a baltikumban észtország tallinn városháza, kadriorg parkBarangolások a baltikumban észtország tallinn városháza, kadriorg park
Barangolások a baltikumban észtország tallinn városháza, kadriorg park
 
Sol43
Sol43Sol43
Sol43
 
Sol54
Sol54Sol54
Sol54
 
Sol44
Sol44Sol44
Sol44
 
Sol61
Sol61Sol61
Sol61
 
Sol64
Sol64Sol64
Sol64
 
Sol62
Sol62Sol62
Sol62
 
Sol38
Sol38Sol38
Sol38
 
Sol53
Sol53Sol53
Sol53
 
Cert82093621427
Cert82093621427Cert82093621427
Cert82093621427
 
Sol42
Sol42Sol42
Sol42
 
Jurnal ilmiah hapalan shalat delisa
Jurnal ilmiah hapalan shalat delisaJurnal ilmiah hapalan shalat delisa
Jurnal ilmiah hapalan shalat delisa
 
Sol49
Sol49Sol49
Sol49
 
Sol41
Sol41Sol41
Sol41
 
Fisica
FisicaFisica
Fisica
 
Sol57
Sol57Sol57
Sol57
 
Sol45
Sol45Sol45
Sol45
 
Sol48
Sol48Sol48
Sol48
 
Sol56
Sol56Sol56
Sol56
 
Green Dentistry
Green DentistryGreen Dentistry
Green Dentistry
 

Similar to Sol46 (20)

The 2 Goldbach's Conjectures with Proof
The 2 Goldbach's Conjectures with Proof The 2 Goldbach's Conjectures with Proof
The 2 Goldbach's Conjectures with Proof
 
Sol44
Sol44Sol44
Sol44
 
Sol80
Sol80Sol80
Sol80
 
Sol74
Sol74Sol74
Sol74
 
Sol18
Sol18Sol18
Sol18
 
Sol18
Sol18Sol18
Sol18
 
Shark attacks and the Poisson approximationByron Schmuland.docx
Shark attacks and the Poisson approximationByron Schmuland.docxShark attacks and the Poisson approximationByron Schmuland.docx
Shark attacks and the Poisson approximationByron Schmuland.docx
 
Introduction to probability solutions manual
Introduction to probability   solutions manualIntroduction to probability   solutions manual
Introduction to probability solutions manual
 
A0740103
A0740103A0740103
A0740103
 
Proof Techniques
Proof TechniquesProof Techniques
Proof Techniques
 
Sol66
Sol66Sol66
Sol66
 
Sol16
Sol16Sol16
Sol16
 
Sol16
Sol16Sol16
Sol16
 
Sol60
Sol60Sol60
Sol60
 
Sol60
Sol60Sol60
Sol60
 
Sol4
Sol4Sol4
Sol4
 
Sol4
Sol4Sol4
Sol4
 
01_AJMS_158_18_RA.pdf
01_AJMS_158_18_RA.pdf01_AJMS_158_18_RA.pdf
01_AJMS_158_18_RA.pdf
 
01_AJMS_158_18_RA.pdf
01_AJMS_158_18_RA.pdf01_AJMS_158_18_RA.pdf
01_AJMS_158_18_RA.pdf
 
Sol38
Sol38Sol38
Sol38
 

More from eli priyatna laidan

Up ppg daljab latihan soal-pgsd-set-2
Up ppg daljab latihan soal-pgsd-set-2Up ppg daljab latihan soal-pgsd-set-2
Up ppg daljab latihan soal-pgsd-set-2eli priyatna laidan
 
Soal up sosial kepribadian pendidik 5
Soal up sosial kepribadian pendidik 5Soal up sosial kepribadian pendidik 5
Soal up sosial kepribadian pendidik 5eli priyatna laidan
 
Soal up sosial kepribadian pendidik 4
Soal up sosial kepribadian pendidik 4Soal up sosial kepribadian pendidik 4
Soal up sosial kepribadian pendidik 4eli priyatna laidan
 
Soal up sosial kepribadian pendidik 3
Soal up sosial kepribadian pendidik 3Soal up sosial kepribadian pendidik 3
Soal up sosial kepribadian pendidik 3eli priyatna laidan
 
Soal up sosial kepribadian pendidik 2
Soal up sosial kepribadian pendidik 2Soal up sosial kepribadian pendidik 2
Soal up sosial kepribadian pendidik 2eli priyatna laidan
 
Soal up sosial kepribadian pendidik 1
Soal up sosial kepribadian pendidik 1Soal up sosial kepribadian pendidik 1
Soal up sosial kepribadian pendidik 1eli priyatna laidan
 
Soal sospri ukm ulang i 2017 1 (1)
Soal sospri ukm ulang i 2017 1 (1)Soal sospri ukm ulang i 2017 1 (1)
Soal sospri ukm ulang i 2017 1 (1)eli priyatna laidan
 
Soal perkembangan kognitif peserta didik
Soal perkembangan kognitif peserta didikSoal perkembangan kognitif peserta didik
Soal perkembangan kognitif peserta didikeli priyatna laidan
 
Soal latihan utn pedagogik plpg 2017
Soal latihan utn pedagogik plpg 2017Soal latihan utn pedagogik plpg 2017
Soal latihan utn pedagogik plpg 2017eli priyatna laidan
 
Bank soal pedagogik terbaru 175 soal-v2
Bank soal pedagogik terbaru 175 soal-v2Bank soal pedagogik terbaru 175 soal-v2
Bank soal pedagogik terbaru 175 soal-v2eli priyatna laidan
 

More from eli priyatna laidan (20)

Up ppg daljab latihan soal-pgsd-set-2
Up ppg daljab latihan soal-pgsd-set-2Up ppg daljab latihan soal-pgsd-set-2
Up ppg daljab latihan soal-pgsd-set-2
 
Soal utn plus kunci gurusd.net
Soal utn plus kunci gurusd.netSoal utn plus kunci gurusd.net
Soal utn plus kunci gurusd.net
 
Soal up sosial kepribadian pendidik 5
Soal up sosial kepribadian pendidik 5Soal up sosial kepribadian pendidik 5
Soal up sosial kepribadian pendidik 5
 
Soal up sosial kepribadian pendidik 4
Soal up sosial kepribadian pendidik 4Soal up sosial kepribadian pendidik 4
Soal up sosial kepribadian pendidik 4
 
Soal up sosial kepribadian pendidik 3
Soal up sosial kepribadian pendidik 3Soal up sosial kepribadian pendidik 3
Soal up sosial kepribadian pendidik 3
 
Soal up sosial kepribadian pendidik 2
Soal up sosial kepribadian pendidik 2Soal up sosial kepribadian pendidik 2
Soal up sosial kepribadian pendidik 2
 
Soal up sosial kepribadian pendidik 1
Soal up sosial kepribadian pendidik 1Soal up sosial kepribadian pendidik 1
Soal up sosial kepribadian pendidik 1
 
Soal up akmal
Soal up akmalSoal up akmal
Soal up akmal
 
Soal tkp serta kunci jawabannya
Soal tkp serta kunci jawabannyaSoal tkp serta kunci jawabannya
Soal tkp serta kunci jawabannya
 
Soal tes wawasan kebangsaan
Soal tes wawasan kebangsaanSoal tes wawasan kebangsaan
Soal tes wawasan kebangsaan
 
Soal sospri ukm ulang i 2017 1 (1)
Soal sospri ukm ulang i 2017 1 (1)Soal sospri ukm ulang i 2017 1 (1)
Soal sospri ukm ulang i 2017 1 (1)
 
Soal perkembangan kognitif peserta didik
Soal perkembangan kognitif peserta didikSoal perkembangan kognitif peserta didik
Soal perkembangan kognitif peserta didik
 
Soal latihan utn pedagogik plpg 2017
Soal latihan utn pedagogik plpg 2017Soal latihan utn pedagogik plpg 2017
Soal latihan utn pedagogik plpg 2017
 
Rekap soal kompetensi pedagogi
Rekap soal kompetensi pedagogiRekap soal kompetensi pedagogi
Rekap soal kompetensi pedagogi
 
Bank soal pedagogik terbaru 175 soal-v2
Bank soal pedagogik terbaru 175 soal-v2Bank soal pedagogik terbaru 175 soal-v2
Bank soal pedagogik terbaru 175 soal-v2
 
Bank soal ppg
Bank soal ppgBank soal ppg
Bank soal ppg
 
Soal cpns-paket-17
Soal cpns-paket-17Soal cpns-paket-17
Soal cpns-paket-17
 
Soal cpns-paket-14
Soal cpns-paket-14Soal cpns-paket-14
Soal cpns-paket-14
 
Soal cpns-paket-13
Soal cpns-paket-13Soal cpns-paket-13
Soal cpns-paket-13
 
Soal cpns-paket-12
Soal cpns-paket-12Soal cpns-paket-12
Soal cpns-paket-12
 

Recently uploaded

CNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In PakistanCNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In Pakistandanishmna97
 
Ransomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdfRansomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdfOverkill Security
 
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...apidays
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...Martijn de Jong
 
FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024The Digital Insurer
 
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Victor Rentea
 
Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024The Digital Insurer
 
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodJuan lago vázquez
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024The Digital Insurer
 
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...Jeffrey Haguewood
 
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptxCorporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptxRustici Software
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...apidays
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FMESafe Software
 
[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdf[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdfSandro Moreira
 
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamDEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamUiPathCommunity
 
DBX First Quarter 2024 Investor Presentation
DBX First Quarter 2024 Investor PresentationDBX First Quarter 2024 Investor Presentation
DBX First Quarter 2024 Investor PresentationDropbox
 
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire businessWhy Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire businesspanagenda
 
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...apidays
 
MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024MIND CTI
 
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdfRising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdfOrbitshub
 

Recently uploaded (20)

CNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In PakistanCNIC Information System with Pakdata Cf In Pakistan
CNIC Information System with Pakdata Cf In Pakistan
 
Ransomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdfRansomware_Q4_2023. The report. [EN].pdf
Ransomware_Q4_2023. The report. [EN].pdf
 
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024
 
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
 
Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024
 
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...
Web Form Automation for Bonterra Impact Management (fka Social Solutions Apri...
 
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptxCorporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdf[BuildWithAI] Introduction to Gemini.pdf
[BuildWithAI] Introduction to Gemini.pdf
 
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamDEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
 
DBX First Quarter 2024 Investor Presentation
DBX First Quarter 2024 Investor PresentationDBX First Quarter 2024 Investor Presentation
DBX First Quarter 2024 Investor Presentation
 
Why Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire businessWhy Teams call analytics are critical to your entire business
Why Teams call analytics are critical to your entire business
 
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
Apidays New York 2024 - Passkeys: Developing APIs to enable passwordless auth...
 
MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024
 
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdfRising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf
Rising Above_ Dubai Floods and the Fortitude of Dubai International Airport.pdf
 

Sol46

  • 1. Solution Week 46 (7/28/03) The birthday problem (a) Given n people, the probability, Pn, that there is not a common birthday among them is Pn = 1 − 1 365 1 − 2 365 · · · 1 − n − 1 365 . (1) The first factor is the probability that two given people do not have the same birthday. The second factor is the probability that a third person does not have a birthday in common with either of the first two. This continues until the last factor is the probability that the nth person does not have a birthday in common with any of the other n − 1 people. We want Pn < 1/2. If we simply multiply out the above product with suc- cessive values of n, we find that P22 = .524, and P23 = .493. Therefore, there must be at least 23 people in a room in order for the odds to favor at least two of them having the same birthday. Remark: This answer of n = 23 is much smaller than most people expect, so it provides a nice betting opportunity. For n = 30, the odds of a common birthday increase to 70.6%, and most people still find it hard to believe that among 30 people there are probably two who have the same birthday. The table below lists various values of n and the probabilities, 1 − Pn, that at least two people have a common birthday. n 10 20 23 30 50 60 70 100 1 − Pn 11.7% 41.1% 50.7% 70.6% 97.0% 99.4% 99.92% 99.9994% Even for n = 50, most people would be happy to bet, at even odds, that no two people have the same birthday. If they seem a bit hesitant, however, you can simply offer them the irrefusable odds of 10 to 1. (That is, you put down, for example, $10 on the table, and they put down $1. If there is a common birthday, you take all the money. If there is no common birthday, they take all the money.) Since there is a 97.0% chance of a common birthday among 50 people, a quick calculation shows that you will gain, on average, 67 cents for every $10 you put down. One reason why many people do not believe the n = 23 answer is correct is that they are asking themselves a different question, namely, “How many people need to be present for there to be a 1/2 chance that someone else has my birthday?” The answer to this question is indeed much larger than 23. The probability that no one out of n people has a birthday on a given day is (1 − 1/365)n . For n = 252, this is just over 1/2. And for n = 253, it is just under 1/2. Therefore, you need to come across 253 other people in order to expect that at least one of them has your birthday. (b) First Solution: Given n people, and given N days in a year, the reasoning in part (a) shows that the probability that no two people have the same birthday is Pn = 1 − 1 N 1 − 2 N · · · 1 − n − 1 N . (2) 1
  • 2. If we take the natural log of this equation and use the expansion, ln(1 − x) = −(x + x2 /2 + · · ·), (3) then the requirement Pn ≤ 1/2 becomes − 1 N + 2 N + · · · n − 1 N − 1 2 1 N2 + 4 N2 + · · · (n − 1)2 N2 −· · · ≤ − ln 2. (4) Using the sums, n 1 k = n(n + 1) 2 , and n 1 k2 = n(n + 1)(2n + 1) 6 , (5) we can rewrite eq. (4) as n(n − 1) 2N + n(n − 1)(2n − 1) 12N2 + · · · ≥ ln 2. (6) For large N, the first term will be of order 1 when n ≈ √ N, in which case the second- and higher-order terms are negligible. Therefore, keeping only the first term (which behaves like n2/2N), we find that Pn is equal to 1/2 when n ≈ √ 2 ln 2 √ N. (7) Let’s look at a few cases: • For N = 365, eq. (7) gives n = 22.5. Since we must have an integral number of people, this agrees with the exact result, n = 23. • For N = 24 · 365 = 8760 (that is, for births in the same hour), we find n = 110.2. This agrees with the exact result, n = 111, obtained by multiplying out eq. (2). • For N = 60 · 24 · 365 = 525, 600 (that is, for births in the same minute), we find n = 853.6. This agrees with the exact result, n = 854, obtained by multiplying out eq. (2) (not by hand!). This is a very small number compared to the more than half a million minutes in a year. Remarks: (1) If we wish to ask how many people need to be in a room in order for the probability to be at least p that some two have the same birthday, then the above derivation is easily modified to yield n ≈ 2 ln( 1 1−p ) √ N. (8) (2) The alternative question introduced in part (a), “How many people need to be present for there to be a 1/2 chance that someone else has my birthday?”, may also be answered in the large-N limit. The probability that no one out of n people has a birthday on a given day is 1 − 1 N n = 1 − 1 N N(n/N) ≈ e−n/N . (9) 2
  • 3. Therefore, if n > N ln 2, you can expect that at least one of the n people has your birthday. For N = 365, we find that N ln 2 is slightly less than 253, so this agrees with the result obtained in part (a). Note that this result is linear in N, whereas the result of the original problem in eq. (7) behaves like √ N. The reason for this square-root behavior can be seen in the next solution. Second Solution: Given a large number, n, of people, there are n 2 = n(n − 1)/2 ≈ n2/2 pairs of people. The probability that a given pair has the same birthday is 1/N, so the probability that they do not have the same birthday is 1 − 1/N.1 Therefore, the probability that no pair has a common birthday is Pn = 1 − 1 N n2/2 ≈ 1 − 1 N N(n2/2N) ≈ e−n2/(2N) . (10) This equals 1/2 when n ≈ √ 2 ln 2 √ N. (11) in agreement with eq. (7). Remark: We assumed above that all the pairs are independent, as far as writing down the 1 − 1/N probability goes. Let us now show that this approximately true. We will show that for large N and n, the assumptions on the coincidence of birthdays in some pairs do not significantly affect the probability of coincidence in other pairs. More precisely, the relation Pn ≈ e−n2 /(2N) is true if n N2/3 . The reasoning is as follows. Consider n people and N days in a year. Assumptions on the coincidence of birthdays in some pairs will slightly affect the probability of coincidence in other pairs, because the given assumptions restrict the possible birthdays of these other pairs. For example, if it is given that A and B do not have the same birthday, and also that B and C do not, then the probability that A and C do not have the same birthday is 1 − 1/364 (instead of 1 − 1/365), because they are both restricted from having a birthday on B’s birthday, whatever it may be. The maximal restriction that can be placed on the possible birthdays of a given pair occurs when it is known that neither of them has a birthday in common with any of the other n − 2 people. In this case, the possible birthdays for the last two people are restricted to N − (n − 2) days of the year. Therefore, the probability that the last pair does not have a common birthday is 1 − 1/(N − n + 2) > 1 − 1/(N − n). This is the most that any such probability can differ from the naive 1 − 1/N. Therefore, we may say that 1 − 1 N − n n2 /2 ≤ Pn ≤ 1 − 1 N n2 /2 =⇒ e−n2 /2(N−n) ≤ Pn ≤ e−n2 /(2N) . (12) The ratio of these upper and lower bounds on Pn is exp − n2 2N + n2 2(N − n) = exp n3 2N(N − n) . (13) 1 This is not quite correct for all the pairs, because two pairs are not independent if, for example, they share a common person. But it is accurate enough for our purposes in the large-N limit. See the remark below. 3
  • 4. For large N, this ratio is essentially equal to 1, provided that n N2/3 . Therefore, Pn ≈ e−n2 /(2N) if n N2/3 . And since the result in eq. (11) is in this realm, it is therefore valid. Extension: We can also ask the following question: How many people must be in a room in order for the probability to be greater than 1/2 that at least b of them have the same birthday? (Assume that there is a very large number, N, of days in a year, and ignore effects that are of subleading order in N.) We can solve this problem in the manner of the second solution above. Given a large number, n, of people, there are n b groups of b people. This is approx- imately equal to nb/b! (assuming that b n). The probability that a given group of b people all have the same birthday is 1/Nb−1, so the probability that they do not all have the same birthday is 1 − (1/Nb−1). 2 Therefore, the probability, P (b) n , that no group of b people all have the same birthday is P(b) n ≈ 1 − 1 Nb−1 nb/b! ≈ e−nb/b!Nb−1 . (14) This equals 1/2 when n ≈ (b! ln 2)1/b N1−1/b . (15) Remarks: (1) Eq. (15) holds in the large-N limit. If we wish to make another approximation, that of large b, we see that the quantity (b! ln 2)1/b goes like b/e, for large b. (This follows from Sterling’s formula, m! ≈ mm e−m √ 2πm.) Therefore, for large N, n, and b (with b n N), we have P (b) n = 1/2 when n ≈ (b/e)N1−1/b . (16) (2) The right-hand side of equation eq. (15) scales with N according to N1−1/b . This means that if we look at the numbers of people needed to have a greater than 1/2 chance that pairs, triplets, etc., have common birthdays, we see that these numbers scale like N1/2 , N2/3 , N3/4 , · · · . (17) For large N, these numbers are multiplicatively far apart. Therefore, there are values of n for which we can say, for example, that we are virtually certain that there are pairs and triplets with common birthdays, but also that we are virtually certain that there are no quadruplets with a common birthday. For example, if n = N17/24 (which satisfies N2/3 < n < N3/4 ), then eq. (14) shows that the probability that there is a common birthday triplet is 1 − e− 1 6 N1/8 ≈ 1, whereas the probability that there is a common birthday quadruplet is 1 − e− 1 24 N−1/6 ≈ 1 24 N−1/6 ≈ 0. 2 Again, this is not quite correct, because the groups are not all independent. But I believe it is accurate enough for our purposes in the large-N limit. I have a proof which I think is correct, but which is very ugly. If anyone has a nice clean proof, let me know. 4