The birthday paradox in probability theory asks what is the probability that in a set of n randomly chosen people, at least two of them share the same birthday. It is referred to as a paradox because many people wouldn't believe it when you hear the answer. In a room of 23 randomly chosen people, the probability that at least two of them share the same birthday is around 50%! Can you believe it? So even in smaller classes at SBU, the probability that at least two people share the same birthday is close to 100%! Instead of expecting you to simply accept this conclusion, we will be doing a little experiment to convince you that it's valid. Complete the function birthday_paradox, which takes one parameter, num_students, the number of students in a room. The function generates num_students random integers in the range [1, 365] and returns False if the values are all unique, or True if there is at least one duplicated value. As num_students increases, the likelihood that there is at least one duplicated value also increases, and rather quickly, at that! Hint: You can use the function set ( ) to take a list and create a copy that contains only the unique values. For example: x = [1, 2, 3, 3] y = set (x) Then y will be {1, 2, 3}. (The use of curly braces indicates that we have a set, a collection of unique values.) Consider what information you can glean (and what conclusions you can draw) by looking at the length of this new list. Note For experiments involving random values, it can be difficult to give examples of expected output. For this part, Colab will call your function many times to perform many simulations, and then report the average outcome. Your results may not exactly match the expected outcomes, but they should be "close". [ ] 1 import random 2 3 def birthday_paradox (num_students): 4 5 6 7 # Do not edit anything below this line 8 def birthday_trials (num_students, num_trials): 9 10 11 12 13 14 15 # Test cases # should be approx. 0.12 # should be approx. 0.51 16 print (birthday_trials (10, 10000)) 17 print (birthday_trials (23, 10000)) 18 print (birthday_trials(5, 10000)) # should be approx. 0.025 19 print (birthday_trials (100, 10000)) # should be approx. 1.0 20 return 0 # DELETE THIS LINE and start coding here. # Remember: end all of your functions with a return statement, not a print statement! same_birthday = 0 for i in range(num_trials): if birthday_paradox (num_students): same_birthday += 1 return same_birthday / num_trials
The birthday paradox in probability theory asks what is the probability that in a set of n randomly chosen people, at least two of them share the same birthday. It is referred to as a paradox because many people wouldn't believe it when you hear the answer. In a room of 23 randomly chosen people, the probability that at least two of them share the same birthday is around 50%! Can you believe it? So even in smaller classes at SBU, the probability that at least two people share the same birthday is close to 100%! Instead of expecting you to simply accept this conclusion, we will be doing a little experiment to convince you that it's valid. Complete the function birthday_paradox, which takes one parameter, num_students, the number of students in a room. The function generates num_students random integers in the range [1, 365] and returns False if the values are all unique, or True if there is at least one duplicated value. As num_students increases, the likelihood that there is at least one duplicated value also increases, and rather quickly, at that! Hint: You can use the function set ( ) to take a list and create a copy that contains only the unique values. For example: x = [1, 2, 3, 3] y = set (x) Then y will be {1, 2, 3}. (The use of curly braces indicates that we have a set, a collection of unique values.) Consider what information you can glean (and what conclusions you can draw) by looking at the length of this new list. Note For experiments involving random values, it can be difficult to give examples of expected output. For this part, Colab will call your function many times to perform many simulations, and then report the average outcome. Your results may not exactly match the expected outcomes, but they should be "close". [ ] 1 import random 2 3 def birthday_paradox (num_students): 4 5 6 7 # Do not edit anything below this line 8 def birthday_trials (num_students, num_trials): 9 10 11 12 13 14 15 # Test cases # should be approx. 0.12 # should be approx. 0.51 16 print (birthday_trials (10, 10000)) 17 print (birthday_trials (23, 10000)) 18 print (birthday_trials(5, 10000)) # should be approx. 0.025 19 print (birthday_trials (100, 10000)) # should be approx. 1.0 20 return 0 # DELETE THIS LINE and start coding here. # Remember: end all of your functions with a return statement, not a print statement! same_birthday = 0 for i in range(num_trials): if birthday_paradox (num_students): same_birthday += 1 return same_birthday / num_trials
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![The birthday paradox in probability theory asks what is the probability that in a set of n randomly chosen people, at least two of them share the
same birthday.
It is referred to as a paradox because many people wouldn't believe it when you hear the answer. In a room of 23 randomly chosen people, the
probability that at least two of them share the same birthday is around 50%! Can you believe it? So even in smaller classes at SBU, the
probability that at least two people share the same birthday is close to 100%!
Instead of expecting you to simply accept this conclusion, we will be doing a little experiment to convince you that it's valid. Complete the
function birthday_paradox, which takes one parameter, num_students, the number of students in a room. The function generates
num_students random integers in the range [1, 365] and returns False if the values are all unique, or True if there is at least one duplicated
value. As num_students increases, the likelihood that there is at least one duplicated value also increases, and rather quickly, at that!
Hint: You can use the function set () to take a list and create a copy that contains only the unique values. For example:
x = [1, 2, 3, 3]
y = set (x)
Then y
will be {1, 2, 3}. (The use of curly braces indicates that we have a set, a collection of unique values.) Consider what information you
can glean (and what conclusions you can draw) by looking at the length of this new list.
Note
For experiments involving random values, it can be difficult to give examples of expected output. For this part, Colab will call your function many
times to perform many simulations, and then report the average outcome. Your results may not exactly match the expected outcomes, but they
should be "close".
[ ]
1 import random
2
3 def birthday_paradox (num_students):
4
5
6
7 # Do not edit anything below this line
8 def birthday_trials (num_students, num_trials):
9
10
11
12
13
14
15 # Test cases
16 print (birthday_trials (10, 10000)) # should be approx. 0.12
17 print (birthday_trials (23, 10000))
# should be approx. 0.51
# should be approx. 0.025
18 print (birthday_trials(5, 10000))
19 print (birthday_trials (100, 10000))
20
# should be approx. 1.0
return 0 # DELETE THIS LINE and start coding here.
# Remember: end all of your functions with a return statement, not a print statement!
same_birthday = 0
for i in range(num_trials):
if birthday_paradox (num_students):
same_birthday += 1
return same_birthday / num_trials](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa684ef64-b106-44e3-b477-7930de74cd26%2Fa4f3df94-da0f-4f8a-9253-c8aa12d5fd3e%2F5dffrus_processed.png&w=3840&q=75)
Transcribed Image Text:The birthday paradox in probability theory asks what is the probability that in a set of n randomly chosen people, at least two of them share the
same birthday.
It is referred to as a paradox because many people wouldn't believe it when you hear the answer. In a room of 23 randomly chosen people, the
probability that at least two of them share the same birthday is around 50%! Can you believe it? So even in smaller classes at SBU, the
probability that at least two people share the same birthday is close to 100%!
Instead of expecting you to simply accept this conclusion, we will be doing a little experiment to convince you that it's valid. Complete the
function birthday_paradox, which takes one parameter, num_students, the number of students in a room. The function generates
num_students random integers in the range [1, 365] and returns False if the values are all unique, or True if there is at least one duplicated
value. As num_students increases, the likelihood that there is at least one duplicated value also increases, and rather quickly, at that!
Hint: You can use the function set () to take a list and create a copy that contains only the unique values. For example:
x = [1, 2, 3, 3]
y = set (x)
Then y
will be {1, 2, 3}. (The use of curly braces indicates that we have a set, a collection of unique values.) Consider what information you
can glean (and what conclusions you can draw) by looking at the length of this new list.
Note
For experiments involving random values, it can be difficult to give examples of expected output. For this part, Colab will call your function many
times to perform many simulations, and then report the average outcome. Your results may not exactly match the expected outcomes, but they
should be "close".
[ ]
1 import random
2
3 def birthday_paradox (num_students):
4
5
6
7 # Do not edit anything below this line
8 def birthday_trials (num_students, num_trials):
9
10
11
12
13
14
15 # Test cases
16 print (birthday_trials (10, 10000)) # should be approx. 0.12
17 print (birthday_trials (23, 10000))
# should be approx. 0.51
# should be approx. 0.025
18 print (birthday_trials(5, 10000))
19 print (birthday_trials (100, 10000))
20
# should be approx. 1.0
return 0 # DELETE THIS LINE and start coding here.
# Remember: end all of your functions with a return statement, not a print statement!
same_birthday = 0
for i in range(num_trials):
if birthday_paradox (num_students):
same_birthday += 1
return same_birthday / num_trials
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education