This preview shows page 1. Sign up to view the full content.
Unformatted text preview: edges are of the same color. Problem A8.2 (C) . How many ways are there for a horse race with n horses to ﬁnish if ties are possible? (Note: any number of the n horses may tie.) You will get half of the credit if you give the correct number for n = 4 (which is problem 42 of 5.4). 1...
View Full Document
This note was uploaded on 04/01/2008 for the course EECS 203 taught by Professor Yaoyunshi during the Winter '07 term at University of Michigan.
- Winter '07