184a_01f_1e

# 184a_01f_1e - 4 3 1 2 2 1 3 Warning It was proved in a...

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

Math 184A First Exam 15 October 2001 Please put your name and ID number on your blue book. The exam is CLOSED BOOK, but you may have a page of notes. Calculators are NOT allowed. You must show your work to receive credit. 1. Let A , B and C be ﬁnite sets. Suppose f : A B and g : B C are functions. Deﬁne h : A C by h ( x )= g ( f ( x )). (a) Prove or give a counterexample: If h is a surjection (an onto function), then f must be a surjection. (b) Prove or give a counterexample: If h is a surjection (an onto function), then g must be a surjection. 2. A 5 person committee is to be chosen from a set of 6 men and 7 women. (a) How many possible committees are there? (b) If the committee must contain at least 2 men and at least 2 women, how many possible committees are there? 3. Prove that exactly half of the 2 2 n - 1 compositions of 2 n contain at most n parts. For example, when n = 2 the compositions of 4 with at most 2 parts are
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4 3 + 1 2 + 2 1 + 3 . Warning : It was proved in a homework exercise that the average number of parts is (2 n + 1) / 2, but you cannot do the problem just by knowing the average number of parts. For example, the compositions in the set { 2 + 2 , 3 + 1 , 1 + 3 , 1 + 1 + 1 + 1 } have an average of (2 n + 1) / 2 parts but 3 / 4 of the compositions in the set have at most 2 parts. 4. We want to count 4-bead necklaces that can be made using a supply of k > 4 diﬀerent types of beads. (We allow rotations of a necklace, but not ﬂipping over.) (a) How many necklaces can be made if each type of bead can be used as often as you wish? (b) How many necklaces can be made if each type of bead can be used at most once in each necklace? END OF EXAM...
View Full Document

## This note was uploaded on 06/18/2009 for the course MATH 184a taught by Professor Staff during the Fall '08 term at UCSD.

Ask a homework question - tutors are online