exercise:Da2f6afa00: 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> Exactly one of six similar keys opens a certain door. If you try the keys, one after another, what is the expected number of keys that you will have to try before success?")
 
No edit summary
 
Line 1: Line 1:
<div class="d-none"><math>
Exactly one of six similar keys opens a certain door.  If you try the keys, one after another, what is the expected number of keys that you
\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> Exactly one of six similar keys opens a certain door.  If
you try the keys, one after another, what is the expected number of keys that you
will have to try before success?
will have to try before success?

Latest revision as of 16:32, 14 June 2024

Exactly one of six similar keys opens a certain door. If you try the keys, one after another, what is the expected number of keys that you will have to try before success?