exercise:Fe337626cd: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> Consider the problem of finding the probability of more than one coincidence of birthdays in a group of <math>n</math> people. These include, for example, three people with the same birthday, or two pairs of people with the same birthday, or larg...") |
No edit summary |
||
| Line 1: | Line 1: | ||
Consider the problem of finding the probability of more than one coincidence of birthdays in a group of <math>n</math> people. These include, for example, three people with the same birthday, or two pairs of people with the same birthday, or | |||
one coincidence of birthdays in a group of <math>n</math> people. These include, for example, | |||
three people with the same birthday, or two pairs of people with the same birthday, or | |||
larger coincidences. Show how you could compute this probability, and write a | larger coincidences. Show how you could compute this probability, and write a | ||
computer program to carry out this computation. Use your program to find the smallest | computer program to carry out this computation. Use your program to find the smallest | ||
number of people for which it would be a favorable bet that there would be more than | number of people for which it would be a favorable bet that there would be more than | ||
one coincidence of birthdays. | one coincidence of birthdays. | ||
Latest revision as of 23:46, 12 June 2024
Consider the problem of finding the probability of more than one coincidence of birthdays in a group of [math]n[/math] people. These include, for example, three people with the same birthday, or two pairs of people with the same birthday, or larger coincidences. Show how you could compute this probability, and write a computer program to carry out this computation. Use your program to find the smallest number of people for which it would be a favorable bet that there would be more than one coincidence of birthdays.