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: the alphabet (A,B,C) which: (a) have exactly one A (b) have no A 1 2 (c) have at least one A (d) have exactly 3 As and exactly 3 Bs (e) have at least one of each of the three letters (3) How many binary strings of length 8 have: (a) exactly 5 ones (b) exactly 3 ones in the leftmost 4 places (c) more ones than zeros (4) Find the coecient of x 1 0 in (2 + x ) 40...
View Full Document
This note was uploaded on 11/08/2009 for the course MATH 2602 taught by Professor Costello during the Spring '09 term at Georgia Institute of Technology.
- Spring '09