exercise:B52419720c: 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> As in Exercise Exercise, assume that we have a sequence of occurrences, but now assume that the time <math>X</math> between occurrences is uniformly distributed between 5 and 15. As before, you come upon this system at t...") |
No edit summary |
||
| Line 5: | Line 5: | ||
\newcommand{\secstoprocess}{\all} | \newcommand{\secstoprocess}{\all} | ||
\newcommand{\NA}{{\rm NA}} | \newcommand{\NA}{{\rm NA}} | ||
\newcommand{\mathds}{\mathbb}</math></div> As in | \newcommand{\mathds}{\mathbb}</math></div> | ||
of occurrences, but now assume that the time <math>X</math> between occurrences is uniformly distributed | |||
As in [[exercise:8b408c8df0 |Exercise]], assume that we have a sequence of occurrences, but now assume that the time <math>X</math> between occurrences is uniformly distributed | |||
between 5 and 15. As before, you come upon this system at time 100, and wait until the next | between 5 and 15. As before, you come upon this system at time 100, and wait until the next | ||
occurrence. Make a conjecture concerning how long, on the average, you will have to wait. | occurrence. Make a conjecture concerning how long, on the average, you will have to wait. | ||
Write a program to see if your conjecture is right. | Write a program to see if your conjecture is right. | ||
Latest revision as of 22:40, 12 June 2024
[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]
As in Exercise, assume that we have a sequence of occurrences, but now assume that the time [math]X[/math] between occurrences is uniformly distributed between 5 and 15. As before, you come upon this system at time 100, and wait until the next occurrence. Make a conjecture concerning how long, on the average, you will have to wait. Write a program to see if your conjecture is right.