Contact Us

If you're interested in working with us, email us the answer to the question below (show your work).

Three men have respectively l, m, and n coins which they match so that the odd man wins. In case all coins appear alike they repeat the throw. Find the average number of tosses required until one man is forced out of the game.

Email: c[at symbol][url of this site]