EECS
203w07hw8

203w07hw8 - EECS 203 Discrete Mathematics Winter 2007...

• Notes
• 1

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

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
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 ﬁ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

• Winter '07
• YaoyunShi
• Ann Arbor

{[ snackBarMessage ]}

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern