203w07hw9 - requirements: There are at most 6 yellow tulips...

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 9 Problems from the Textbook 5.4 14[E], 22[E], 30[M] 5.5 16[M], 30[E], 46[M], 62[E] * Additional Problems Required for All Students Problem A9.1 (E). Let n 0 be an integer. Prove the following identity 1 n + 1 2 n +1 - 1 = n X i =0 ± n i ² 1 i + 1 . Problem A9.2 (C). Let n 1 be an integer and A be a set of n elements. Suppose f, g : 2 A R satisfy f ( x ) = X y : x y A g ( y ) , x A. Prove that g ( y ) = X x : y x A ( - 1) | x - y | f ( x ) , x A. * Extra Credit Problem A9.3. Cecilia goes to the florist to order 100 flowers for a special event. She has the following
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: requirements: There are at most 6 yellow tulips and at most 6 purple tulips. The number of orchids is a multiple of 5. There are at most 4 lilies. The number of roses must be a multiple of 7. Each is either red or blue, but at most 1 / 7 of them are blue. In how many combinations she can order the owers? 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