This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MATH 109 Assignment 6 Due: 5/16/11 #12.4 Solution. Let X, Y, Z be the possible dishes that each of the three diners can choose respectively. Since the menu consists of five items we have  X  =  Y  =  Z  = 5. The set X Y Z represents the set of choices possible if we record who selected which dish. Hence, by the multiplication principle (Theorem 10.2.3), there are  X Y Z  =  X  Y  Z  = 5 3 choices. If we do not care who orders which dish, then there are (i) 5 ways for the diners to choose one dish from the menu, (ii) ( 5 2 ) 2 = 20 ways for the diners to choose two dishes from the menu, since one dish is chosen once and the other dish is chosen twice, (iii) ( 5 3 ) = 10 ways for the diners to choose three dishes from the menu. Hence, in total, there are 35 choices if we do not care who orders which dish. #14.1 Proof. Since A is finite, we have A \ B is too, so write A \ B = { x 1 . . . , x n } . Observe that A B = ( A \ B ) B and that A \ B and B are disjoint. Asare disjoint....
View Full
Document
 Spring '06
 Knutson
 Math

Click to edit the document details