This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 173: Discrete Structures, Spring 2010 Homework 9 This homework contains 5 problems worth a total of 52 regular points. It is due on Friday, April 16th at 4pm. Put your homework in the appropriate dropbox in the Siebel basement. 1. Off to the races! [10 points] You decide to take in a day of races at the local horse racing track and are particularly interested in the action involving races number 1 and 2 for the day. In the first race there are 12 horses and in the second race there are 8. In both races the horses are given numbers, 1 through 12 in the first case and 1 through 8 in the second. At the conclusion of the race, the horses will be placed in the order they have finished. With photo finishes and other snazzy gadgets we assume that there is never a tie. In order to strategically use your money, you’ve decided to do a couple of calculations to see just how many different ways certain things can happen for some of the various bets. (a) How many different outcomes (i.e. orderings of all the horses) are there for each of the two races? How many possibilities for the sequence of two races? (b) A “trifecta” is a particularly well paying bet where you pick the first place, second place, and third place horses for a single race. Convinced that horse 4 will win first, horse 2 will win second and horse 10 will win third in the first race, you decide to buy a trifecta ticket to this effect. In how many different outcomes of the first race will you win money? (c) If you pay twice as much money, you can “box” a trifecta and then you only have to pick the first three finishing horses without placing them in their specific order (this...
View Full Document
- Spring '08
- Tree structure, Prof J, ﬁrst race