This is the archived website of SI 486H from the Spring 2016 semester. Feel free to browse around; you may also find more recent offerings at my teaching page.

Problem 37

Most likely running time

Due: February 9
Points: 2

This is an extension of Problem 36.

In that problem, you computed the expected number of Mids that needed to be polled to find a Delawarean.

For this problem, compute a table for \(n=1\) up to \(n=10\) that exactly that many Mids are polled before a Delawarean is found.

Then answer: what is the single most likely number of Mids that are selected before finding a Delawarean?