{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

184a_99f_fe

184a_99f_fe - Math 184A Final Exam 811AM Monday 1 AUTOMATIC...

This preview shows pages 1–2. Sign up to view the full content.

Math 184A Final Exam 8–11AM Monday 12/13/99 1. AUTOMATIC contains 2 pairs of repeated letters and 7 distinct letters for a total of 9 letters. For 4 n 7, ﬁnd a formula for the number of n -letter “words” that can be made from this collection of letters. Your answer should be a formula involving n , not 4 separate numbers for n =4 , 5 , 6 , 7. 2. Let P k ( n ) be the number of permutations of the set { 1 ,...,n } having no cycles of length greater than k .Thu s P 1 ( n ) = 1 for n> 0 since all cycles are of length 1. For later convenience, deﬁne P k ( n )= 0 , if n< 0 1 , if n =0. (a) By considering the cycle containing n +1, prove that P 2 ( n +1) = P 2 ( n )+ nP 2 ( n - 1) for n 0. (Be careful for small values of n .) (b) State and prove a similar recursion for P 3 ( n + 1). 3. Deﬁne a “special” tree to be a rooted plane tree which is either a single vertex (the root) or a root vertex that is joined to either a left tree or a right tree or both a left and right tree.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

184a_99f_fe - Math 184A Final Exam 811AM Monday 1 AUTOMATIC...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online