SlideShare uma empresa Scribd logo
1 de 4
Baixar para ler 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

Mais conteúdo relacionado

Mais procurados

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
 

Mais procurados (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
 

Destaque

10 module
10  module10  module
10 moduleAsif
 
Module 1
Module 1Module 1
Module 1Asif
 
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11Sander Potjer
 
Basic ip traffic management with access control lists
Basic ip traffic management with access control listsBasic ip traffic management with access control lists
Basic ip traffic management with access control listsSourabh Badve
 
Fungsi Hash & Algoritma SHA-256 - Presentation
Fungsi Hash & Algoritma SHA-256 - PresentationFungsi Hash & Algoritma SHA-256 - Presentation
Fungsi Hash & Algoritma SHA-256 - PresentationAditya Gusti Tammam
 
Year 1 sh 1
Year 1 sh   1 Year 1 sh   1
Year 1 sh 1 dmirbe
 
Cryptography with Zend Framework
Cryptography with Zend FrameworkCryptography with Zend Framework
Cryptography with Zend FrameworkEnrico Zimuel
 
CCNAv5 - S2: Chapter 9 Access Control Lists
CCNAv5 - S2: Chapter 9 Access Control ListsCCNAv5 - S2: Chapter 9 Access Control Lists
CCNAv5 - S2: Chapter 9 Access Control ListsVuz Dở Hơi
 
Graphical User Authentication
Graphical User AuthenticationGraphical User Authentication
Graphical User AuthenticationSarthak Gupta
 
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Hash Functions, the MD5 Algorithm and the Future (SHA-3)Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Hash Functions, the MD5 Algorithm and the Future (SHA-3)Dylan Field
 
Access Control List & its Types
Access Control List & its TypesAccess Control List & its Types
Access Control List & its TypesNetwax Lab
 
Information Security Principles - Access Control
Information Security  Principles -  Access ControlInformation Security  Principles -  Access Control
Information Security Principles - Access Controlidingolay
 
graphical password authentication
graphical password authenticationgraphical password authentication
graphical password authenticationAkhil Kumar
 

Destaque (20)

10 module
10  module10  module
10 module
 
sh (1)
sh (1)sh (1)
sh (1)
 
Module 1
Module 1Module 1
Module 1
 
sh[1]
sh[1]sh[1]
sh[1]
 
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11
Joomla Access Control List (ACL) at JoomlaDay London, UK #jduk11
 
Basic ip traffic management with access control lists
Basic ip traffic management with access control listsBasic ip traffic management with access control lists
Basic ip traffic management with access control lists
 
Fungsi Hash & Algoritma SHA-256 - Presentation
Fungsi Hash & Algoritma SHA-256 - PresentationFungsi Hash & Algoritma SHA-256 - Presentation
Fungsi Hash & Algoritma SHA-256 - Presentation
 
Year 1 sh 1
Year 1 sh   1 Year 1 sh   1
Year 1 sh 1
 
Cryptography
CryptographyCryptography
Cryptography
 
Cryptography with Zend Framework
Cryptography with Zend FrameworkCryptography with Zend Framework
Cryptography with Zend Framework
 
Md5
Md5Md5
Md5
 
CCNAv5 - S2: Chapter 9 Access Control Lists
CCNAv5 - S2: Chapter 9 Access Control ListsCCNAv5 - S2: Chapter 9 Access Control Lists
CCNAv5 - S2: Chapter 9 Access Control Lists
 
Graphical User Authentication
Graphical User AuthenticationGraphical User Authentication
Graphical User Authentication
 
Access control list
Access control listAccess control list
Access control list
 
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Hash Functions, the MD5 Algorithm and the Future (SHA-3)Hash Functions, the MD5 Algorithm and the Future (SHA-3)
Hash Functions, the MD5 Algorithm and the Future (SHA-3)
 
Access Control List & its Types
Access Control List & its TypesAccess Control List & its Types
Access Control List & its Types
 
Ch07 Access Control Fundamentals
Ch07 Access Control FundamentalsCh07 Access Control Fundamentals
Ch07 Access Control Fundamentals
 
Information Security Principles - Access Control
Information Security  Principles -  Access ControlInformation Security  Principles -  Access Control
Information Security Principles - Access Control
 
Acl ppt
Acl pptAcl ppt
Acl ppt
 
graphical password authentication
graphical password authenticationgraphical password authentication
graphical password authentication
 

Semelhante a 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
 
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
 

Mais de 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
 

Mais de 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
 

Último

GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdflior mazor
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerThousandEyes
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024The Digital Insurer
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityPrincipled Technologies
 
Tech Trends Report 2024 Future Today Institute.pdf
Tech Trends Report 2024 Future Today Institute.pdfTech Trends Report 2024 Future Today Institute.pdf
Tech Trends Report 2024 Future Today Institute.pdfhans926745
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024Rafal Los
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...Enterprise Knowledge
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsMaria Levchenko
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationSafe Software
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationRadu Cotescu
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Miguel Araújo
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Scriptwesley chun
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc
 
🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘RTylerCroy
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProduct Anonymous
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)Gabriella Davis
 

Último (20)

GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdf
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 
Tech Trends Report 2024 Future Today Institute.pdf
Tech Trends Report 2024 Future Today Institute.pdfTech Trends Report 2024 Future Today Institute.pdf
Tech Trends Report 2024 Future Today Institute.pdf
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024The 7 Things I Know About Cyber Security After 25 Years | April 2024
The 7 Things I Know About Cyber Security After 25 Years | April 2024
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...Driving Behavioral Change for Information Management through Data-Driven Gree...
Driving Behavioral Change for Information Management through Data-Driven Gree...
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organization
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
 
🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 

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