This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 173: Discrete Structures, Fall 2010 Homework 9 This homework contains 4 problems worth a total of 44 points. It is due on Friday, Novomber 12 at 4pm. Put your homework in the appropriate dropbox in the Siebel basement. 1. Counting [12 points] (a) (4 points) Suppose a set S has 11 elements. How many subsets of S have an even number of elements? Express your answer as a summation. (You do not need to simplify expressions involving permutations and/or combinations.) (b) (4 points) How many distinct strings can be formed by the letters in the word EISENSTEIN using all letters? (c) (4 points) If x,y,z ∈ N , how many solutions are there to the equation x + y + z = 25? 2. Counting and polynomials [12 points] (a) (4 points) How many terms are contained in ( x + y + z ) 30 after carrying out all multiplications, but before collecting like terms? (b) (4 points) How many terms are contained in ( x + y + z ) 30 after carrying out all multiplications and collecting like terms?...
View
Full Document
 Spring '08
 [email protected]
 Graph Theory, Tree structure, Siebel

Click to edit the document details