203w07hw8 - edges are of the same color Problem A8.2(C How many ways are there for a horse race with n horses to finish if ties are possible(Note

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 203, Discrete Mathematics Winter 2007, University of Michigan, Ann Arbor Problem Set 8 Problems from the Textbook 5.1 42[E], 50[E] 5.2 2[E], 18[E], 28[E] 5.3 10[E], 24[M], 40[M] * Additional Problems Required for All Students Problem A8.1 (E) . Give a coloring of the edges K 5 using blue and red such that there is no triangle whose
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 finish 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.

Ask a homework question - tutors are online