jump to navigation

Problem of the Day #17: Starcraft Tournament April 5, 2011

Posted by Seungln in : potd , trackback

After getting sick of Sreenath’s jokes about spiders on his head, Seungln challenges Sreenath to play a series of Starcraft games against him. The rules are as follows:

If Seungln has a 60% chance of beating Sreenath, and there is no draw in Starcraft, then the probability that Sreenath will have to kill all the spiders in the world can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime. Find $n-m$.




no comments yet - be the first?